default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiddharth Bhaskar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Siddharth Bhaskar, Steven Lindell, Scott Weinstein:
Traversal-Invariant Characterizations of Logarithmic Space. Tannen's Festschrift 2024: 2:1-2:17- 2023
- [j6]Siddharth Bhaskar
, Jakob Grue Simonsen:
Read/write factorizable programs. J. Funct. Program. 33 (2023) - [j5]Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen:
Subclasses of Ptime Interpreted by Programming Languages. Theory Comput. Syst. 67(3): 437-472 (2023) - [i6]Siddharth Bhaskar, Jane Chandlee, Adam Jardine:
Rational functions via recursive schemes. CoRR abs/2302.03074 (2023) - 2021
- [j4]Siddharth Bhaskar:
Thicket density. J. Symb. Log. 86(1): 110-127 (2021) - [j3]Siddharth Bhaskar, Alex Kruckman:
Tameness in least fixed-point logic and McColm's conjecture. Log. Methods Comput. Sci. 17(1) (2021) - [c4]Siddharth Bhaskar, Robin Kaarsgaard:
Graph Traversals as Universal Constructions. MFCS 2021: 17:1-17:20 - [i5]Siddharth Bhaskar, Robin Kaarsgaard:
Graph Traversals as Universal Constructions. CoRR abs/2104.14877 (2021) - [i4]Siddharth Bhaskar:
A refinement of the Meyer-McCreight Union Theorem. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c3]Siddharth Bhaskar, Jane Chandlee, Adam Jardine, Christopher Oakden:
Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions. LATA 2020: 157-169 - [c2]Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen:
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. VPT/HCVS@ETAPS 2020: 65-79 - [i3]Siddharth Bhaskar, Steven Lindell, Scott Weinstein:
Traversal-invariant characterizations of logarithmic space. CoRR abs/2006.07067 (2020)
2010 – 2019
- 2018
- [j2]Siddharth Bhaskar:
Recursion versus tail recursion over ‾𝔽p. J. Log. Algebraic Methods Program. 94: 68-90 (2018) - 2017
- [j1]Siddharth Bhaskar:
A Difference in Complexity Between Recursion and Tail Recursion. Theory Comput. Syst. 60(2): 299-313 (2017) - [i2]Siddharth Bhaskar, Alex Kruckman:
Model-theoretic dividing lines in least fixed-point logic over finite structures. CoRR abs/1708.00148 (2017) - 2016
- [c1]Scott Garrabrant, Tsvi Benson-Tilsen, Siddharth Bhaskar, Abram Demski, Joanna Garrabrant, George Koleszarik, Evan Lloyd:
Asymptotic Logical Uncertainty and the Benford Test. AGI 2016: 202-211 - 2015
- [b1]Siddharth Bhaskar:
Recursion versus Tail Recursion over Abstract Structures. University of California, Los Angeles, USA, 2015 - [i1]Scott Garrabrant, Siddharth Bhaskar, Abram Demski, Joanna Garrabrant, George Koleszarik, Evan Lloyd:
Asymptotic Logical Uncertainty and The Benford Test. CoRR abs/1510.03370 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
