How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Combinatorica
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
One-way functions and Pseudorandom generators
Combinatorica - Theory of Computing
On the power of two-point based sampling
Journal of Complexity
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Explicit OR-dispersers with polylogarithmic degree
Journal of the ACM (JACM)
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 transformation of interactive proofs that preserve the prover's complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Pseudo-random generators for all hardnesses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hardness amplification within NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
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
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Derandomizing Arthur-Merlin Games under Uniform Assumptions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Some Results on Derandomization
STACS '03 Proceedings of the 20th 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
Almost k-wise independence and hard Boolean functions
Theoretical Computer Science - Latin American theoretical informatics
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
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Using nondeterminism to amplify hardness
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Batch codes and their applications
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Derandomizing homomorphism testing in general groups
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
Theoretical Computer Science
Towards proving strong direct product theorems
Computational Complexity
Hardness amplification within NP
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
On uniform amplification of hardness in NP
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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 non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Compression of samplable sources
Computational Complexity
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Note: Improved hardness amplification in NP
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
A broader view on the limitations of information processing and communication by nature
Natural Computing: an international journal
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Foundations and Trends® in Theoretical Computer Science
Computation of best possible low degree expanders
Discrete Applied Mathematics
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Infeasibility of instance compression and succinct PCPs for NP
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Uniform direct product theorems: simplified, optimized, and derandomized
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
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
Randomness-Efficient Sampling within NC1
Computational Complexity
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
Guest Column: correlation bounds for polynomials over {0 1}
ACM SIGACT News
Proofs of Retrievability via Hardness Amplification
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Security Amplification for Interactive Cryptographic Primitives
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
New direct-product testers and 2-query PCPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
A zero-one law for RP and derandomization of AM if NP is not small
Information and Computation
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
Extractors Using Hardness Amplification
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
General Pseudo-random Generators from Weaker Models of Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Simple extractors via constructions of cryptographic pseudo-random generators
Theoretical Computer Science
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Chernoff-type direct product theorems
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Local list-decoding and testing of random linear codes from high error
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
The complexity of explicit constructions
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Other complexity classes and measures
Algorithms and theory of computation handbook
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
Constructive proofs of concentration 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
On the hardness against constant-depth linear-size circuits
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Randomisation and derandomisation in descriptive complexity theory
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
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
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna
Journal of the ACM (JACM)
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
SIAM Journal on Computing
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
SIAM Journal on Computing
On the Implementation of Huge Random Objects
SIAM Journal on Computing
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Metric structures and probabilistic computation
Theoretical Computer Science
Some recent results on local testing of sparse linear codes
Property testing
Some recent results on local testing of sparse linear codes
Property testing
General hardness amplification of predicates and puzzles
TCC'11 Proceedings of the 8th conference on Theory of cryptography
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
Simplified derandomization of BPP using a hitting set generator
Studies in complexity and cryptography
Studies in complexity and cryptography
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
On the optimal compression of sets in PSPACE
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Pseudorandomness and derandomization
XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
Simple extractors via constructions of cryptographic pseudo-random generators
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A note on zero error algorithms having oracle access to one NP query
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Reconstructive dispersers and hitting set generators
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
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Dimension characterizations of complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Relations between average-case and worst-case complexity
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Randomness-efficient sampling within NC1
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
Hardness amplification via space-efficient direct products
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computational extractors and pseudorandomness
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
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
Massive online teaching to bounded learners
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Can theories be tested?: a cryptographic treatment of forecast testing
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
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
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |