Siddharth Bhaskar

Available identifiers

Publication	Date of Publication	Type
Read/write factorizable programs	2023-08-09	Paper
Graph Traversals as Universal Constructions	2023-08-08	Paper
Subclasses of \textsc{Ptime} interpreted by programming languages	2023-07-26	Paper
https://portal.mardi4nfdi.de/entity/Q5020650	2022-01-06	Paper
THICKET DENSITY	2021-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q5856403	2021-03-26	Paper
Boolean monadic recursive schemes as a logical characterization of the subsequential functions	2020-07-27	Paper
Traversal-invariant characterizations of logarithmic space	2020-06-12	Paper
Algorithmic Traversals of Infinite Graphs	2018-10-23	Paper
Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)	2017-12-01	Paper
Tameness in least fixed-point logic and McColm's conjecture	2017-07-31	Paper
A difference in complexity between recursion and tail recursion	2017-03-31	Paper
Thicket Density	2017-02-13	Paper

This page was built for person: Siddharth Bhaskar