On the public citation graph
Pseudorandom Generators for Regular Branching Programs
0 signed · 40 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.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
inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1007/bf01305237openalex-snapshot
Pseudorandom generators for space-bounded computation
inferredcites →https://doi.org/10.1016/0022-0000(89)90037-8openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00453-024-01251-2openalex-snapshot
Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115818openalex-snapshot
Pseudorandom generators for sliding-window 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.2015.60openalex-snapshot
Pseudorandomness via the Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1109/focs.2017.80openalex-snapshot
Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time
inferred← citeshttps://doi.org/10.1109/focs.2018.00015openalex-snapshot
Simple Optimal Hitting Sets for Small-Success RL
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00106openalex-snapshot
Tight Space Complexity of the Coin Problem
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00072openalex-snapshot
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting
inferred← citeshttps://doi.org/10.1137/1.9781611977066.5openalex-snapshot
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch190openalex-snapshot
Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness
inferred← citeshttps://doi.org/10.1137/16m1062132openalex-snapshot
Pseudorandomness via the Discrete Fourier Transform
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/19m1268707openalex-snapshot
Simple Optimal Hitting Sets for Small-Success RL
inferred← citeshttps://doi.org/10.1145/3170709openalex-snapshot
Identity Testing and Lower Bounds for Read- k Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1145/3188745.3188780openalex-snapshot
Hitting sets with near-optimal error for read-once branching programs
inferred← citeshttps://doi.org/10.1145/3313276.3316319openalex-snapshot
Pseudorandom generators for width-3 branching programs
inferred← citeshttps://doi.org/10.1145/3378663openalex-snapshot
Pseudorandom Bits for Oblivious Branching Programs
inferred← citeshttps://doi.org/10.1145/3465084.3467937openalex-snapshot
Improved Deterministic (Δ+1) Coloring in Low-Space MPC
inferred← citeshttps://doi.org/10.1145/3564246.3585181openalex-snapshot
Approximating Iterated Multiplication of Stochastic Matrices in Small Space
inferred← citeshttps://doi.org/10.1515/9780823295708-025openalex-snapshot
CHAPTER NOTES AND REFERENCES
inferred← citeshttps://doi.org/10.1561/0400000109openalex-snapshot
Paradigms for Unconditional Pseudorandom Generators
inferred← citeshttps://doi.org/10.3233/fi-2021-2101openalex-snapshot
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
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.4230/lipics.ccc.2016.30openalex-snapshot
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1411.4584openalex-snapshot
Pseudorandomness for concentration bounds and signed majorities
inferred← citeshttps://doi.org/10.48550/arxiv.1506.04350openalex-snapshot
Pseudorandomness via the discrete Fourier transform
inferred← citeshttps://doi.org/10.48550/arxiv.2010.16257openalex-snapshot
Universality for Doubly Stochastic Matrices
inferred← citeshttps://doi.org/10.5040/9780755625963.0007openalex-snapshot
Chapter Notes and References
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.