Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Efficiency considerations in using semi-random sources
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Sorting and selecting in rounds
SIAM Journal on Computing
Combinatorica - Theory of Computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Expanders, randomness, or time versus space
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Designs and their codes
Journal of Computer and System Sciences
Randomized algorithms
Journal of Computer and System Sciences
On extracting randomness from weak random sources (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Explicit OR-dispersers with polylogarithmic degree
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Tiny families of functions with random properties: a quality-size trade-off for hashing
Proceedings of the workshop on Randomized algorithms and computation
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
On recycling the randomness of states in space bounded computation
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
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
Computing with Very Weak Random Sources
SIAM Journal on Computing
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Extracting Randomness: How and Why - A survey
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Tight bounds for depth-two superconcentrators
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Expanders that Beat the Eigenvalue Bound: Explicit Construction andApplications
Expanders that Beat the Eigenvalue Bound: Explicit Construction andApplications
Construction of extractors using pseudo-random generators (extended abstract)
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
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second 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
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Storing information with extractors
Information Processing Letters
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Error-Correcting Codes and Pseudorandom Projections
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
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
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Error Reduction for Extractors
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
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Constant time parallel sorting: an empirical view
Journal of Computer and System Sciences
On the distribution of the number of roots of polynomials and explicit weak designs
Random Structures & Algorithms
Deterministic Extractors for Affine Sources over Large Fields
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
Simple extractors via constructions of cryptographic pseudo-random generators
Theoretical Computer Science
Information-theoretically secret key generation for fading wireless channels
IEEE Transactions on Information Forensics and Security
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
Simple extractors via constructions of cryptographic pseudo-random generators
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
IH'12 Proceedings of the 14th international conference on Information Hiding
Journal of the ACM (JACM)
| Hi-index | 0.06 |