On the public citation graph
On probabilistic time and space
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-12689-9_95openalex-snapshot
The classification of problems which have fast parallel algorithms
inferredcites →https://doi.org/10.1007/3-540-13345-3_25openalex-snapshot
On probabilistic tape complexity and fast circuits for matrix inversion problems
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/s0019-9958(83)80060-6openalex-snapshot
Parallel computation for well-endowed rings and space-bounded probabilistic machines
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1145/800070.802194openalex-snapshot
Space-bounded hierarchies and probabilistic computations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1655openalex-snapshot
Space-Bounded Quantum Complexity
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_133openalex-snapshot
Running time to recognize nonregular languages by 2-way probabilistic automata
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_73openalex-snapshot
Regularity of one-letter languages acceptable by 2-way finite probabilistic automata
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_107openalex-snapshot
On the structure of log-space probabilistic complexity classes
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_103openalex-snapshot
Multihead two-way probabilistic finite automata
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_11openalex-snapshot
Arithmetic Circuits with Division
inferred← citeshttps://doi.org/10.1007/bf02679455openalex-snapshot
Multihead two-way probabilistic finite automata
inferred← citeshttps://doi.org/10.1007/bfb0029956openalex-snapshot
The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes
inferred← citeshttps://doi.org/10.1007/s00037-003-0177-8openalex-snapshot
On the complexity of simulating space-bounded quantum computations
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90151-5openalex-snapshot
A survey of space complexity
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80063-9openalex-snapshot
Feasible arithmetic computations: Valiant's hypothesis
inferred← citeshttps://doi.org/10.1051/ita/1996300100011openalex-snapshot
Relationships among $PL$, $\#L$, and the determinant
inferred← citeshttps://doi.org/10.1109/ccc.1996.507676openalex-snapshot
Randomization and derandomization in space-bounded computation
inferred← citeshttps://doi.org/10.1109/ccc.1998.694607openalex-snapshot
Relationships between quantum and classical space-bounded complexity classes
inferred← citeshttps://doi.org/10.1109/ccc.1998.694621openalex-snapshot
Complexity issues in Markov decision processes
inferred← citeshttps://doi.org/10.1109/sct.1988.5271openalex-snapshot
Two applications of complementation via inductive counting
inferred← citeshttps://doi.org/10.1109/sct.1994.315797openalex-snapshot
Relationships among PL, #L, and the determinant
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814605openalex-snapshot
On quantum and classical space-bounded processes with algebraic transition amplitudes
inferred← citeshttps://doi.org/10.1137/0218038openalex-snapshot
Two Applications of Inductive Counting for Complementation Problems
inferred← citeshttps://doi.org/10.1137/0218084openalex-snapshot
Erratum: Two Applications of Indctive Counting for Complementation Problems
inferred← citeshttps://doi.org/10.1137/s0097539796298339openalex-snapshot
On the Structure of Logspace Probabilistic Complexity Classes
inferred← citeshttps://doi.org/10.1145/211542.606544openalex-snapshot
SIGACT News Complexity Theory Column 10
inferred← citeshttps://doi.org/10.1145/237814.237856openalex-snapshot
The complexity of matrix rank and feasible systems of linear equations (extended abstract)
inferred← citeshttps://doi.org/10.1145/347476.347480openalex-snapshot
Complexity of finite-horizon Markov decision process problems
inferred← citeshttps://doi.org/10.1613/jair.505openalex-snapshot
The Computational Complexity of Probabilistic Planning
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.