Sciweavers

7 search results - page 1 / 2
» Almost k-wise independence versus k-wise independence
Sort
View
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
13 years 10 months ago
Derandomized Constructions of k-Wise (Almost) Independent Permutations
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
Eyal Kaplan, Moni Naor, Omer Reingold
FOCS
1990
IEEE
13 years 9 months ago
Simple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
Noga Alon, Oded Goldreich, Johan Håstad, Ren...
FOCS
2008
IEEE
13 years 11 months ago
k-Wise Independent Random Graphs
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
Noga Alon, Asaf Nussboim
ICALP
2010
Springer
13 years 10 months ago
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Ronitt Rubinfeld, Ning Xie
ECCC
2002
90views more  ECCC 2002»
13 years 5 months ago
Almost k-wise independence versus k-wise independence
We say that a distribution over {0, 1}n is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. ...
Noga Alon, Oded Goldreich, Yishay Mansour