Siddharth Bhaskar

Orcid: 0000-0003-4157-8768

According to our database1, Siddharth Bhaskar authored at least 16 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Subclasses of Ptime Interpreted by Programming Languages.
Theory Comput. Syst., June, 2023

Read/write factorizable programs.
J. Funct. Program., 2023

Rational functions via recursive schemes.
CoRR, 2023

2021
Tameness in least fixed-point logic and McColm's conjecture.
Log. Methods Comput. Sci., 2021

Thicket density.
J. Symb. Log., 2021

A refinement of the Meyer-McCreight Union Theorem.
Electron. Colloquium Comput. Complex., 2021

Graph Traversals as Universal Constructions.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME.
Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020

Traversal-invariant characterizations of logarithmic space.
CoRR, 2020

Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions.
Proceedings of the Language and Automata Theory and Applications, 2020

2018
Recursion versus tail recursion over ‾𝔽<sub>p</sub>.
J. Log. Algebraic Methods Program., 2018

2017
A Difference in Complexity Between Recursion and Tail Recursion.
Theory Comput. Syst., 2017

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

2016
Asymptotic Logical Uncertainty and the Benford Test.
Proceedings of the Artificial General Intelligence - 9th International Conference, 2016

2015
Recursion versus Tail Recursion over Abstract Structures.
PhD thesis, 2015

Asymptotic Logical Uncertainty and The Benford Test.
CoRR, 2015


  Loading...