Siddharth Bhaskar

20 papers B 1C 2Journal 12Unranked 4
YearRankTypeTitle / Venue / Authors
2026 — conf
Like Parsley in Greek Food: Elementary Set Theory and the Case for DM1.
SIGCSE (1)
Siddharth Bhaskar
2025 C conf
Transfinite Structured Programming.
CiE
Siddharth Bhaskar
2024 — conf
Traversal-Invariant Characterizations of Logarithmic Space.
Tannen's Festschrift
Siddharth Bhaskar, Steven Lindell, Scott Weinstein
2023 J jnl
Rational functions via recursive schemes.
CoRR
Siddharth Bhaskar, Jane Chandlee, Adam Jardine
2023 J jnl
Read/write factorizable programs.
J. Funct. Program.
Siddharth Bhaskar, Jakob Grue Simonsen
2023 J jnl
Subclasses of Ptime Interpreted by Programming Languages.
Theory Comput. Syst.
Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen
2021 J jnl
A refinement of the Meyer-McCreight Union Theorem.
Electron. Colloquium Comput. Complex.
Siddharth Bhaskar
2021 B conf
Graph Traversals as Universal Constructions.
MFCS
Siddharth Bhaskar, Robin Kaarsgaard
2021 J jnl
Graph Traversals as Universal Constructions.
CoRR
Siddharth Bhaskar, Robin Kaarsgaard
2021 J jnl
Tameness in least fixed-point logic and McColm's conjecture.
Log. Methods Comput. Sci.
Siddharth Bhaskar, Alex Kruckman
2021 J jnl
Thicket density.
J. Symb. Log.
Siddharth Bhaskar
2020 C conf
Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions.
LATA
Siddharth Bhaskar, Jane Chandlee, Adam Jardine, Christopher Oakden
2020 — conf
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME.
VPT/HCVS@ETAPS
Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen
2020 J jnl
Traversal-invariant characterizations of logarithmic space.
CoRR
Siddharth Bhaskar, Steven Lindell, Scott Weinstein
2018 J jnl
Recursion versus tail recursion over ‾𝔽
J. Log. Algebraic Methods Program.
Siddharth Bhaskar
2017 J jnl
A Difference in Complexity Between Recursion and Tail Recursion.
Theory Comput. Syst.
Siddharth Bhaskar
2017 J jnl
Model-theoretic dividing lines in least fixed-point logic over finite structures.
CoRR
Siddharth Bhaskar, Alex Kruckman
2016 — conf
Asymptotic Logical Uncertainty and the Benford Test.
AGI
Scott Garrabrant, Tsvi Benson-Tilsen, Siddharth Bhaskar, Abram Demski, Joanna Garrabrant, George Koleszarik, Evan Lloyd
2015 J jnl
Asymptotic Logical Uncertainty and The Benford Test.
CoRR
Scott Garrabrant, Siddharth Bhaskar, Abram Demski, Joanna Garrabrant, George Koleszarik, Evan Lloyd
2015 — —
Recursion versus Tail Recursion over Abstract Structures.
Siddharth Bhaskar