On the public citation graph
Pseudorandom generators for space-bounded computation
0 signed · 388 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.1016/0020-0190(88)90197-4openalex-snapshot
Universal traversal sequences of length nO(log n) for cliques
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(88)90035-9openalex-snapshot
Expanders, randomness, or time versus space
inferredcites →https://doi.org/10.1016/0022-314x(80)90084-0openalex-snapshot
Probabilistic algorithm for testing primality
inferredcites →https://doi.org/10.1016/0890-5401(87)90023-xopenalex-snapshot
On using deterministic functions to reduce randomness in probabilistic algorithms
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.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1985.19openalex-snapshot
Deterministic simulation of probabilistic constant depth circuits
inferredcites →https://doi.org/10.1109/sfcs.1989.63449openalex-snapshot
Dispersers, deterministic amplification, and weak random sources
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1145/100216.100246openalex-snapshot
The computational complexity of universal hashing
inferredcites →https://doi.org/10.1145/28395.28410openalex-snapshot
Deterministic simulation in LOGSPACE
inferredcites →https://doi.org/10.1145/28395.28413openalex-snapshot
Efficiency considerations in using semi-random sources
inferredcites →https://doi.org/10.1145/62212.62260openalex-snapshot
Polynomial universal traversing sequences for cycles are constructible
inferredcites →https://doi.org/10.1145/73007.73008openalex-snapshot
Multiparty protocols and logspace-hard pseudorandom sequences
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions
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.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1006/jcss.1998.1618openalex-snapshot
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
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/11538462_30openalex-snapshot
Derandomized Constructions of k-Wise (Almost) Independent Permutations
inferred← citeshttps://doi.org/10.1007/11672142_38openalex-snapshot
Linear Advice for Randomized Logarithmic Space
inferred← citeshttps://doi.org/10.1007/11818175_2openalex-snapshot
On the Power of the Randomized Iterate
inferred← citeshttps://doi.org/10.1007/11830924_37openalex-snapshot
Randomness-Efficient Sampling Within NC 1
inferred← citeshttps://doi.org/10.1007/11841036_16openalex-snapshot
Estimating Entropy over Data Streams
inferred← citeshttps://doi.org/10.1007/11944836_12openalex-snapshot
On Obtaining Pseudorandomness from Error-Correcting Codes
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_2openalex-snapshot
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n 4.03)
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_17openalex-snapshot
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good
inferred← citeshttps://doi.org/10.1007/3-540-49543-6_5openalex-snapshot
On the Derandomization of Space-Bounded Computations
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_130openalex-snapshot
My favorite ten complexity theorems of the past decade
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_143openalex-snapshot
On type-2 probabilistic quantifiers
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_225openalex-snapshot
Randomness-efficient non-interactive zero knowledge
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_5openalex-snapshot
A Taxonomy of Proof Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_1openalex-snapshot
Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-030-17653-2_16openalex-snapshot
Tight Time-Memory Trade-Offs for Symmetric Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-30719-6_10openalex-snapshot
Online and Scalable Adaptive Cyber Defense
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_15openalex-snapshot
Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_15openalex-snapshot
On the Streaming Indistinguishability of a Random Permutation and a Random Function
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_1openalex-snapshot
Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-05491-4_7openalex-snapshot
A Prototype Design on Privacy-Preserving Outsourced Bayesian Network
inferred← citeshttps://doi.org/10.1007/978-3-031-58751-1_9openalex-snapshot
Strong Batching for Non-interactive Statistical Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_7openalex-snapshot
Progress on Polynomial Identity Testing-II
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_18openalex-snapshot
A New View on Worst-Case to Average-Case Reductions for NP Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_39openalex-snapshot
Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality
inferred← citeshttps://doi.org/10.1007/978-3-319-68711-7_4openalex-snapshot
Efficient Rational Proofs for Space Bounded Computations
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_15openalex-snapshot
Universal Hashing via Integer Arithmetic Without Primes, Revisited
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-28608-0_14openalex-snapshot
Stable Distributions in Streaming Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_16openalex-snapshot
Estimating Dominance Norms of Multiple Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_9openalex-snapshot
Estimating Hybrid Frequency Moments of Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_33openalex-snapshot
Lower Bounds for Swapping Arthur and Merlin
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_35openalex-snapshot
On Estimating Frequency Moments of Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_33openalex-snapshot
Saving Private Randomness in One-Way Functions and Pseudorandom Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-02158-9_18openalex-snapshot
A Note on Estimating Hybrid Frequency Moment of Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_46openalex-snapshot
Pseudorandom Bit Generators That Fool Modular Sums
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_49openalex-snapshot
Small-Bias Spaces for Group Products
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_53openalex-snapshot
Data Stream Algorithms for Codeword Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-17367-7openalex-snapshot
Cryptography in Constant Parallel Time
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_10openalex-snapshot
Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_13openalex-snapshot
Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_5openalex-snapshot
Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error
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-642-22935-0_14openalex-snapshot
Periodicity and Cyclic Shifts via Linear Sketches
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_33openalex-snapshot
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3
inferred← citeshttps://doi.org/10.1007/978-3-642-27954-6_12openalex-snapshot
A New Pseudorandom Generator from Collision-Resistant Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_36openalex-snapshot
Optimal Hitting Sets for Combinatorial Shapes
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_38openalex-snapshot
Pseudorandomness for Linear Length Branching Programs and Stack Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_42openalex-snapshot
An Explicit VC-Theorem for Low-Degree Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_19openalex-snapshot
Amortized Communication Complexity of an Equality Predicate
inferred← citeshttps://doi.org/10.1007/978-3-642-38980-1_21openalex-snapshot
Fast and Maliciously Secure Two-Party Computation Using the GPU
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_11openalex-snapshot
Efficient Multiparty Protocols via Log-Depth Threshold Formulae
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_1openalex-snapshot
Spectral Sparsification in Dynamic Graph Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_37openalex-snapshot
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_14openalex-snapshot
Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters
inferred← citeshttps://doi.org/10.1007/978-3-662-12521-2openalex-snapshot
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_2openalex-snapshot
The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_34openalex-snapshot
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_44openalex-snapshot
Taylor Polynomial Estimator for Estimating Frequency Moments
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_38openalex-snapshot
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_23openalex-snapshot
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_31openalex-snapshot
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
inferred← citeshttps://doi.org/10.1007/978-981-96-0668-9_20openalex-snapshot
A Satisfiability Algorithm for Depth Two Circuits with a Sub-Quadratic Number of Symmetric and Threshold Gates
inferred← citeshttps://doi.org/10.1007/bf01200118openalex-snapshot
Bounds on tradeoffs between randomness and communication complexity
inferred← citeshttps://doi.org/10.1007/bf01200907openalex-snapshot
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
inferred← citeshttps://doi.org/10.1007/bfb0055056openalex-snapshot
Improved pseudorandom generators for combinatorial rectangles
inferred← citeshttps://doi.org/10.1007/bfb0058020openalex-snapshot
Solving Some Discrepancy Problems in NC
inferred← citeshttps://doi.org/10.1007/s00037-007-0238-5openalex-snapshot
Randomness-Efficient Sampling within NC1
inferred← citeshttps://doi.org/10.1007/s00037-009-0267-3openalex-snapshot
On Approximate Majority and Probabilistic Time
inferred← citeshttps://doi.org/10.1007/s00037-010-0287-zopenalex-snapshot
A New Characterization of ACC0 and Probabilistic CC0
inferred← citeshttps://doi.org/10.1007/s00037-011-0006-4openalex-snapshot
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao’s Lemma
inferred← citeshttps://doi.org/10.1007/s00037-012-0036-6openalex-snapshot
Pseudorandom Generators for Combinatorial Checkerboards
inferred← citeshttps://doi.org/10.1007/s00037-013-0076-6openalex-snapshot
Randomness Buys Depth for Approximate Counting
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-020-00203-wopenalex-snapshot
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels
inferred← citeshttps://doi.org/10.1007/s00145-003-0237-xopenalex-snapshot
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model
inferred← citeshttps://doi.org/10.1007/s00220-022-04442-6openalex-snapshot
Quantum vs. Classical Algorithms for Solving the Heat Equation
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-012-9425-0openalex-snapshot
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error
inferred← citeshttps://doi.org/10.1007/s00453-008-9260-5openalex-snapshot
Hierarchical Sampling from Sketches: Estimating Functions over Data Streams
inferred← citeshttps://doi.org/10.1007/s00453-018-0471-0openalex-snapshot
Deterministic Parallel Algorithms for Bilinear Objective Functions
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.1007/s004930200021openalex-snapshot
Improved Pseudorandom Generators for Combinatorial Rectangles
inferred← citeshttps://doi.org/10.1007/s00521-021-05953-4openalex-snapshot
Multi-chromosomal CGP-evolved RNN for signal reconstruction
inferred← citeshttps://doi.org/10.1007/s10878-010-9339-1openalex-snapshot
Estimating hybrid frequency moments of data streams
inferred← citeshttps://doi.org/10.1007/s11063-020-10379-5openalex-snapshot
Real-Time Lossy Audio Signal Reconstruction Using Novel Sliding Based Multi-instance Linear Regression/Random Forest and Enhanced CGPANN
inferred← citeshttps://doi.org/10.1007/s11128-021-03164-3openalex-snapshot
Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
inferred← citeshttps://doi.org/10.1007/s11390-005-0735-4openalex-snapshot
Progress in Computational Complexity Theory
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90199-jopenalex-snapshot
Universal traversal sequences for expander graphs
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90046-lopenalex-snapshot
Lower bounds on the length of universal traversal sequences
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90047-mopenalex-snapshot
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50011-3openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.dam.2007.11.001openalex-snapshot
Impact of memory size on graph exploration capability
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.04.013openalex-snapshot
How strong is Nisanʼs pseudo-random generator?
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.10.002openalex-snapshot
Tree exploration with little memory
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.014openalex-snapshot
Graph exploration by a finite automaton
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.009openalex-snapshot
Improved hardness amplification in NP
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.013openalex-snapshot
Pseudorandom generators from regular one-way functions: New constructions with improved parameters
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.022openalex-snapshot
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00023-5openalex-snapshot
Universal traversal sequences with backtracking
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80007-8openalex-snapshot
Combinatorial techniques for universal hashing
inferred← citeshttps://doi.org/10.1017/s0963548300001917openalex-snapshot
An Almost m-wise Independent Random Permutation of the Cube
inferred← citeshttps://doi.org/10.1023/a:1014587326991openalex-snapshot
Dimension-Splitting for Simplifying Diffusion in Lattice-Gas Models
inferred← citeshttps://doi.org/10.1080/00029890.1994.11996941openalex-snapshot
Universal Traversal Sequences
inferred← citeshttps://doi.org/10.1090/bull/1676openalex-snapshot
Book Review: Kolmogorov complexity and algorithmic randomness
inferred← citeshttps://doi.org/10.1090/ulect/055openalex-snapshot
A Primer on Pseudorandom Generators
inferred← citeshttps://doi.org/10.1109/ccc.1996.507676openalex-snapshot
Randomization and derandomization in space-bounded computation
inferred← citeshttps://doi.org/10.1109/ccc.1999.766276openalex-snapshot
Deterministic amplification of space-bounded probabilistic algorithms
inferred← citeshttps://doi.org/10.1109/ccc.2001.933868openalex-snapshot
Universal traversal sequences with backtracking
inferred← citeshttps://doi.org/10.1109/ccc.2002.1004352openalex-snapshot
Streaming computation of combinatorial objects
inferred← citeshttps://doi.org/10.1109/ccc.2006.16openalex-snapshot
Derandomization of Probabilistic Auxiliary Pushdown Automata Classes
inferred← citeshttps://doi.org/10.1109/ccc.2007.16openalex-snapshot
On Approximate Majority and Probabilistic Time
inferred← citeshttps://doi.org/10.1109/ccc.2007.19openalex-snapshot
On Derandomizing Probabilistic Sublinear-Time Algorithms
inferred← citeshttps://doi.org/10.1109/ccc.2007.30openalex-snapshot
S-T Connectivity on Digraphs with a Known Stationary Distribution
inferred← citeshttps://doi.org/10.1109/ccc.2009.15openalex-snapshot
A New Characterization of ACC^0 and Probabilistic CC^0
inferred← citeshttps://doi.org/10.1109/ccc.2009.27openalex-snapshot
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
inferred← citeshttps://doi.org/10.1109/ccc.2010.29openalex-snapshot
Fooling Functions of Halfspaces under Product Distributions
inferred← citeshttps://doi.org/10.1109/ccc.2011.20openalex-snapshot
Explicit Dimension Reduction and Its Applications
inferred← citeshttps://doi.org/10.1109/ccc.2011.23openalex-snapshot
Pseudorandomness for Permutation and Regular Branching Programs
inferred← citeshttps://doi.org/10.1109/ccc.2012.37openalex-snapshot
Pseudorandom Generators for Read-Once ACC^0
inferred← citeshttps://doi.org/10.1109/ccc.2014.31openalex-snapshot
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions
inferred← citeshttps://doi.org/10.1109/focs.2008.76openalex-snapshot
Sketching and Streaming Entropy via Approximation Theory
inferred← citeshttps://doi.org/10.1109/focs.2009.68openalex-snapshot
Bounded Independence Fools Halfspaces
inferred← citeshttps://doi.org/10.1109/focs.2009.82openalex-snapshot
The Data Stream Space Complexity of Cascaded Norms
inferred← citeshttps://doi.org/10.1109/focs.2010.11openalex-snapshot
Pseudorandom Generators for Regular Branching Programs
inferred← citeshttps://doi.org/10.1109/focs.2010.74openalex-snapshot
Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate
inferred← citeshttps://doi.org/10.1109/focs.2011.49openalex-snapshot
Balls and Bins: Smaller Hash Families and Faster Evaluation
inferred← citeshttps://doi.org/10.1109/focs.2011.57openalex-snapshot
Pseudorandomness for Read-Once Formulas
inferred← citeshttps://doi.org/10.1109/focs.2012.77openalex-snapshot
Better Pseudorandom Generators from Milder Pseudorandom Restrictions
inferred← citeshttps://doi.org/10.1109/focs.2013.34openalex-snapshot
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1109/focs.2014.29openalex-snapshot
Generating k-Independent Variables in Constant Time
inferred← citeshttps://doi.org/10.1109/focs.2014.66openalex-snapshot
Single Pass Spectral Sparsification in Dynamic Streams
inferred← citeshttps://doi.org/10.1109/focs.2015.59openalex-snapshot
Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial Sums
inferred← citeshttps://doi.org/10.1109/focs.2015.60openalex-snapshot
Pseudorandomness via the Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1109/focs.2017.79openalex-snapshot
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space
inferred← citeshttps://doi.org/10.1109/focs.2018.00015openalex-snapshot
Simple Optimal Hitting Sets for Small-Success RL
inferred← citeshttps://doi.org/10.1109/focs.2018.00058openalex-snapshot
Perfect Lp Sampling in a Data Stream
inferred← citeshttps://doi.org/10.1109/focs.2018.00093openalex-snapshot
Pseudorandom Generators for Read-Once Branching Programs, in Any Order
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00112openalex-snapshot
Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00090openalex-snapshot
Small-space and streaming pattern matching with $k$ edits
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00050openalex-snapshot
Streaming Facility Location in High Dimension via Geometric Hashing
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00052openalex-snapshot
On Weighted Graph Sparsification by Linear Sketching
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.1109/focs57990.2023.00093openalex-snapshot
Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
inferred← citeshttps://doi.org/10.1109/fscs.1990.89550openalex-snapshot
Security preserving amplification of hardness
inferred← citeshttps://doi.org/10.1109/ijcnn.2014.6889727openalex-snapshot
Smart bandwidth management using a recurrent Neuro-Evolutionary technique
inferred← citeshttps://doi.org/10.1109/isit.2018.8437654openalex-snapshot
Inverted Leftover Hash Lemma
inferred← citeshttps://doi.org/10.1109/sct.1994.315805openalex-snapshot
Space lower-bounds for pseudorandom-generators
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892082openalex-snapshot
Stable distributions, pseudorandom generators, embeddings and data stream computation
inferred← citeshttps://doi.org/10.1109/tetc.2026.3676652openalex-snapshot
Privacy-Preserving Outsourced Deep Neural Network Training: New Dual-Cloud Framework and Efficient Construction
inferred← citeshttps://doi.org/10.1109/tevc.2013.2285122openalex-snapshot
Intelligent Bandwidth Estimation for Variable Bit Rate Traffic
inferred← citeshttps://doi.org/10.1109/tkde.2003.1198389openalex-snapshot
One-pass wavelet decompositions of data streams
inferred← citeshttps://doi.org/10.1109/tsipn.2022.3233193openalex-snapshot
SecDT: Privacy-Preserving Outsourced Decision Tree Classification Without Polynomial Forms in Edge-Cloud Computing
inferred← citeshttps://doi.org/10.1111/j.1467-9469.2010.00727.xopenalex-snapshot
A Statistical Analysis of Probabilistic Counting Algorithms
inferred← citeshttps://doi.org/10.1137/050642381openalex-snapshot
An $O(\logn \log\logn)$ Space Algorithm for Undirected st-Connectivity
inferred← citeshttps://doi.org/10.1137/060678890openalex-snapshot
Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions
inferred← citeshttps://doi.org/10.1137/080721820openalex-snapshot
On the Power of the Randomized Iterate
inferred← citeshttps://doi.org/10.1137/1.9781611973075.91openalex-snapshot
Efficiently Decodable Non-adaptive Group Testing
inferred← citeshttps://doi.org/10.1137/1.9781611973075.93openalex-snapshot
On the Exact Space Complexity of Sketching and Streaming Small Norms
inferred← citeshttps://doi.org/10.1137/1.9781611973105.52openalex-snapshot
On the Complexity of Information Spreading in Dynamic Networks
inferred← citeshttps://doi.org/10.1137/1.9781611973402.51openalex-snapshot
Improved Concentration Bounds for Count-Sketch
inferred← citeshttps://doi.org/10.1137/1.9781611973730.30openalex-snapshot
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
inferred← citeshttps://doi.org/10.1137/1.9781611974782.77openalex-snapshot
Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1137/1.9781611975482.154openalex-snapshot
Derandomized Balanced Allocation
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.9781611977073.67openalex-snapshot
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions
inferred← citeshttps://doi.org/10.1137/1.9781611977073.71openalex-snapshot
Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel
inferred← citeshttps://doi.org/10.1137/100783030openalex-snapshot
Bounded Independence Fools Halfspaces
inferred← citeshttps://doi.org/10.1137/100811623openalex-snapshot
Pseudorandom Generators for Polynomial Threshold Functions
inferred← citeshttps://doi.org/10.1137/110854990openalex-snapshot
Pseudorandom Generators for Combinatorial Shapes
inferred← citeshttps://doi.org/10.1137/120875673openalex-snapshot
Pseudorandom Generators for Regular Branching Programs
inferred← citeshttps://doi.org/10.1137/130934490openalex-snapshot
Optimal $\varepsilon$-Biased Sets with Just a Little Randomness
inferred← citeshttps://doi.org/10.1137/140975103openalex-snapshot
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
inferred← citeshttps://doi.org/10.1137/141002281openalex-snapshot
Single Pass Spectral Sparsification in Dynamic Streams
inferred← citeshttps://doi.org/10.1137/16m1062132openalex-snapshot
Pseudorandomness via the Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1137/16m1096773openalex-snapshot
Constant-Round Interactive Proofs for Delegating Computation
inferred← citeshttps://doi.org/10.1137/17m1129088openalex-snapshot
Bounded Independence Plus Noise Fools Products
inferred← citeshttps://doi.org/10.1137/17m1130538openalex-snapshot
Derandomizing Isolation in Space-Bounded Settings
inferred← citeshttps://doi.org/10.1137/17m1145707openalex-snapshot
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
inferred← citeshttps://doi.org/10.1137/17m1158203openalex-snapshot
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
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/18m1229912openalex-snapshot
Perfect $L_p$ Sampling in a Data Stream
inferred← citeshttps://doi.org/10.1137/19m1268707openalex-snapshot
Simple Optimal Hitting Sets for Small-Success RL
inferred← citeshttps://doi.org/10.1137/20m134109xopenalex-snapshot
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space
inferred← citeshttps://doi.org/10.1137/s0097539700389652openalex-snapshot
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
inferred← citeshttps://doi.org/10.1137/s0097539703434620openalex-snapshot
An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
showing the first 200 of 370 · page through all 370
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.