SIGN IN
SIGN UP
Min-wise independent permutations (extended abstract)
Full Text:
PDF
Buy this Article
Authors:
Andrei Z. Broder
Digital SRC, 130 Lytton Avenue, Palo Alto, CA
Moses Charikar
Computer Science Department, Stanford University, CA
Alan M. Frieze
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, Pennsylvania
Michael Mitzenmacher
Digital SRC, 130 Lytton Avenue, Palo Alto, CA
1998 Article
Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 136
· Downloads (cumulative): 1,138
· Citation Count: 78
Published in:
· Proceeding
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Pages 327-336
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-962-9
doi>
10.1145/276698.276781
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '14
Share:
|
Tags:
algorithms
experimentation
indexing methods
permutations and combinations
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder