Almost k-wise independence versus k-wise independence
DOI10.1016/S0020-0190(03)00359-4zbMATH Open1178.68251OpenAlexW1994423049MaRDI QIDQ1028993FDOQ1028993
Authors: Noga Alon, Oded Goldreich, Yishay Mansour 
Publication date: 9 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00359-4
Recommendations
- scientific article; zbMATH DE number 7378666
- Simple Constructions of Almost k-wise Independent Random Variables
- Almost \(k\)-wise independent sample spaces and their cryptologic applications
- On construction of \(k\)-wise independent random variables
- Robust characterizations of \(k\)-wise independence over product spaces and related testing results
theory of computationcombinatorial problems\(k\)-wise independent distributionsalmost \(k\)-wise independent distributionssmall probability spacessmall-bias probability spaces
Cites Work
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Simple Constructions of Almost k-wise Independent Random Variables
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Title not available (Why is that?)
Cited In (25)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate bounded indistinguishability
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices
- \(H\)-wise independence
- An extension of Kemperman's characterization on \(k\)-independence and its application
- Bounded independence versus symmetric tests
- Testing non-uniform \(k\)-wise independent distributions over product spaces (extended abstract)
- The maximal probability that \(k\)-wise independent bits are all 1
- Revisiting iterated attacks in the context of decorrelation theory
- On the relationship between \(\varepsilon\)-biased random variables and \(\varepsilon\)-dependent random variables
- Explicit two-source extractors and resilient functions
- Title not available (Why is that?)
- Simulating (log c n )-wise independence in NC
- Randomized OBDD-based graph algorithms
- Bounded independence vs. moduli
- Almost \(k\)-wise independent sample spaces and their cryptologic applications
- A moment-matching approach to testable learning and a new characterization of Rademacher complexity
- Testing distributional assumptions of learning algorithms
- Bounded independence plus noise fools products
- Robust characterizations of \(k\)-wise independence over product spaces and related testing results
- Bounded indistinguishability and the complexity of recovering secrets
- \(H\)-wise independence
This page was built for publication: Almost \(k\)-wise independence versus \(k\)-wise independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028993)
