A derandomization using min-wise independent permutations
Under an Elsevier user license
open archive
Keywords
Min-wise independence
Derandomization
Set cover
Parallel algorithms
Cited by (0)
- 1
Most of this work was done while at Compaq Systems Research Center.
- 2
Supported by the Pierre and Christine Lamond Fellowship and in part by an ARO MURI Grant DAAH04-96-1-0007 and NSF Award CCR-9357849, with matching funds from IBM, Schlumberger Foundation, Shell Foundation, and Xerox Corporation.
- 3
Most of this work was done while at Compaq Systems Research Center. Supported in part by NSF Award CCR-9983832 and an Alfred P. Sloan Research Fellowship.
Copyright © 2003 Elsevier B.V. All rights reserved.