Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Deterministic Extractors for Affine Sources over Large Fields
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Typically-correct derandomization
ACM SIGACT News
A lower bound on list size for list decoding
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
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
| Hi-index | 0.00 |
Since its introduction by Nisan and Zuckerman (STOC93) nearly a decade ago, the notion of a randomness extractor has proven to be a fundamental and powerful one. Extractors and their variants have found widespread application in a variety of areas, including pseudorandomness and derandomization, combinatorics, cryptography, data structures, and computational complexity. Equally striking has been a sequence of discoveries showing that, under different interpretations, extractors are close relatives of a number of other important objects, such as expander graphs, hash functions, error-correcting codes, pseudorandom generators, and sampling algorithms. Through these connections, extractors have unified the study of these objects and have led to new and improved constructions of each.In this tutorial, we give an introduction to the study of extractors. The structure of the tutorial is built around the connections between extractors and the other objects mentionedabove. Within the context of these connections, we hope to convey an understanding of the definition of extractors, some intuition for how they are constructed, and a glimpse of their use in applications.