Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman. Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families. In Dorit S. Hochbaum, Klaus Jansen, José D. P. Rolim, Alistair Sinclair, editors, Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Opti. Volume 1671 of Lecture Notes in Computer Science, pages 11-15, Springer, 1999.
@inproceedings{SaksSZZ99,
title = {Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families},
author = {Michael E. Saks and Aravind Srinivasan and Shiyu Zhou and David Zuckerman},
year = {1999},
tags = {e-science},
researchr = {https://researchr.org/publication/SaksSZZ99},
cites = {0},
citedby = {0},
pages = {11-15},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Opti},
editor = {Dorit S. Hochbaum and Klaus Jansen and José D. P. Rolim and Alistair Sinclair},
volume = {1671},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66329-0},
}