© 2011

Deterministic Extraction from Weak Random Sources


Table of contents

  1. Front Matter
    Pages i-xi
  2. Ariel Gabizon
    Pages 1-10
  3. Back Matter
    Pages 123-148

About this book


A deterministic extractor is a function that extracts almost perfect random bits from a weak random source. In this research monograph the author constructs deterministic extractors for several types of sources. A basic theme in this work is a methodology of recycling randomness which enables increasing the output length of deterministic extractors to near optimal length. The author's main work examines deterministic extractors for bit-fixing sources, deterministic extractors for affine sources and polynomial sources over large fields, and increasing the output length of zero-error dispersers. This work will be of interest to researchers and graduate students in combinatorics and theoretical computer science.


Affine sources Derandomization Deterministic extractors Dispersers Randomness extractors Recycling randomness

Authors and affiliations

  1. 1.Dept. Computer ScienceUniversity of Texas at AustinAustin, TXUSA

Bibliographic information

  • Book Title Deterministic Extraction from Weak Random Sources
  • Authors Ariel Gabizon
  • Series Title Monographs in Theoretical Computer Science. An EATCS Series
  • Series Abbreviated Title Monographs Theoret.Computer Science(formerly:EATCS)
  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Hardcover ISBN 978-3-642-14902-3
  • Softcover ISBN 978-3-642-26538-9
  • eBook ISBN 978-3-642-14903-0
  • Series ISSN 1431-2654
  • Edition Number 1
  • Number of Pages XII, 148
  • Number of Illustrations 0 b/w illustrations, 0 illustrations in colour
  • Topics Theory of Computation
    Mathematics of Computing
    Algebraic Geometry
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking


From the reviews:

“This monograph is in the European Association for Theoretical Computer Science (EATCS) monograph series. It is an edited version of the author’s PhD thesis. … the book presents probability arguments and methods quite clearly, and in a way that readers can study them separately. Finally, the book contains two very useful appendices, one on probability methods and the other on concepts from algebraic geometry.” (Bruce Litow, ACM Computing Reviews, November, 2011)