Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The complexity of Boolean functions
The complexity of Boolean functions
Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Pseudo-random generators under uniform assumptions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Approximating hyper-rectangles: learning and pseudo-random sets
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On recycling the randomness of states in space bounded computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Universal traversal sequences with backtracking
Journal of Computer and System Sciences - Complexity 2001
On the Derandomization of Space-Bounded Computations
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Tree exploration with little memory
Journal of Algorithms
Using nondeterminism to amplify hardness
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A new family of Cayley expanders (?)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
Combinatorics, Probability and Computing
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Undirected connectivity in log-space
Journal of the ACM (JACM)
Impact of memory size on graph exploration capability
Discrete Applied Mathematics
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Pseudorandom Bit Generators That Fool Modular Sums
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Small-Bias Spaces for Group Products
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Saving private randomness in one-way functions and pseudorandom generators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Pseudorandom generators for polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
An invariance principle for polytopes
Proceedings of the forty-second ACM symposium on Theory of computing
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Pseudorandom generators for combinatorial shapes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Pseudorandom generators for group products: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
How strong is Nisan's pseudo-random generator?
Information Processing Letters
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Derandomized squaring of graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
On the power of the randomized iterate
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
A new pseudorandom generator from collision-resistant hash functions
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
A dichotomy for local small-bias generators
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Finite Fields and Their Applications
On the Power of the Randomized Iterate
SIAM Journal on Computing
An invariance principle for polytopes
Journal of the ACM (JACM)
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |