Title
Pairwise Independence and Derandomization
Abstract
This set of notes gives several applications of the following paradigm. The paradigm consists of two complementary parts. The first part is to design a probabilistic algorithm described by a sequence of random variables so that the analysis is valid assuming limited independence between the random variables. The second part is the design of a small probability space for the random variables such that they are somewhat independent of each other. Thus, the analysis of the algorithm holds even when the random variables used by the algorithm are generated according to the small space.
Year
DOI
Venue
2005
10.1561/0400000009
Foundations and Trends in Theoretical Computer Science
Keywords
Field
DocType
probabilistic algorithm,random variable
Exchangeable random variables,Random element,Discrete mathematics,Convergence of random variables,Algebra of random variables,Algorithm,Theoretical computer science,Multivariate random variable,Pairwise independence,Independent and identically distributed random variables,Sum of normally distributed random variables,Mathematics
Journal
Volume
Issue
ISSN
1
4
1551-305X
Citations 
PageRank 
References 
37
5.03
31
Authors
2
Name
Order
Citations
PageRank
Michael Luby190101319.35
Avi Wigderson282051064.31