On the public citation graph
RL $$ \subseteq $$ SC
0 signed · 62 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/bf01305237openalex-snapshot
Pseudorandom generators for space-bounded computation
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0304-3975(93)90258-uopenalex-snapshot
On read once vs. multiple access to randomness in logspace
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1137/0218038openalex-snapshot
Two Applications of Inductive Counting for Complementation Problems
inferredcites →https://doi.org/10.1145/103418.103430openalex-snapshot
Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199712)11:4<315::aid-rsa3>3.0.co;2-1openalex-snapshot
Tiny families of functions with random properties: A quality-size trade-off for hashing
inferred← citeshttps://doi.org/10.1002/rsa.21152openalex-snapshot
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
inferred← citeshttps://doi.org/10.1007/11523468_79openalex-snapshot
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
inferred← citeshttps://doi.org/10.1007/11944836_12openalex-snapshot
On Obtaining Pseudorandomness from Error-Correcting Codes
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_251openalex-snapshot
Time space tradeoffs (getting closer to the barrier?)
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_4openalex-snapshot
Dynamic Complexity of Expansion
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_21openalex-snapshot
On Algorithmic Statistics for Space-Bounded Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_18openalex-snapshot
Randomized Time-Space Tradeoffs for Directed Graph Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_50openalex-snapshot
Time-Space Tradeoff in Derandomizing Probabilistic Logspace
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_41openalex-snapshot
Arithmetizing Classes Around NC 1 and L
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_26openalex-snapshot
Derandomization of Euclidean Random Walks
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_26openalex-snapshot
Bravely, Moderately: A Common Theme in Four Recent Works
inferred← citeshttps://doi.org/10.1007/978-3-662-12521-2openalex-snapshot
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
inferred← citeshttps://doi.org/10.1007/bf01202039openalex-snapshot
Undirecteds-t connectivity in polynomial time and sublinear space
inferred← citeshttps://doi.org/10.1007/s00037-012-0036-6openalex-snapshot
Pseudorandom Generators for Combinatorial Checkerboards
inferred← citeshttps://doi.org/10.1007/s00037-016-0150-yopenalex-snapshot
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace
inferred← citeshttps://doi.org/10.1007/s00037-025-00275-6openalex-snapshot
Derandomizing Logspace With a Small Shared Hard Drive
inferred← citeshttps://doi.org/10.1007/s00224-005-1264-9openalex-snapshot
Time-Space Tradeoff in Derandomizing Probabilistic Logspace
inferred← citeshttps://doi.org/10.1007/s00224-009-9233-3openalex-snapshot
Arithmetizing Classes Around $\textsf{NC}$ 1 and $\textsf{L}$
inferred← citeshttps://doi.org/10.1007/s00453-018-0471-0openalex-snapshot
Deterministic Parallel Algorithms for Bilinear Objective Functions
inferred← citeshttps://doi.org/10.1007/s11512-007-0045-xopenalex-snapshot
On the computational complexity of the Riemann mapping
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.06.010openalex-snapshot
Time and space optimality of rotor-router graph exploration
inferred← citeshttps://doi.org/10.1051/ita/1996300100011openalex-snapshot
Relationships among $PL$, $\#L$, and the determinant
inferred← citeshttps://doi.org/10.1090/ulect/055openalex-snapshot
A Primer on Pseudorandom Generators
inferred← citeshttps://doi.org/10.1109/ccc.1999.766276openalex-snapshot
Deterministic amplification of space-bounded probabilistic algorithms
inferred← citeshttps://doi.org/10.1109/focs.2010.10openalex-snapshot
The Coin Problem and Pseudorandomness for Branching Programs
inferred← citeshttps://doi.org/10.1109/focs.2010.11openalex-snapshot
Pseudorandom Generators for Regular Branching Programs
inferred← citeshttps://doi.org/10.1109/focs.2015.60openalex-snapshot
Pseudorandomness via the Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303250openalex-snapshot
Traversal of a quasi-planar subdivision without using mark bits (extended abstract)
inferred← citeshttps://doi.org/10.1137/050642228openalex-snapshot
Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines
inferred← citeshttps://doi.org/10.1137/120875673openalex-snapshot
Pseudorandom Generators for Regular Branching Programs
inferred← citeshttps://doi.org/10.1137/16m1062132openalex-snapshot
Pseudorandomness via the Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1137/17m1145707openalex-snapshot
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
inferred← citeshttps://doi.org/10.1137/18m1197734openalex-snapshot
Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs
inferred← citeshttps://doi.org/10.1137/20m134109xopenalex-snapshot
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space
inferred← citeshttps://doi.org/10.1137/s0097539793282947openalex-snapshot
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata
inferred← citeshttps://doi.org/10.1137/s0097539793283151openalex-snapshot
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
inferred← citeshttps://doi.org/10.1142/s0219265904001234openalex-snapshot
TRAVERSAL OF A QUASI-PLANAR SUBDIVISION WITHOUT USING MARK BITS
inferred← citeshttps://doi.org/10.1145/1140612.1140621openalex-snapshot
SIGACT news complexity theory column 51
inferred← citeshttps://doi.org/10.1145/1993636.1993672openalex-snapshot
Pseudorandom generators for group products
inferred← citeshttps://doi.org/10.1145/2591796.2591808openalex-snapshot
On derandomizing algorithms that err extremely rarely
inferred← citeshttps://doi.org/10.1145/3154856openalex-snapshot
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs
inferred← citeshttps://doi.org/10.1145/3154857openalex-snapshot
An O ( n ϵ ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
inferred← citeshttps://doi.org/10.1145/333979.333984openalex-snapshot
An O (log( n ) 4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs
inferred← citeshttps://doi.org/10.1145/3564246.3585181openalex-snapshot
Approximating Iterated Multiplication of Stochastic Matrices in Small Space
inferred← citeshttps://doi.org/10.1145/3618260.3649772openalex-snapshot
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL
inferred← citeshttps://doi.org/10.1145/3717823.3718303openalex-snapshot
When Connectivity Is Hard, Random Walks Are Easy with Non-determinism
inferred← citeshttps://doi.org/10.1561/9781601980854openalex-snapshot
A Survey of Lower Bounds for Satisfiability and Related Problems
inferred← citeshttps://doi.org/10.4171/022-3/51openalex-snapshot
On expander graphs and connectivity in small space
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2025.36openalex-snapshot
Optimal Error Pseudodistributions for Read-Once Branching Programs
inferred← citeshttps://doi.org/10.70675/58e2747az6a79z40dezb604zbcda2fb26d19openalex-snapshot
Algorithms for deterministic parallel graph exploration
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.