How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Combinatorica
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
On the power of two-point based sampling
Journal of Complexity
Journal of Computer and System Sciences
Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Journal of Computer and System Sciences
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
A Chernoff Bound for Random Walks on Expander Graphs
SIAM Journal on Computing
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics
List decoding: algorithms and applications
ACM SIGACT News
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Pseudorandomness and Average-Case Complexity via Uniform Reductions
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs
Random Structures & Algorithms
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
IEEE Transactions on Information Theory
Tight Bounds for Hashing Block 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
The complexity of the matroid–greedoid partition problem
Theoretical Computer Science
The complexity of explicit constructions
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Pseudorandom financial derivatives
Proceedings of the 12th ACM conference on Electronic commerce
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We survey the close connections between a variety of "pseudorandom objects," namely pseudorandom generators, expander graphs, list-decodable error-correcting codes, randomness extractors, averaging samplers, and hardness amplifiers.