Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first 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
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Noncryptographic Selection Protocols
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Error Reduction for Extractors
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the distribution of the number of roots of polynomials and explicit weak designs
Random Structures & Algorithms
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast leader-election protocols with bounded cheaters' edge
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Extractors from Reed-Muller codes
Journal of Computer and System Sciences - Special issue on FOCS 2001
Uncertainty principles, extractors, and explicit embeddings of l2 into l1
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The unified theory of pseudorandomness: guest column
ACM SIGACT News
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Uniform direct product theorems: simplified, optimized, and derandomized
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomness-Efficient Sampling within NC1
Computational Complexity
Extractors for Three Uneven-Length Sources
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
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Journal of the ACM (JACM)
Typically-correct derandomization
ACM SIGACT News
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
Information security for sensors by overwhelming random sequences and permutations
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
Load balanced scalable Byzantine agreement through quorum building, with full information
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Information and Computation
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
SIAM Journal on Computing
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
A sample of samplers: a computational perspective on sampling
Studies in complexity and cryptography
Almost optimal explicit Johnson-Lindenstrauss families
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Extracting kolmogorov complexity with applications to dimension zero-one laws
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
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
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Design extractors, non-malleable condensers and privacy amplification
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: Innovative approaches for security of small artefacts
Computer Science Review
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
| Hi-index | 0.06 |