Siddharth Bhaskar

According to our database, Siddharth Bhaskar authored at least 16 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Traversal-Invariant Characterizations of Logarithmic Space.

Siddharth Bhaskar, Steven Lindell, Scott Weinstein

Proceedings of the Provenance of Elegance in Computation - Essays Dedicated to Val Tannen, 2024

2023

Subclasses of Ptime Interpreted by Programming Languages.

Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen

Theory Comput. Syst., June, 2023

Read/write factorizable programs.

Siddharth Bhaskar, Jakob Grue Simonsen

J. Funct. Program., 2023

Rational functions via recursive schemes.

Siddharth Bhaskar, Jane Chandlee, Adam Jardine

CoRR, 2023

2021

Tameness in least fixed-point logic and McColm's conjecture.

Siddharth Bhaskar, Alex Kruckman

Log. Methods Comput. Sci., 2021

Thicket density.

Siddharth Bhaskar

J. Symb. Log., 2021

A refinement of the Meyer-McCreight Union Theorem.

Siddharth Bhaskar

Electron. Colloquium Comput. Complex., 2021

Graph Traversals as Universal Constructions.

Siddharth Bhaskar, Robin Kaarsgaard

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME.

Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen

Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020

Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions.

Siddharth Bhaskar, Jane Chandlee, Adam Jardine, Christopher Oakden

Proceedings of the Language and Automata Theory and Applications, 2020

2018

Recursion versus tail recursion over ‾𝔽_p.

Siddharth Bhaskar

J. Log. Algebraic Methods Program., 2018

2017

A Difference in Complexity Between Recursion and Tail Recursion.

Siddharth Bhaskar

Theory Comput. Syst., 2017

Model-theoretic dividing lines in least fixed-point logic over finite structures.

Siddharth Bhaskar, Alex Kruckman

CoRR, 2017

2016

Asymptotic Logical Uncertainty and the Benford Test.

Scott Garrabrant, Tsvi Benson-Tilsen, Siddharth Bhaskar, Abram Demski, Joanna Garrabrant, George Koleszarik, Evan Lloyd

Proceedings of the Artificial General Intelligence - 9th International Conference, 2016

2015

Recursion versus Tail Recursion over Abstract Structures.

Siddharth Bhaskar

PhD thesis, 2015

Asymptotic Logical Uncertainty and The Benford Test.

Scott Garrabrant, Siddharth Bhaskar, Abram Demski, Joanna Garrabrant, George Koleszarik, Evan Lloyd

CoRR, 2015