On the public citation graph

${\text{ASPACE}}(o(\log \log n))$ is Regular

https://doi.org/10.1137/0222011
0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01744432openalex-snapshot
Towards separating nondeterminism from determinism
inferredcites →https://doi.org/10.1007/bfb0028785openalex-snapshot
Space complexity of alternating Turing machines
inferredcites →https://doi.org/10.1016/0020-0190(87)90085-8openalex-snapshot
Some observations concerning alternating turing machines using small space
inferredcites →https://doi.org/10.1016/0020-0190(88)90081-6openalex-snapshot
Some observations concerning alternating turing machines using small space
inferredcites →https://doi.org/10.1016/0022-0000(80)90036-7openalex-snapshot
Tree-size bounded alternation
inferredcites →https://doi.org/10.1137/0213010openalex-snapshot
Alternating Pushdown and Stack Automata
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1997.2682openalex-snapshot
Bridging across the log(n) Space Frontier
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_137openalex-snapshot
Strong optimal lower bounds for Turing machines that accept nonregular languages
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_9openalex-snapshot
Computing with Sublogarithmic Space
inferred← citeshttps://doi.org/10.1007/978-3-319-92402-1_6openalex-snapshot
Minimal Useful Size of Counters for (Real-Time) Multicounter Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_28openalex-snapshot
Factoring and Testing Primes in Small Space
inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_16openalex-snapshot
Unary Coded NP-Complete Languages in ASPACE (log log n)
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_16openalex-snapshot
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space
inferred← citeshttps://doi.org/10.1007/bf01271368openalex-snapshot
The alternation hierarchy for sublogarithmic space is infinite
inferred← citeshttps://doi.org/10.1007/bfb0029952openalex-snapshot
Computational limitations of Stochastic Turing machines and Arthur-Merlin games with small space bounds
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00151-2openalex-snapshot
A remark on middle space bounded alternating Turing machines
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00299-1openalex-snapshot
Time lower bounds do not exist for CRCW PRAMs
inferred← citeshttps://doi.org/10.1016/j.ic.2017.02.001openalex-snapshot
Alternating space is closed under complement and other simulations for sublogarithmic space
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.044openalex-snapshot
An alternating hierarchy for finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.032openalex-snapshot
Improved average complexity for comparison-based sorting
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00296-4openalex-snapshot
For completeness, sublogarithmic space is no space
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00033-9openalex-snapshot
A communication hierarchy of parallel computations
inferred← citeshttps://doi.org/10.1051/ita/1994280504651openalex-snapshot
A hierarchy that does not collapse : alternations in low level space
inferred← citeshttps://doi.org/10.1051/ita/2013038openalex-snapshot
Factoring and testing primes in small space
inferred← citeshttps://doi.org/10.1051/ita:2000101openalex-snapshot
A Space Lower Bound for Acceptance by One-Way Π2-Alternating Machines
inferred← citeshttps://doi.org/10.1109/sct.1994.315816openalex-snapshot
The complexity world below logarithmic space
inferred← citeshttps://doi.org/10.1137/s0097539796301306openalex-snapshot
Sublogarithmic Bounds on Space and Reversals
inferred← citeshttps://doi.org/10.1142/s0129054101000552openalex-snapshot
CLOSURE PROPERTY OF PROBABILISTIC TURING MACHINES AND ALTERNATING TURING MACHINES WITH SUBLOGARITHMIC SPACES
inferred← citeshttps://doi.org/10.1142/s012905410800598xopenalex-snapshot
TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE
inferred← citeshttps://doi.org/10.1142/s0129054113400376openalex-snapshot
UNARY CODED NP-COMPLETE LANGUAGES IN ASPACE( log log n)
inferred← citeshttps://doi.org/10.1142/s0129054116400098openalex-snapshot
New Results on the Minimum Amount of Useful Space
inferred← citeshttps://doi.org/10.1142/s0218001499000306openalex-snapshot
SPACE HIERARCHIES OF TWO-DIMENSIONAL ALTERNATING TURING MACHINES, PUSHDOWN AUTOMATA AND COUNTER AUTOMATA
inferred← citeshttps://doi.org/10.25596/jalc-2002-395openalex-snapshot
A Leaf-Size Hierarchy of Alternating Rebound Turing Machines
inferred← citeshttps://doi.org/10.3233/fi-2010-335openalex-snapshot
One Pebble Versus ϵ · log n Bits
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.