Almost k-wise independence versus k-wise independence
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3048068 (Why is no real title available?)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Probability Spaces: Efficient Constructions and Applications
Cited in
(25)- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- scientific article; zbMATH DE number 7650110 (Why is no real title available?)
- 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
- An extension of Kemperman's characterization on k-independence and its application
- \(H\)-wise independence
- Bounded independence versus symmetric tests
- Revisiting iterated attacks in the context of decorrelation theory
- Testing non-uniform \(k\)-wise independent distributions over product spaces (extended abstract)
- The maximal probability that \(k\)-wise independent bits are all 1
- On the relationship between -biased random variables and -dependent random variables
- Explicit two-source extractors and resilient functions
- scientific article; zbMATH DE number 1959634 (Why is no real title available?)
- 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
- Bounded independence plus noise fools products
- A moment-matching approach to testable learning and a new characterization of Rademacher complexity
- Testing distributional assumptions of learning algorithms
- 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)
