A. Broder, Anna Karlin (1990)
Multilevel adaptive hashing
A. Broder (1997)
On the resemblance and containment of documentsProceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)
R. Seltzer, D. Ray, E. Ray (1996)
The AltaVista Revolution: How to Find Anything on the Internet
R. Souza, P. Krishnakumar, C. Özveren, R. Simcoe, B. Spinney, Robert Thomas, R. Walsh (1993)
GIGAswitch System: A High-performance Packet-switching PlatformDigit. Tech. J., 6
E. Kovatcheva (1999)
How to Find Anything on The Internet
D. Knuth (1997)
The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition
N. Alon, J. Spencer (1992)
The Probabilistic Method
Tim Berners-Lee, R. Cailliau, A. Luotonen, H. Nielsen, Arthur Secret (1994)
The world-wide web : Internet technologyCommunications of The ACM, 37
T. Cover, Joy Thomas (2005)
Elements of Information Theory
P. Maier (1999)
WORLD WIDE WEB
(1998)
Filtering near-duplicate documents
This research was sponsored in part by National Science Foundation (NSF) grant no. CCR-0122581
A. Broder, S. Glassman, M. Manasse, G. Zweig (1997)
Syntactic Clustering of the WebComput. Networks, 29
N. Alon, Oded Goldreich, J. Håstad, R. Peralta (1990)
Simple construction of almost k-wise independent random variablesProceedings [1990] 31st Annual Symposium on Foundations of Computer Science
MD KINAMI, I. Miyazaki, Mdi
AND T
Y. Takei, T. Itoh, T. Shinozaki (2000)
Constructing an Optimal Family of Min-Wise Independent PermutationsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 83
E. Cohen (1994)
Estimating the size of the transitive closure in linear timeProceedings 35th Annual Symposium on Foundations of Computer Science
N. Alon, Martin Dietzfelbinger, Peter Miltersen, E. Petrank, G. Tardos (1997)
Is linear hashing good?
(1998)
Min-wise independent permutations, in ``Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing,'' pp
David Karger, Eric Lehman, F. Leighton, Rina Panigrahy, Matthew Levine, Daniel Lewin (1997)
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
Martin Dietzfelbinger, Anna Karlin, K. Mehlhorn, F. Heide, H. Rohnert, R. Tarjan (1994)
Dynamic Perfect Hashing: Upper and Lower BoundsSIAM J. Comput., 23
L. Carter, M. Wegman (1979)
Universal Classes of Hash FunctionsJ. Comput. Syst. Sci., 18
J. Körner (1986)
Fredman-Kolmo´s bounds and information theorySiam Journal on Algebraic and Discrete Methods, 7
P. Indyk (1999)
A small approximately min-wise independent family of hash functionsJ. Algorithms, 38
K. Mulmuley (1992)
Randomized geometric algorithms and pseudorandom generatorsAlgorithmica, 16
D. Knuth (1997)
The art of computer programming: V.1.: Fundamental algorithms
D. Knuth (1998)
The Art of Computer Programming: Volume 3: Sorting and Searching
D. Knuth (1968)
The Art of Computer Programming
B. Bollobás (1986)
Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability
and as an in
T. Apostol (1976)
Introduction to analytic number theory
The authors thank Noam Elkies for enlightening discussions regarding Farey series
G. Hardy, By Hardy (1939)
An Introduction to the Theory of NumbersThe Mathematical Gazette, 23
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 – Unpaywall
Published: Jan 1, 1998
Access the full text.
Sign up today, get DeepDyve free for 14 days.