Search results for "k-wise independence"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie	Testing k-wise and almost k-wise independence.	STOC	2007	DBLP DOI BibTeX RDF	almost k-wise independence, hidden clique, property testing, Fourier analysis, k-wise independence
2	Noga Alon, Dana Moshkovitz, Shmuel Safra	Algorithmic construction of sets for k-restrictions.	ACM Transactions on Algorithms	2006	DBLP DOI BibTeX RDF	k-restriction, almost k-wise independence, generalized hashing, splitter, Set-Cover, Derandomization, group testing
1	Vladimir Braverman, Rafail Ostrovsky	Measuring independence of datasets.	STOC	2010	DBLP DOI BibTeX RDF	data streams, randomized algorithms, dimension reduction, theory of computation
1	Per Austrin, Johan Håstad	Randomly supported independence and resistance.	STOC	2009	DBLP DOI BibTeX RDF	approximation resistance, k-wise independence
1	Noga Alon, Shai Gutner	Balanced Hashing, Color Coding and Approximate Counting.	IWPEC	2009	DBLP DOI BibTeX RDF	Approximate counting of subgraphs, derandomization, expanders, perfect hashing, color-coding, k-wise independence
1	Vladimir Braverman, Rafail Ostrovsky	Measuring $k$-Wise Independence of Streaming Data	CoRR	2008	DBLP BibTeX RDF
1	Noga Alon, Asaf Nussboim	k-Wise Independent Random Graphs.	FOCS	2008	DBLP DOI BibTeX RDF
1	Phillip G. Bradford, Olga V. Gavrylyako	Foundations of Security for Hash Chains in Ad Hoc Networks.	Cluster Computing	2005	DBLP DOI BibTeX RDF	time-space lower bound, hash chains, k-wise independence
1	Moni Naor, Asaf Nussboim, Eran Tromer	Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs.	TCC	2005	DBLP DOI BibTeX RDF
1	Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff	Simple Permutations Mix Well.	ICALP	2004	DBLP DOI BibTeX RDF
1	Noga Alon, Oded Goldreich, Yishay Mansour	Almost k-wise independence versus k-wise independence.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
1	Valentine Kabanets	Almost k-wise independence and hard Boolean functions.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Toshiya Itoh, Yoshinori Takei, Jun Tarui	On the sample size of k-restricted min-wise independent permutations and other k-wise distributions.	STOC	2003	DBLP DOI BibTeX RDF	higher incidence matrices, linear algebra methods, min-wise independent permutations, k-wise independence
1	Kazumaro Aoki, Serge Vaudenay	On the Use of GF-Inversion as a Cryptographic Primitive.	Selected Areas in Cryptography	2003	DBLP DOI BibTeX RDF
1	Noga Alon, Oded Goldreich, Yishay Mansour	Almost k-wise independence versus k-wise independence	Electronic Colloquium on Computational Complexity (ECCC)	2002	DBLP BibTeX RDF
1	Mary Cryan, Peter Bro Miltersen	On Pseudorandom Generators in NC.	MFCS	2001	DBLP DOI BibTeX RDF
1	Valentine Kabanets	Almost k-Wise Independence and Hard Boolean Functions.	LATIN	2000	DBLP DOI BibTeX RDF
1	Valentine Kabanets	Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs	Electronic Colloquium on Computational Complexity (ECCC)	1999	DBLP BibTeX RDF
1	Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher	A Derandomization Using Min-Wise Independent Permutations.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Noga Alon	Derandomization Via Small Sample Spaces (Abstract).	SWAT	1996	DBLP DOI BibTeX RDF