Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Hardness amplification within NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
Boosting and Hard-Core Set Construction
Machine Learning
Derandomizing Arthur-Merlin Games under Uniform Assumptions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Hard Sets and Pseudo-random Generators for Constant Depth Circuits
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Derandomization of Constant Depth Circuits
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Theoretical Computer Science - Australasian computer science
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Near-Optimal Conversion of Hardness into Pseudo-Randomness
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Average-case intractability vs. worst-case intractability
Information and Computation
Hardness amplification within NP
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Can every randomized algorithm be derandomized?
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lower bounds for adaptive locally decodable codes
Random Structures & Algorithms
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Low-end uniform hardness vs. randomness tradeoffs for AM
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Foundations and Trends® in Theoretical Computer Science
The unified theory of pseudorandomness: guest column
ACM SIGACT News
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Limitations of Hardness vs. Randomness under Uniform Reductions
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Worst-Case to Average-Case Reductions Revisited
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Efficient learning algorithms yield circuit lower bounds
Journal of Computer and System Sciences
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
General Pseudo-random Generators from Weaker Models of Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Guest column: from randomness extraction to rotating needles
ACM SIGACT News
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Nearly bounded error probabilistic sets
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Chernoff-type direct product theorems
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Typically-correct derandomization
ACM SIGACT News
Avoiding simplicity is complex
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Relativized worlds without worst-case to average-case reductions for NP
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On the hardness against constant-depth linear-size circuits
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Hardness amplification within NP against deterministic algorithms
Journal of Computer and System Sciences
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
ACM Transactions on Computation Theory (TOCT)
Local Monotonicity Reconstruction
SIAM Journal on Computing
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Local property reconstruction and monotonicity
Property testing
Local property reconstruction and monotonicity
Property testing
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing
Limits on the computational power of random strings
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Another proof that BPP ⊆ PH (and more)
Studies in complexity and cryptography
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Pseudorandomness and derandomization
XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
Efficient learning algorithms yield circuit lower bounds
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A theory of goal-oriented communication
Journal of the ACM (JACM)
Worst-case vs. algorithmic average-case complexity in the polynomial-time hierarchy
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Arthur-Merlin games and the problem of isomorphism testing
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Hardness amplification via space-efficient direct products
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Relativized Worlds without Worst-Case to Average-Case Reductions for NP
ACM Transactions on Computation Theory (TOCT)
Impossibility results on weakly black-box hardness amplification
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On the complexity of hard-core set constructions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Limits on the computational power of random strings
Information and Computation
Natural proofs versus derandomization
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |