@InProceedings{ShaltielUm01,
author = {Ronen Shaltiel and Christopher Umans},
title = {Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator},
OPTbooktitle = {},
crossref = {FOCS42},
OPTkey = {},
pages = {648--657},
OPTyear = {},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
note = {},
OPTannote = {}
}

@InProceedings{TaShmaZuSa01,
author = {Amnon {Ta-S}hma and David Zuckerman and Shmuel Safra},
title = {Extractors from {Reed--Muller} Codes},
OPTbooktitle = {},
crossref = {FOCS42},
OPTkey = {},
pages = {638--647},
OPTyear = {},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
note = {},
OPTannote = {}
}


@Proceedings{FOCS42,
title={42nd Annual Symposium on Foundations of Computer Science},
booktitle={42nd Annual Symposium on Foundations of Computer
Science},
month={14--17 } # oct,
year=2001,
c-address={Las Vegas, Nevada},
organization={IEEE},
crossrefonly=1,
OPTpubinfo={},
OPTsource={}
}


@techreport{BeamePi98,
AUTHOR = "P. Beame and T. Pitassi",
TITLE = "Propositional Proof Complexity: Past, Present and
Future",
INSTITUTION = "Electronic Colloquium on Computational Complexity",
YEAR = "1998",
NUMBER = "TR98-067"
}

@article {LubyMiShSp01,
AUTHOR = {Luby, Michael G. and Mitzenmacher, Michael and Shokrollahi, M.
Amin and Spielman, Daniel A.},
TITLE = {Improved low-density parity-check codes using irregular
graphs},
JOURNAL = {IEEE Trans. Inform. Theory},
FJOURNAL = {Institute of Electrical and Electronics Engineers.
Transactions on Information Theory},
VOLUME = {47},
YEAR = {2001},
NUMBER = {2},
PAGES = {585--598},
ISSN = {0018-9448},
CODEN = {IETTAW},
MRCLASS = {94Bxx},
MRNUMBER = {1 820 478},
}

@article{ChvatalSz88,
AUTHOR = "Chv{\'a}tal, V. and Szemer{\'e}di, E.",
TITLE = "Many hard examples for resolution",
JOURNAL = "Journal of the ACM",
YEAR = "1988",
VOLUME = "35",
PAGES = "759-768",
NUMBER = "4"}

@InCollection{Tseitin68,
author = {G. C. Tseitin},
title = {On the complexity of
derivations in propositional calculus},
booktitle = {Studies in constructive
mathematics and mathematical logic, Part II},
OPTcrossref = {},
OPTkey = {},
OPTpages = {115-125},
publisher = {Consultants Bureau, New-York-London},
year = {1968},
OPTeditor = {A. O. Slissenko},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTchapter = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}


@InProceedings{TaShmaUmZu01,
AUTHOR = {A. {Ta-S}hma and C. Umans and D. Zuckerman},
TITLE={Loss-less Condensers, Unbalanced Expanders, and Extractors},
BOOKTITLE={Proc. of the 33rd Annual ACM Symposium on the Theory of Computing},
PAGES={143--152},
YEAR={2001}
}

@Unpublished{Alon95,
AUTHOR={N. Alon},
TITLE={Private communication},
YEAR=1995
}

@Unpublished{TaShma01,
AUTHOR={A. Ta-Shma},
NOTE={Private communication},
YEAR=2001
}

@Unpublished{Capalbo01,
AUTHOR={M. Capalbo},
TITLE={Explicit Constant-Degree Unique-Neighbor Expanders},
YEAR=2001,
NOTE={Submitted}
}

@InProceedings{ReingoldVaWi00,
AUTHOR ={O. Reingold and S. Vadhan and A. Wigderson},
TITLE ={Entropy Waves, The Zig-Zag Graph Product, and New Constant-Degree
Expanders and Extractors},
BOOKTITLE={Proceedings of 41st Annual Symposium on Foundations of
Computer Science},
PAGES={3-13},
YEAR={ 2000},
}


@article {AroraLeMa96,
AUTHOR = {Arora, Sanjeev and Leighton, F. T. and Maggs, Bruce M.},
TITLE = {On-line algorithms for path selection in a nonblocking
network},
JOURNAL = {SIAM J. Comput.},
FJOURNAL = {SIAM Journal on Computing},
VOLUME = {25},
YEAR = {1996},
NUMBER = {3},
PAGES = {600--625},
ISSN = {0097-5397},
CODEN = {SMJCAT},
MRCLASS = {68M10 (68Q22)},
MRNUMBER = {97b:68014},
MRREVIEWER = {Neville G. F. Sancho},
}


@article {PelegUp89,
AUTHOR = {Peleg, D. and Upfal, E.},
TITLE = {Constructing disjoint paths on expander graphs},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal on Combinatorics and
the Theory of Computing},
VOLUME = {9},
YEAR = {1989},
NUMBER = {3},
PAGES = {289--313},
ISSN = {0209-9683},
CODEN = {COMBDI},
MRCLASS = {05C85 (05C38 68M10)},
MRNUMBER = {91h:05115},
MRREVIEWER = {Max Garzon},
}

@article {BroderFrUp99,
AUTHOR = {Broder, Andrei Z. and Frieze, Alan M. and Upfal, Eli},
TITLE = {Static and dynamic path selection on expander graphs: a random
walk approach},
JOURNAL = {Random Structures Algorithms},
FJOURNAL = {Random Structures \& Algorithms},
VOLUME = {14},
YEAR = {1999},
NUMBER = {1},
PAGES = {87--109},
ISSN = {1042-9832},
MRCLASS = {05C80 (60J15)},
MRNUMBER = {99m:05144},
MRREVIEWER = {Tatiana Smirnova-Nagnibeda},
}

@article{SipserSp96,
AUTHOR = {Sipser, Michael and Spielman, Daniel A.},
TITLE = {Expander codes},
NOTE = {},
JOURNAL = {IEEE Trans. Inform. Theory},
FJOURNAL = {Institute of Electrical and Electronics Engineers. Transactions
on Information Theory},
VOLUME = {42},
YEAR = {1996},
NUMBER = {6, part 1},
PAGES = {1710--1722},
ISSN = {0018-9448},
CODEN = {IETTAW},
MRCLASS = {94B05},
MRNUMBER = {98d:94031},
}

