Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Siddharth Bhaskar
Observed names:
Bhaskar, Siddharth,
SIDDHARTH BHASKAR
Institution:
University of Southern Denmark
Observed institutions:
Wesleyan University,
James Madison University,
University of Copenhagen,
Haverford College,
University of California, Los Angeles,
University of Southern Denmark,
Indiana University Bloomington
show all 7
ORCID:
0000-0003-4157-8768
Observed ORCID:
0000-0003-4157-8768
OpenAlex ID:
A5067084231
THICKET DENSITY
2021
·
SIDDHARTH BHASKAR
·
Journal of Symbolic Logic
·
18
A Difference in Complexity Between Recursion and Tail Recursion
2016
·
Siddharth Bhaskar
·
Theory of Computing Systems
·
16
Recursion versus tail recursion over F¯p
2017
·
Siddharth Bhaskar
·
Journal of Logical and Algebraic Methods in Programming
·
14
PDF
Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions
2020
·
Siddharth Bhaskar
, Jane Chandlee
, et al.
·
Lecture notes in computer science
·
11
PDF
Asymptotic Logical Uncertainty and The Benford Test
2015
·
Garrabrant, Scott
, Bhaskar, Siddharth
, et al.
·
arXiv (Cornell University)
·
4
PDF
Rational functions via recursive schemes
2023
·
Bhaskar, Siddharth
, Chandlee, Jane
, et al.
·
arXiv (Cornell University)
·
3
PDF
Asymptotic Logical Uncertainty and the Benford Test
2016
·
Scott Garrabrant
, Tsvi Benson-Tilsen
, et al.
·
Lecture notes in computer science
·
3
Subclasses of Ptime Interpreted by Programming Languages
2022
·
Siddharth Bhaskar
, Cynthia Kop
, et al.
·
Theory of Computing Systems
·
2
PDF
Traversal-Invariant Characterizations of Logarithmic Space
2020
·
Bhaskar, Siddharth
, Lindell, Steven
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
Graph Traversals as Universal Constructions
2021
·
Bhaskar, Siddharth
, Kaarsgaard, Robin
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
1
PDF
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME
2020
·
Neil D. Jones
, Siddharth Bhaskar
, et al.
·
Electronic Proceedings in Theoretical Computer Science
·
1
Algorithmic Traversals of Infinite Graphs
2018
·
Bhaskar, Siddharth
, Kienzle, Anton Jay
·
arXiv (Cornell University)
·
1
PDF
Shadowy Institutions
2026
·
Siddharth Bhaskar
, Robin Kaarsgaard
·
Lecture notes in computer science
Like Parsley in Greek Food: Elementary Set Theory and the Case for DM1
2026
·
Siddharth Bhaskar
·
ACM Technical Symposium on Computer Science Education (SIGCSE)
Transfinite Structured Programming
2025
·
Siddharth Bhaskar
·
Lecture notes in computer science
Read/write factorizable programs
2023
·
SIDDHARTH BHASKAR
, JAKOB GRUE SIMONSEN
·
Journal of Functional Programming
PDF
Tameness in least fixed-point logic and McColm's conjecture
2021
·
Siddharth Bhaskar
, Alex Kruckman
·
Logical Methods in Computer Science
PDF
A refinement of the Meyer-McCreight Union Theorem.
2021
·
Siddharth Bhaskar
·
Electronic colloquium on computational complexity
Model-theoretic dividing lines in least fixed-point logic over finite structures.
2017
·
Siddharth Bhaskar
, Alex Kruckman
Recursion versus Tail Recursion over Abstract Structures
2015
·
Siddharth Bhaskar
·
eScholarship (California Digital Library)
Show more works
View as search
Works count:
20
Citation count:
76
H-index:
4
I10-index:
4
Year
Topic
Type