<--- Back to Details
First PageDocument Content
Randomness / Random number generation / Information theory / Statistical randomness / Theoretical computer science / Randomness extractor / Pseudorandomness / Entropy / Random sequence / Extractor / Min entropy / Hardware random number generator
Date: 2009-06-18 19:46:36
Randomness
Random number generation
Information theory
Statistical randomness
Theoretical computer science
Randomness extractor
Pseudorandomness
Entropy
Random sequence
Extractor
Min entropy
Hardware random number generator

Games for Extracting Randomness∗ Ran Halprin and Moni Naor† Department of Computer Science and Applied Mathematics Weizmann Institute of Science {ran.halprin, moni.naor}@weizmann.ac.il

Add to Reading List

Source URL: cups.cs.cmu.edu

Download Document from Source Website

File Size: 590,74 KB

Share Document on Facebook

Similar Documents

V. G. VOVK  ON A CRITERION OF RANDOMNESS (Communicated by Academician A. N. Kolmogorov, This work belongs to algorithmic information theory (seeTheorem 1 shows that if some sequence is random with resp

V. G. VOVK ON A CRITERION OF RANDOMNESS (Communicated by Academician A. N. Kolmogorov, This work belongs to algorithmic information theory (seeTheorem 1 shows that if some sequence is random with resp

DocID: 1uGQs - View Document

Lecture notes on Spatial Random Permutations Ron Peled∗ June 7, 2015 Abstract These notes accompany a sequence of lectures given at the Warsaw Probability

Lecture notes on Spatial Random Permutations Ron Peled∗ June 7, 2015 Abstract These notes accompany a sequence of lectures given at the Warsaw Probability

DocID: 1uAsy - View Document

Percolation and Random Walks on Graphs, MichaelmasExample Sheet 1 1. Let (an )n≥1 be a sequence of real numbers satisfying an+m ≤ an + am for all n, m ≥ 1.

Percolation and Random Walks on Graphs, MichaelmasExample Sheet 1 1. Let (an )n≥1 be a sequence of real numbers satisfying an+m ≤ an + am for all n, m ≥ 1.

DocID: 1uzB3 - View Document

Text-line Random Shuffling Program David R. Musser April 25, 2005 Abstract This short document presents a program that takes as input any sequence of items formatted one item per line and outputs the sequence

Text-line Random Shuffling Program David R. Musser April 25, 2005 Abstract This short document presents a program that takes as input any sequence of items formatted one item per line and outputs the sequence

DocID: 1uzdK - View Document

Synthesizing Manipulation Sequences for Under-Specified Tasks using Unrolled Markov Random Fields Jaeyong Sung, Bart Selman and Ashutosh Saxena Abstract— Many tasks in human environments require performing a sequence o

Synthesizing Manipulation Sequences for Under-Specified Tasks using Unrolled Markov Random Fields Jaeyong Sung, Bart Selman and Ashutosh Saxena Abstract— Many tasks in human environments require performing a sequence o

DocID: 1tF3x - View Document