@article {UpfalWi88,
AUTHOR = {Upfal, Eli and Wigderson, Avi},
TITLE = {How to share memory in a distributed system},
JOURNAL = {Journal of the ACM},
FJOURNAL = {Journal of the Association for Computing Machinery},
VOLUME = {34},
YEAR = {1987},
NUMBER = {1},
PAGES = {116--127},
ISSN = {0004-5411},
CODEN = {JACOAH},
MRCLASS = {68M10 (68N25 68Q05)},
MRNUMBER = {88c:68009},
}

@inProceedings{BuhrmanMiRaSr00,
AUTHOR = {Harry Buhrman and Peter Bro Miltersen and
Jaikumar Radhakrishnan and Venkatesh Srinivasan},
TITLE = {Are bitvectors optimal?},
booktitle = {Proceedings of the Thirty-Second Annual ACM Symposium on
the Theory of Computing},
year = {2000},
PAGES = {},
c-organization = {ACM},
}


@InProceedings{AlekhnovichBeRaWi00,
title={Pseudorandom Generators in Propositional Proof Complexity},
author={M. Alekhnovich and E. {Ben-S}asson and A. Razborov and A. Wigderson},
pages={43--53},
year ={2000},
booktitle={41st Annual Symposium on Foundations of Computer Science},
organization={IEEE},
}


@Article{Ben-SassonWi01,
author = {{Ben-S}asson, Eli and Wigderson, Avi},
title = {Short proofs are narrow---resolution made simple},
journal = {Journal of the ACM},
year = {2001},
OPTkey = {},
volume = {48},
number = {2},
pages = {149--169},
month = {March},
OPTnote = {},
OPTannote = {}
}

@InProceedings{AlekhnovichRa01,
title={Lower Bounds for Polynomial Calculus: Non-Binomial Case },
author={M. Alekhnovich and A. Razborov },
pages={190--199},
year ={2001},
booktitle={42nd Annual Symposium on Foundations of Computer Science},
organization={IEEE},
}

@misc{Renyi70,
author = "A. Renyi",
title = "Probability Theory",
text = "A. Renyi. Probability Theory. North-Holland, Amsterdam, 1970.",
year = "1970" }

@InProceedings{ImpagliazzoShWi00,
author = {Russell Impagliazzo and Ronen Shaltiel and Avi Wigderson},
title = {Extractors and Pseudo-Random Generators with Optimal Seed Length},
booktitle = {Proceedings of the Thirty-Second Annual ACM Symposium on
the Theory of Computing},
OPTcrossref = {},
OPTkey = {},
pages = {1--10},
year = {2000},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Portland, Oregon},
month = {May},
c-organization = {ACM},
OPTpublisher = {},
note = {See also ECCC TR00-009},
OPTannote = {}
}



@Article{Trevisan01,
author = {Luca Trevisan},
title = {Extractors and Pseudorandom Generators},
journal = {Journal of the ACM},
year = {2001},
OPTkey = {},
volume = {48},
number = {4},
pages = {860--879},
month = {July},
OPTnote = {},
OPTannote = {}
}


@InProceedings{RazReVa99a,
author = {Ran Raz and Omer Reingold and Salil Vadhan},
title = {Extracting all the Randomness and Reducing the Error in
{T}revisan's Extractors},
booktitle = {Proceedings of the Thirty-First Annual ACM Symposium on
the Theory of Computing},
OPTcrossref = {},
OPTkey = {},
pages = {149--158},
year = {1999},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Atlanta, GA},
OPTmonth = {},
OPTorganization = {},
c-organization = {ACM} ,
OPTpublisher = {},
note = {See preprint of journal version,
revised July 2001 for {\em J. Computer and System Sci.}},
OPTannote = {}
}

@InProceedings{RazRe99,
author = {Ran Raz and Omer Reingold},
title = {On Recycling the Randomness of the States in Space Bounded
Computation},
booktitle = {Proceedings of the Thirty-First Annual ACM Symposium on
the Theory of Computing},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {1999},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Atlanta, GA},
month = {May},
c-organization = {ACM} ,
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}

@Misc{Trevisan98,
OPTkey = {},
author = {Luca Trevisan},
title = {Constructions of Near-Optimal Extractors Using
Pseudo-Random Generators},
howpublished = {{\em Electronic Colloquium on Computational Complexity}
Technical Report TR98-55},
year = {1998},
month = {September},
note = {Extended abstract in these proceedings},
OPTannote = {}
}

@Article{NisanWi94,
title={Hardness vs Randomness},
author={Noam Nisan and Avi Wigderson},
pages={149--167},
journal=jcss,
year=1994,
month=oct,
volume=49,
number=2,
source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib}
}

@article {WigdersonZu99,
AUTHOR = {Wigderson, Avi and Zuckerman, David},
TITLE = {Expanders that beat the eigenvalue bound: explicit construction
and applications},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal on Combinatorics and
the Theory of Computing},
VOLUME = {19},
YEAR = {1999},
NUMBER = {1},
PAGES = {125--138},
ISSN = {0209-9683},
MRCLASS = {15-XX},
MRNUMBER = {1 722 214},
}

@Article{GoldwasserMi84,
title={Probabilistic Encryption},
author={Shafi Goldwasser and Silvio Micali},
pages={270--299},
journal=jcss,
year=1984,
month=apr,
volume=28,
number=2,
preliminary={STOC::GoldwasserM1982},
source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib}
}

