A derandomization using min-wise independent permutations
From MaRDI portal
Publication:876688
DOI10.1016/S1570-8667(03)00003-0zbMATH Open1118.68580OpenAlexW2066097866MaRDI QIDQ876688FDOQ876688
Moses Charikar, Andrei Broder, Michael Mitzenmacher
Publication date: 26 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00003-0
Cites Work
- Universal classes of hash functions
- Simple Constructions of Almost k-wise Independent Random Variables
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Randomized geometric algorithms and pseudorandom generators
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Min-wise independent groups
- Using Rademacher permutations to reduce randomness
- Interval selection in the streaming model
- Title not available (Why is that?)
- An efficient distributed algorithm for constructing small dominating sets
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Exponential time improvement for min-wise based algorithms
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Title not available (Why is that?)
Recommendations
This page was built for publication: A derandomization using min-wise independent permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876688)