@InProceedings{Yao82,
title={Theory and Applications of Trapdoor Functions (Extended
Abstract)},
author={Yao, Andrew C.},
pages={80--91},
crossref={FOCS23},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Proceedings{FOCS23,
title={23rd Annual Symposium on Foundations of Computer Science},
booktitle={23rd Annual Symposium on Foundations of Computer Science},
month={3--5 } # nov,
year=1982,
address={Chicago, Illinois},
organization={IEEE},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Article{Zuckerman97,
author = {David Zuckerman},
title = {Randomness-Optimal Oblivious Sampling},
journal = {Random Structures \& Algorithms},
year = {1997},
OPTkey = {},
volume = {11},
number = {4},
pages = {345--367},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@Article{GoldreichWi97,
author = {Oded Goldreich and Avi Wigderson},
title = {Tiny Families of Functions with Random Properties: A
Quality-Size Trade-off for Hashing},
journal = {Random Structures \& Algorithms},
year = {1997},
OPTkey = {},
volume = {11},
number = {4},
pages = {315--343},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@InProceedings{TaShma96,
title={On Extracting Randomness From Weak Random Sources (Extended
Abstract)},
author={Amnon {Ta-S}hma},
pages={276--285},
crossref={STOC28},
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@Proceedings{STOC28,
title={Proceedings of the Twenty-Eighth Annual ACM Symposium on
the Theory of Computing},
booktitle={Proceedings of the Twenty-Eighth Annual ACM Symposium on
the Theory of Computing},
month={22--24 } # may,
year=1996,
address={Philadelphia, Pennsylvania},
c-organization={ACM},
key={ACM},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@InProceedings{TaShma98,
author = {Amnon {Ta-S}hma},
title = {Almost Optimal Dispersers},
booktitle = "Proceedings of the 30th Annual ACM Symposium on
Theory of Computing",
year = "1998",
organization = "ACM",
address = "Dallas, TX",
month = "May",
note = {},
pages = "196--202"
}

@Article{Sipser88,
title={Expanders, Randomness, or Time versus Space},
author={Michael Sipser},
pages={379--383},
journal=jcss,
year=1988,
month=jun,
volume=36,
number=3,
source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib}
}

@Article{NisanZu96,
title={Randomness is Linear in Space},
author={Noam Nisan and David Zuckerman},
pages={43--52},
journal=jcss,
year=1996,
month=feb,
volume=52,
number=1,
preliminary={STOC::NisanZ1993},
source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib}
}

@string{algor={Algorithmica}}

@Article{Zuckerman96,
title={Simulating {BPP} Using a General Weak Random Source},
author={David Zuckerman},
pages={367--391},
journal=algor,
year=1996,
month=oct # "/" # nov,
volume=16,
number={4/5},
source={http://theory.lcs.mit.edu/~dmjones/hbp/bibs/misc/algor.bib}
}

@Misc{GoldreichZu97,
OPTkey = {},
author = {Oded Goldreich and David Zuckerman},
title = {Another proof that $\mbox{BPP}\subseteq\mbox{PH}$ (and
more)},
howpublished = {{\em Electronic Colloquium on Computational Complexity}
Technical Report TR97-045},
month = {September},
year = {1997},
note = {\verb|http://www.eccc.uni-trier.de/eccc|},
OPTannote = {}
}

@string{lncs={Lecture Notes in Computer Science}}

@InProceedings{AndreevClRo97,
title={Worst-Case Hardness Suffices for Derandomization: A New Method
for Hardness-Randomness Trade-Offs},
author={Alexander E. Andreev and Andrea E. F. Clementi and Jos{\'e} D.
P. Rolim},
crossref={icalp97},
pages={177--187},
source={http://theory.lcs.mit.edu/~dmjones/hbp/bibs/ley/icalp/icalp.bib}
}

@Proceedings{ICALP97,
editor={Pierpaolo Degano and Robert Gorrieri and Alberto
Marchetti-Spaccamela},
title={Automata, Languages and Programming, 24th International
Colloquium},
booktitle={Automata, Languages and Programming, 24th International
Colloquium},
address={Bologna, Italy},
month={7--11~} # jul,
year=1997,
series=lncs,
volume=1256,
publisher={Springer-Verlag},
comment={ISBN 3-540-63165-8},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/hbp/bibs/ley/icalp/icalp.bib}
}

@Article{SanthaVa86,
title={Generating Quasi-random Sequences from Semi-random Sources},
author={Miklos Santha and Umesh V. Vazirani},
pages={75--87},
journal=jcss,
year=1986,
month=aug,
volume=33,
number=1,
preliminary={FOCS::SanthaV1984},
source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib}
}

@InProceedings{Vazirani87b,
title={Efficiency Considerations in Using Semi-random Sources
(Extended Abstract)},
author={Vazirani, Umesh V.},
pages={160--168},
crossref={STOC19},
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@Proceedings{STOC19,
title={Proceedings of the Nineteenth Annual ACM Symposium on Theory of
Computing},
booktitle={Proceedings of the Nineteenth Annual ACM Symposium on
Theory of Computing},
month={25--27 } # may,
year=1987,
address={New York City},
c-organization={ACM},
key={ACM},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@InProceedings{VaziraniVa85,
title={Random Polynomial Time Is Equal to Slightly-random Polynomial
Time},
author={Vazirani, Umesh V. and Vazirani, Vijay V.},
pages={417--428},
crossref={FOCS26},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Proceedings{FOCS26,
title={26th Annual Symposium on Foundations of Computer Science},
booktitle={26th Annual Symposium on Foundations of Computer
Science},
month={21--23 } # oct,
year=1985,
address={Portland, Oregon},
organization={IEEE},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Article{Vazirani87a,
author = {Umesh V. Vazirani},
title = {Strong communication complexity or generating quasirandom
sequences from two communicating semirandom sources},
journal = {Combinatorica},
year = {1987},
OPTkey = {},
volume = {7},
number = {4},
pages = {375--392},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@Article{ChorGo88,
title={Unbiased Bits from Sources of Weak Randomness and Probabilistic
Communication Complexity},
author={Benny Chor and Oded Goldreich},
pages={230--261},
journal=sicomp,
year=1988,
month=apr,
volume=17,
number=2,
source={http://theory.lcs.mit.edu/~dmjones/hbp/sicomp/sicomp.bib}
}
@article {SrinivasanZu99,
AUTHOR = {Srinivasan, Aravind and Zuckerman, David},
TITLE = {Computing with very weak random sources},
JOURNAL = {SIAM J. Comput.},
FJOURNAL = {SIAM Journal on Computing},
VOLUME = {28},
YEAR = {1999},
NUMBER = {4},
PAGES = {1433--1459 (electronic)},
ISSN = {1095-7111},
MRCLASS = {68W20 (65C10 68Q15 94A17)},
MRNUMBER = {2001d:68234},
}

@InProceedings{RadhakrishnanTa97,
title={Tight bounds for depth-two superconcentrators},
author={Jaikumar Radhakrishnan and Amnon {Ta-S}hma},
pages={585--594},
crossref={FOCS38},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Proceedings{FOCS38,
title={38th Annual Symposium on Foundations of Computer Science},
booktitle={38th Annual Symposium on Foundations of Computer
Science},
month={20--22 } # oct,
year=1997,
address={Miami Beach, Florida},
organization={IEEE},
crossrefonly=1,
pubinfo={IEEE Computer Society Press Order Number PR08197; IEEE Order
Plan Catalog Number 97CH36130; ISBN 0-8186-8197-7; ISBN 0-8186-8198-5
(case); ISBN 0-8186-8199-3 (microfiche); ISSN 0272-5428},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

string{jacm={Journal of the ACM}}

@Article{SaksSrZh98,
title={Explicit {OR}-Dispersers with Polylogarithmic Degree},
author={Michael Saks and Aravind Srinivasan and Shiyu Zhou},
area={Formal Languages and Complexity Theory},
journal=jacm,
pages={123--154},
month=jan,
year=1998,
volume=45,
number=1,
keywords={Derandomization, expander graphs, explicit constructions,
hashing lemmas, hardness of approximation, imperfect sources of
randomness, measures of information, pseudo-random generators,
randomized computation, time-space tradeoffs},
general-terms={Algorithms, Theory},
cr-categories={F.1.3[relations among randomized complexity classes];
G.2.1[combinatorial algorithms]; G.3[probabilistic algorithms]},
preliminary={stoc::SaksSZ1995},
source={http://theory.lcs.mit.edu/~jacm/jacm.bib}
}

@PhdThesis{Vazirani86,
author = {Umesh V. Vazirani},
title = {Randomness, Adversaries, and Computation},
school = {University of California, Berkeley},
year = {1984},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@InProceedings{ImpagliazzoLeLu89,
title={Pseudo-random Generation from one-way functions (Extended
Abstracts)},
author={Impagliazzo, Russell and Levin, Leonid A. and Luby, Michael},
pages={12--24},
crossref={STOC21},
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@Proceedings{STOC21,
title={Proceedings of the Twenty First Annual ACM Symposium on Theory
of Computing},
booktitle={Proceedings of the Twenty First Annual ACM Symposium on
Theory of Computing},
month={15--17 } # may,
year=1989,
address={Seattle, Washington},
c-organization={ACM},
key={ACM},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@InProceedings{Nisan96,
title={Extracting Randomness: How and Why: A Survey},
author={Noam Nisan},
pages={44--58},
crossref={SCTC96},
source={http://theory.lcs.mit.edu/~dmjones/hbp/sctc/concur.bib}
}

@Proceedings{SCTC96,
title={Proceedings, Eleventh Annual IEEE Conference on Computational
Complexity},
booktitle={Proceedings, Eleventh Annual IEEE Conference on
Computational Complexity},
address={Philadelphia, Pennsylvania},
month={24--27~} # may,
year=1996,
publisher={IEEE Computer Society Press},
crossrefonly=1,
comment={checked},
source={http://theory.lcs.mit.edu/~dmjones/hbp/sctc/concur.bib}
}

@Article{NisanTa99,
author = {Noam Nisan and Amnon {Ta-Shma}},
title = {Extracting Randomness: A Survey and New Constructions},
journal = {Journal of Computer and System Sciences},
year = {1999},
OPTkey = {},
volume = {58},
number = {1},
pages = {148--173},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@InCollection{AjtaiKoStSz89,
author = {Mikl{\'o}s Ajtai and J{\'a}nos Koml{\'o}s and William Steiger and
Endre Szemer{\'e}di},
title = {Almost Sorting in One Round},
booktitle = {Randomness and Computation},
OPTcrossref = {},
OPTkey = {},
pages = {117--125},
publisher = {JAI Press Inc.},
year = {1989},
editor = {Silvio Micali},
volume = {5},
OPTnumber = {},
series = {Advances in Computing Research},
OPTtype = {},
OPTchapter = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@Article{Pippenger87,
title={Sorting and Selecting in Rounds},
author={Nicholas Pippenger},
pages={1032--1038},
journal=sicomp,
year=1987,
month=dec,
volume=16,
number=6,
source={http://theory.lcs.mit.edu/~dmjones/hbp/sicomp/sicomp.bib}
}

@Book{AlonSpEr92,
author = {Noga Alon and Joel H. Spencer and Paul Erd{\H{o}}s},
ALTeditor = {},
title = {The Probabilistic Method},
publisher = {John Wiley and Sons, Inc.},
year = {1992},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
series = {Wiley-Interscience Series in Discrete Mathematics and
Optimization},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@Book{Goldreich95,
author = {Oded Goldreich},
ALTeditor = {},
title = {Foundations of Cryptography (Fragments of a Book)},
publisher = {Weizmann Institute of Science},
year = {1995},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
note = {Available, along with revised version 1/98, from
\verb|http://theory.lcs.mit.edu/~oded|},
OPTannote = {}
}

@Booklet{Goldreich98,
title = {{\em Modern Cryptography, Probabilistic Proofs and
Pseudorandomness}},
OPTkey = {},
author = {Oded Goldreich},
OPThowpublished = {},
OPTaddress = {},
month = {June},
year = {1998},
note = {To be published by {\em Springer}},
OPTannote = {}
}

@Book{MotwaniRa95,
author = {Rajeev Motwani and Prabhakar Raghavan},
ALTeditor = {},
title = {Randomized Algorithms},
publisher = {Cambridge University Press},
year = {1995},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@Book{AssmusKe92,
author = "E.F. Assmus and J.D. Key",
title = "Designs and their codes",
publisher = "Cambridge University Press",
year = "1992",
OPTcrossref = "",
OPTkey = "",
OPTeditor = "",
OPTvolume = "",
number = "103",
series = "Cambridge Tracts in Mathematics",
OPTaddress = "",
OPTedition = "",
OPTmonth = "",
OPTnote = "",
OPTannote = ""
}

@Misc{TaShma98b,
OPTcrossref = "",
OPTkey = "",
author = "Amnon {Ta-S}hma",
OPTtitle = "",
howpublished = "Personal communication",
year = "1998",
month = "August",
OPTnote = "",
OPTannote = ""
}

@TechReport{SudanTrVa98,
author = {Madhu Sudan and Luca Trevisan and Salil Vadhan},
title = {Pseudorandom Generators without the {XOR} Lemma},
institution = {Electronic Colloquium on Computational Complexity},
year = {1998},
OPTkey = {},
OPTtype = {},
number = {TR98-074},
OPTaddress = {},
month = {December},
note = {Extended abstract in these proceedings.},
OPTannote = {}
}

@Book{MacWilliamsSl77,
author = {Florence J. MacWilliams and Neil J. A. Sloane},
title = {The Theory of Error-Correcting Codes},
publisher = {North-Holland},
year = {1977},
OPTkey = {},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@Article{BellareGoSu98,
title={Free Bits, {PCPs}, and Nonapproximability---Towards Tight
Results},
author={Mihir Bellare and Oded Goldreich and Madhu Sudan},
pages={804--915},
journal=sicomp,
month=jun,
year=1998,
volume=27,
number=3,
siam-key={30253},
preliminary={focs::BellareGS1995, eccc::BellareGS1995},
source={http://theory.lcs.mit.edu/~dmjones/hbp/sicomp/sicomp.bib}
}

@Book{CoverTh91,
author = "Thomas M. Cover and Joy A. Thomas",
title = "Elements of Information Theory",
publisher = "John Wiley \& Sons, Inc.",
year = "1991",
OPTcrossref = "",
OPTkey = "",
OPTeditor = "",
OPTvolume = "",
OPTnumber = "",
series = "Wiley Series in Telecommunications",
OPTaddress = "",
edition = "2nd",
OPTmonth = "",
OPTnote = "",
OPTannote = ""
}

@Unpublished{ImpagliazzoWi96,
author = {Russell Impagliazzo and Avi Wigderson},
title = {An Information Theoretic Variant of the Inclusion-Exclusion
Bound (Preliminary Version)},
note = {Unpublished manuscript},
OPTkey = {},
month = {September},
year = {1996},
OPTannote = {}
}

@InProceedings{ImpagliazzoWi97,
title={{$\mathit{P} = \mathit{BPP}$} if {$E$} Requires Exponential
Circuits: Derandomizing the {XOR} Lemma},
author={Russell Impagliazzo and Avi Wigderson},
pages={220--229},
crossref={STOC29},
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@Proceedings{STOC29,
title={Proceedings of the Twenty-Ninth Annual ACM Symposium on
Theory of Computing},
booktitle={Proceedings of the Twenty-Ninth Annual ACM Symposium on
Theory of Computing},
month={4--6 } # may,
year=1997,
address={El Paso, Texas},
c-organization={ACM},
key={ACM},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@Misc{RazReVa99b,
OPTkey = {},
author = {Ran Raz and Omer Reingold and Salil Vadhan},
title = {Error Reduction in Extractors},
OPThowpublished = {},
OPTmonth = {},
year = {1999},
note = {In preparation},
OPTannote = {}
}

@InProceedings{FriedmanKS89,
title={On the Second Eigenvalue in Random Regular Graphs},
author={Friedman, Joel and Kahn, Jeff and Szemer{\'e}di, Endre},
pages={587--598},
crossref={STOC21},
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@Proceedings{STOC21,
title={Proceedings of the Twenty First Annual ACM Symposium on Theory
of Computing},
booktitle={Proceedings of the Twenty First Annual ACM Symposium on
Theory of Computing},
month={15--17 } # may,
year=1989,
address={Seattle, Washington},
c-organization={ACM},
key={ACM},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@InProceedings{BroderS87,
title={On the Second Eigenvalue of Random Regular Graphs (Preliminary
Version)},
author={Broder, Andrei and Shamir, Eli},
pages={286--294},
crossref={FOCS28},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Proceedings{FOCS28,
title={28th Annual Symposium on Foundations of Computer Science},
booktitle={28th Annual Symposium on Foundations of Computer
Science},
month={12--14 } # oct,
year=1987,
address={Los Angeles, California},
organization={IEEE},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@string{jacm={Journal of the ACM}}

@Article{Kahale95,
title={Eigenvalues and Expansion of Regular Graphs},
author={Nabil Kahale},
pages={1091--1106},
area={Graph Theory and Combinatorial Structures},
journal=jacm,
month=sep,
year=1995,
volume=42,
number=5,
general-terms={Algorithms, Theory},
keywords={Eigenvalues, expander graphs, induced subgraphs, load
balancing, Ramanujan graphs, random walks, selection networks},
cr-categories={F.2.2; G.2.2},
preliminary={FOCS::Kahale1991, FOCS::Kahale1992},
source={http://theory.lcs.mit.edu/~jacm/jacm.bib}
}

@Article{AjtaiKoSz83,
AUTHOR = {Mikl{\'o}s Ajtai and J{\'a}nos Koml{\'o}s and Endre Szemer{\'e}di},
TITLE = {Sorting in $c\,{\rm log}\,n$ parallel steps},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal of the J{\'a}nos Bolyai
Mathematical Society},
VOLUME = {3},
YEAR = {1983},
NUMBER = {1},
PAGES = {1--19},
ISSN = {0209-9683},
CODEN = {COMBDI},
MRCLASS = {68P10},
MRNUMBER = {85d:68017},
MRREVR = {Ernst-Erich Doberkat},
}

@article{Urquhart87,
AUTHOR = {Urquhart, Alasdair},
TITLE = {Hard examples for resolution},
JOURNAL = {Journal of the ACM},
FJOURNAL = {Journal of the Association for Computing Machinery},
VOLUME = {34},
YEAR = {1987},
NUMBER = {1},
PAGES = {209--219},
ISSN = {0004-5411},
CODEN = {JACOAH},
MRCLASS = {68Q25 (03B05 03B35 03D15 68R10 68T15)},
MRNUMBER = {89e:68056},
MRREVR = {Alexander Leitsch},
}


@InCollection{Valiant77,
author = {Valiant, Leslie G.},
title = {Graph-theoretic arguments in low-level complexity},
booktitle = {Mathematical foundations of computer science (Proc. Sixth
Sympos., Tatransk{\'a} Lomnica, 1977)},
OPTcrossref = {},
OPTkey = {},
pages = {162--176. Lecture Notes in Comput. Sci., Vol. 53},
publisher = {Springer},
year = {1977},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTchapter = {},
address = {Berlin},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@InProceedings{ImpagliazzoNiWi94,
title={Pseudorandomness for Network Algorithms},
author={Russell Impagliazzo and Noam Nisan and Avi Wigderson},
pages={356--364},
crossref={STOC26},
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@Proceedings{STOC26,
title={Proceedings of the Twenty-Sixth Annual ACM Symposium on the
Theory of Computing},
booktitle={Proceedings of the Twenty-Sixth Annual ACM Symposium on
the Theory of Computing},
month={23--25 } # may,
year=1994,
address={Montr{\'e}al, Qu{\'e}bec, Canada},
c-organization={ACM},
key={ACM},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@InProceedings{GoldreichImLeVeZu90,
title={Security Preserving Amplification of Hardness},
author={Goldreich, Oded and Impagliazzo, Russell and Levin, Leonid and
Venkatesan, Ramarathnam and Zuckerman, David},
pages={318--326},
crossref={FOCS31a},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Proceedings{FOCS31a,
title={31st Annual Symposium on Foundations of Computer Science},
booktitle={31st Annual Symposium on Foundations of Computer
Science},
volume={I},
month={22--24 } # oct,
year=1990,
address={St. Louis, Missouri},
organization={IEEE},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Article{NaorNa93,
title={Small-Bias Probability Spaces: Efficient Constructions and
Applications},
author={Joseph Naor and Moni Naor},
pages={838--856},
journal=sicomp,
year=1993,
month=aug,
volume=22,
number=4,
source={http://theory.lcs.mit.edu/~dmjones/hbp/sicomp/sicomp.bib}
}

}

@InProceedings{KarpPiSi85,
author = {Richard Karp and Nicholas Pippenger and Michael Sipser},
title = {A time-randomness tradeoff},
booktitle = {{AMS} Conference on Probabilistic Computational Complexity},

OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {1985},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Durham, New Hampshire},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}

@article {Spielman96,
AUTHOR = {Spielman, Daniel A.},
TITLE = {Linear-time encodable and decodable error-correcting codes},
NOTE = {},
JOURNAL = {IEEE Trans. Inform. Theory},
FJOURNAL = {Institute of Electrical and Electronics Engineers. Transactions
on Information Theory},
VOLUME = {42},
YEAR = {1996},
NUMBER = {6, part 1},
PAGES = {1723--1731},
ISSN = {0018-9448},
CODEN = {IETTAW},
MRCLASS = {94B05 (68Q25)},
MRNUMBER = {98g:94034},
}

@InProceedings{Pinsker73,
author = {M. Pinsker},
title = {On the Complexity of a Concentrator},
booktitle = {7th Annual Teletraffic Conference},
OPTcrossref = {},
OPTkey = {},
pages = {318/1--318/4},
year = {1973},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Stockholm},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}

@article {Alon86,
AUTHOR = {Noga Alon},
TITLE = {Eigenvalues and expanders},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal of the J{\'a}nos Bolyai
Mathematical Society},
VOLUME = {6},
YEAR = {1986},
NUMBER = {2},
PAGES = {83--96},
ISSN = {0209-9683},
CODEN = {COMBDI},
MRCLASS = {05C50},
MRNUMBER = {88e:05077},
MRREVR = {Claude Benzaken},
}

@article{Margulis73,
AUTHOR = {Margulis, G. A.},
TITLE = {Explicit constructions of expanders},
JOURNAL = {Problemy Pereda{\v c}i Informacii},
VOLUME = {9},
YEAR = {1973},
NUMBER = {4},
PAGES = {71--80},
MRCLASS = {94A15 (22E45)},
MRNUMBER = {58 #4643},
MRREVR = {J. S. Joel},
}

@article {Margulis88,
AUTHOR = {Margulis, G. A.},
TITLE = {Explicit group-theoretic constructions of combinatorial schemes
and their applications in the construction of expanders and
concentrators},
JOURNAL = {Problemy Peredachi Informatsii},
FJOURNAL = {Akademiya Nauk SSSR. Institut Problem Peredachi Informatsii
Akademii Nauk SSSR. Problemy Peredachi Informatsii},
VOLUME = {24},
YEAR = {1988},
NUMBER = {1},
PAGES = {51--60},
ISSN = {0555-2923},
MRCLASS = {68R10 (05C99 94A15)},
MRNUMBER = {89f:68054},
MRREVR = {Mirko K{\v{r}}iv{\'a}nek},
}

@Article{GabberGa81,
title={Explicit Constructions of Linear-Sized Superconcentrators},
author={Ofer Gabber and Zvi Galil},
pages={407--420},
journal=jcss,
year=1981,
month=jun,
volume=22,
number=3,
preliminary={FOCS::GabberG1979},
source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib}
}

@article {AlonGaMi87,
AUTHOR = {Alon, N. and Galil, Z. and Milman, V. D.},
TITLE = {Better expanders and superconcentrators},
JOURNAL = {J. Algorithms},
FJOURNAL = {Journal of Algorithms},
VOLUME = {8},
YEAR = {1987},
NUMBER = {3},
PAGES = {337--347},
ISSN = {0196-6774},
CODEN = {JOALDV},
MRCLASS = {68Q20 (05C75 68R10)},
MRNUMBER = {89f:68023},
}

@InProceedings{AlonMi84,
title={Eigenvalues, Expanders and Superconcentrators (Extended
Abstract)},
author={Alon, Noga and Milman, V. D.},
pages={320--322},
crossref={FOCS25},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Proceedings{FOCS25,
title={25th Annual Symposium on Foundations of Computer Science},
booktitle={25th Annual Symposium on Foundations of Computer Science},
month={24--26 } # oct,
year=1984,
address={Singer Island, Florida},
organization={IEEE},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@article {JimboMa87,
AUTHOR = {Shuji Jimbo and Akira Maruoka},
TITLE = {Expanders obtained from affine transformations},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal of the J{\'a}nos Bolyai
Mathematical Society},
VOLUME = {7},
YEAR = {1987},
NUMBER = {4},
PAGES = {343--355},
ISSN = {0209-9683},
CODEN = {COMBDI},
MRCLASS = {68R10 (05C99)},
MRNUMBER = {89d:68071},
MRREVR = {Mirko K{\v{r}}iv{\'a}nek},
}

@article {LubotzkyPhSa88,
AUTHOR = {Lubotzky, A. and Phillips, R. and Sarnak, P.},
TITLE = {Ramanujan graphs},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal of the J{\'a}nos Bolyai
Mathematical Society},
VOLUME = {8},
YEAR = {1988},
NUMBER = {3},
PAGES = {261--277},
ISSN = {0209-9683},
CODEN = {COMBDI},
MRCLASS = {05C75 (05C25 05C50)},
MRNUMBER = {89m:05099},
MRREVR = {David Riley Witte},
}

@article {Ajtai94,
AUTHOR = {Ajtai, M.},
TITLE = {Recursive construction for $3$-regular expanders},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal on Combinatorics and
the Theory of Computing},
VOLUME = {14},
YEAR = {1994},
NUMBER = {4},
PAGES = {379--416},
ISSN = {0209-9683},
CODEN = {COMBDI},
MRCLASS = {05C38 (05C85)},
MRNUMBER = {95m:05141},
MRREVR = {Marek Kubale},
}

@article {AlonMi85,
AUTHOR = {Alon, N. and Milman, V. D.},
TITLE = {$\lambda\sb 1,$ isoperimetric inequalities for graphs, and
superconcentrators},
JOURNAL = {J. Combin. Theory Ser. B},
FJOURNAL = {Journal of Combinatorial Theory. Series B},
VOLUME = {38},
YEAR = {1985},
NUMBER = {1},
PAGES = {73--88},
ISSN = {0095-8956},
CODEN = {JCBTB8},
MRCLASS = {05C50},
MRNUMBER = {87b:05092},
}

@Article{Tanner84,
author = {Michael R. Tanner},
title = {Explicit Concentrators from Generalized $N$-gons},
journal = {SIAM Journal on Algebraic Discrete Methods},
year = {1984},
OPTkey = {},
volume = {5},
number = {3},
pages = {287--293},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@InProceedings{BroderSh87,
title={On the Second Eigenvalue of Random Regular Graphs (Preliminary
Version)},
author={Broder, Andrei and Shamir, Eli},
pages={286--294},
crossref={FOCS28},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Proceedings{FOCS28,
title={28th Annual Symposium on Foundations of Computer Science},
booktitle={28th Annual Symposium on Foundations of Computer
Science},
month={12--14 } # oct,
year=1987,
address={Los Angeles, California},
organization={IEEE},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@article {Friedman91,
AUTHOR = {Friedman, Joel},
TITLE = {On the second eigenvalue and random walks in random $d$-regular
graphs},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal on Combinatorics and
the Theory of Computing},
VOLUME = {11},
YEAR = {1991},
NUMBER = {4},
PAGES = {331--362},
ISSN = {0209-9683},
CODEN = {COMBDI},
MRCLASS = {05C80 (05C50)},
MRNUMBER = {93i:05115},
MRREVR = {Lane Clark},
}

@article {Nilli91,
AUTHOR = {Nilli, A.},
TITLE = {On the second eigenvalue of a graph},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {91},
YEAR = {1991},
NUMBER = {2},
PAGES = {207--210},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C50},
MRNUMBER = {92j:05124},
MRREVR = {Wan Di Wei},
}

@string{jcomp = {Journal of Complexity}}

@Article{ChorGo89,
title={On the Power of Two-Point Based Sampling},
author={Benny Chor and Oded Goldreich},
pages={96--106},
journal=jcomp,
year=1989,
month=mar,
volume=5,
number=1,
source={http://theory.lcs.mit.edu/~dmjones/hbp/jcomp/jcomp.bib}
}
@InProceedings{CohenWi89,
title={Dispersers, Deterministic Amplification, and Weak Random
Sources (Extended Abstract)},
author={Cohen, Aviad and Wigderson, Avi},
pages={14--19},
crossref={FOCS30},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@InProceedings{ImpagliazzoZu89,
title={How to Recycle Random Bits},
author={Impagliazzo, Russell and Zuckerman, David},
pages={248--253},
crossref={FOCS30},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Proceedings{FOCS30,
title={30th Annual Symposium on Foundations of Computer Science},
booktitle={30th Annual Symposium on Foundations of Computer Science},
month={30 } # oct # {--1 } # nov,
year=1989,
address={Research Triangle Park, North Carolina},
organization={IEEE},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@article {Blum86,
AUTHOR = {Blum, M.},
TITLE = {Independent unbiased coin flips from a correlated biased
source---a finite state {M}arkov chain},
NOTE = {Theory of computing (Singer Island, Fla., 1984)},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal of the J{\'a}nos Bolyai
Mathematical Society},
VOLUME = {6},
YEAR = {1986},
NUMBER = {2},
PAGES = {97--108},
ISSN = {0209-9683},
CODEN = {COMBDI},
MRCLASS = {60J10 (68Q20 90D99)},
MRNUMBER = {88e:60079},
MRREVR = {Luc P. Devroye},
}
@InProceedings{AjtaiKoSz87,
title={Deterministic Simulation in {LOGSPACE}},
author={Ajtai, Mikl{\'o}s and Koml{\'o}s, J{\'a}nos and
Szemer{\'e}di, E.},
pages={132--140},
crossref={STOC19},
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@Proceedings{STOC19,
title={Proceedings of the Nineteenth Annual ACM Symposium on Theory of
Computing},
booktitle={Proceedings of the Nineteenth Annual ACM Symposium on
Theory of Computing},
month={25--27 } # may,
year=1987,
address={New York City},
c-organization={ACM},
key={ACM},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@InProceedings{BellareRo94,
title={Randomness-Efficient Oblivious Sampling},
author={Mihir Bellare and John Rompel},
pages={276--287},
crossref={FOCS35},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@Proceedings{FOCS35,
title={35th Annual Symposium on Foundations of Computer Science},
booktitle={35th Annual Symposium on Foundations of Computer
Science},
month={20--22 } # nov,
year=1994,
address={Santa Fe, New Mexico},
organization={IEEE},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}
}

@article {HastadImLeLu99,
AUTHOR = {H{\aa}stad, Johan and Impagliazzo, Russell and Levin, Leonid A.
and Luby, Michael},
TITLE = {A pseudorandom generator from any one-way function},
JOURNAL = {SIAM J. Comput.},
FJOURNAL = {SIAM Journal on Computing},
VOLUME = {28},
YEAR = {1999},
NUMBER = {4},
PAGES = {1364--1396 (electronic)},
ISSN = {1095-7111},
MRCLASS = {65C10 (68P25 68Q25 94A60)},
MRNUMBER = {2000b:65010},
MRREVR = {Francesco Fabris},
}

@TechReport{Goldreich97,
author = {Oded Goldreich},
title = {A Sample of Samplers: A Computational Perspective on Sampling},
institution = {Electronic Colloquium on Computational Complexity},
year = {1997},
OPTkey = {},
OPTtype = {},
number = {TR97-020},
OPTaddress = {},
month = {May},
OPTnote = {},
OPTannote = {}
}

@Article{CanettiEvGo95,
title={Lower bounds for sampling algorithms for estimating the
average},
author={Ran Canetti and Guy Even and Oded Goldreich},
pages={17--25},
journal=ipl,
month={13~} # jan,
year=1995,
volume=53,
number=1,
source={http://theory.lcs.mit.edu/~dmjones/hbp/ipl/ipl.bib}
}



@article {Morgenstern94,
AUTHOR = {Morgenstern, Moshe},
TITLE = {Existence and explicit constructions of $q+1$ regular
{R}amanujan graphs for every prime power $q$},
JOURNAL = {J. Combin. Theory Ser. B},
FJOURNAL = {Journal of Combinatorial Theory. Series B},
VOLUME = {62},
YEAR = {1994},
NUMBER = {1},
PAGES = {44--62},
ISSN = {0095-8956},
CODEN = {JCBTB8},
MRCLASS = {05C35 (05C25)},
MRNUMBER = {95h:05089},
MRREVR = {Marcus du Sautoy},
}




@article {Ustimenko97,
AUTHOR = {Ustimenko, V. A.},
TITLE = {Ramanujan graphs of a given degree},
JOURNAL = {Dopov. Nats. Akad. Nauk Ukr. Mat. Prirodozn. Tekh. Nauki},
FJOURNAL = {Dopov\={\i} d\={\i}\ Nats\={\i} onal\cprime no{\"\i}\ Akadem\={\i} {\"\i}\
Nauk Ukra{\"\i} ni. Matematika. Prirodoznavstvo. Tekhn\={\i}
chn\={\i}\ Nauki},
VOLUME = {1997},
NUMBER = {6},
PAGES = {37--41},
ISSN = {1025-6415},
MRCLASS = {05C75},
MRNUMBER = {98k:05123},
MRREVR = {Perla L. Myers},
YEAR = {1997}
}


@Article{PippengerYa82,
author = {N. Pippenger and A.C. Yao},
title = {Rearrangeable Networks with Limited Depth},
journal = {{SIAM} J. Algebraic and Discrete Methods},
year = {1982},
OPTkey = {},
volume = {3},
OPTnumber = {},
pages = {411--417},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@InProceedings{RazReingoldVa99b,
author = {Ran Raz and Omer Reingold and Salil Vadhan},
title = {Error Reduction for Extractors},
booktitle = {Proceedings of the 40th Annual Symposium on the Foundations of Computer Science},
year = {1999},
organization = {IEEE},
month = {October},
OPTpages = {},
address = {New York, NY},
OPTnote = {}
}

@InProceedings{FriedmanKaSz89,
title={On the Second Eigenvalue in Random Regular Graphs},
author={Friedman, Joel and Kahn, Jeff and Szemer{\'e}di, Endre},
pages={587--598},
crossref={STOC21},
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}

@Proceedings{STOC21,
title={Proceedings of the Twenty First Annual ACM Symposium on Theory
of Computing},
booktitle={Proceedings of the Twenty First Annual ACM Symposium on
Theory of Computing},
month={15--17 } # may,
year=1989,
address={Seattle, Washington},
c-organization={ACM},
key={ACM},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}
}


@InProceedings{ReingoldShWi00,
author = {Omer Reingold and Ronen Shaltiel and Avi Wigderson},
title = {Extracting Randomness via Repeated Condensing},
OPTbooktitle = {},
crossref = {FOCS41},
OPTkey = {},
OPTpages = {},
OPTyear = {},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
note = {},
OPTannote = {}
}

@Proceedings{FOCS41,
title={41st Annual Symposium on Foundations of Computer Science},
booktitle={41st Annual Symposium on Foundations of Computer
Science},
month={12--14 } # nov,
year=2000,
address={Redondo Beach, California},
c-organization={IEEE},
crossrefonly=1
}

@article {AlonGoHaPe92,
AUTHOR = {Alon, Noga and Goldreich, Oded and H{\aa}stad, Johan and
Peralta, Ren{\'e}},
TITLE = {Simple constructions of almost $k$-wise independent random
variables},
JOURNAL = {Random Structures \& Algorithms},
VOLUME = {3},
YEAR = {1992},
NUMBER = {3},
PAGES = {289--304},
ISSN = {1042-9832},
MRCLASS = {94A55 (65C10 68Q30)},
MRNUMBER = {93k:94006a},
}

@article {NaorNa93,
AUTHOR = {Naor, Joseph and Naor, Moni},
TITLE = {Small-bias probability spaces: efficient constructions and
applications},
JOURNAL = {SIAM Journal on Computing},
VOLUME = {22},
YEAR = {1993},
NUMBER = {4},
PAGES = {838--856},
ISSN = {0097-5397},
CODEN = {SMJCAT},
MRCLASS = {68Q25 (60C05 94C15)},
MRNUMBER = {94c:68092},
}