The DOI matches its Crossref record; 16 of the 17 references it cites were found in a registry or an index.
Identifying and Filtering Near-Duplicate Documents
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
On the resemblance and containment of documents
Broder, A. (2002) · Compression and Complexity of Sequences (SEQUENCES) · doi:10.1109/sequen.1997.666900 · Cited by 1,818
Self-citationSyntactic clustering of the Web
Broder, A., Glassman, S. C., Manasse, M. S., & Zweig, G. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00031-7 · Cited by 1,348
Self-citationMin-Wise Independent Permutations
Broder, A., Charikar, M., FRIEZE, A. M., & Mitzenmacher, M. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1690 · Cited by 812
Self-citationFinding similar files in a large file system
Manber, U. (1994) · Cited by 597
Copy detection mechanisms for digital documents
Brin, S., Davis, J., & García-Molina, H. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223855 · Cited by 479
A technique for measuring the relative size and overlap of public Web search engines
Bharat, K. A., & Broder, A. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00127-5 · Cited by 392
Self-citationMin-wise independent permutations (extended abstract)
Broder, A., Charikar, M., FRIEZE, A. M., & Mitzenmacher, M. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276781 · Cited by 364
Self-citation(1995) · Cited by 296
Some applications of Rabin’s fingerprinting method
Broder, A. (1993) · Springer eBooks · doi:10.1007/978-1-4613-9323-8_11 · Cited by 204
Self-citationBuilding a scalable and accurate copy detection mechanism
Shivakumar, N., & García-Molina, H. (1996) · ACM international conference on Digital libraries · doi:10.1145/226931.226961 · Cited by 161
Finding Near-Replicas of Documents on the Web
Shivakumar, N., & García-Molina, H. (1999) · Lecture notes in computer science · doi:10.1007/10704656_13 · Cited by 99
Finding Near-Replicas of Documents and Servers on the Web
Shivakumar, N., & García-Molina, H. (1998) · International Workshop on the Web and Databases · Cited by 88
The AltaVista Search revolution
Ray, E. J., Ray, D. S., & SELTZER, R. (1997) · Cited by 18
The AltaVista Revolution: How to Find Anything on the Internet
SELTZER, R., Ray, D. S., & Ray, E. J. (1996) · Osborne/McGraw-Hill eBooks · Cited by 8
Min-Wise versus linear independence (extended abstract)
Broder, A., & Feige, U. (2000) · doi:10.5555/338219.338246 · Cited by 5
Self-citationApproximate string-matching and the q-gram distance
Ukkonen, E. (1993) · Springer eBooks · doi:10.1007/978-1-4613-9323-8_22 · Cited by 3
Research works printed but not linked: 2
- A. Z. Broder and U. Feige. Min-Wise versus Linear Independence. In Proceedings of the Eleventh Annual ACM-SI AM Symposium on Discrete Algorithms, pages 147–154, 2000.
- N. Heintze. Scalable Document Fingerprinting. Proceedings of the Second USENIX Workshop on Electronic Commerce, pages 191–200, 1996.
Cited by
Sorted by citations
Mash: fast genome and metagenome distance estimation using MinHash
Ondov, B. D., Treangen, T. J., Melsted, P., Mallonee, A. B., Bergman, N. H., Koren, S., & Phillippy, A. M. (2016) · Genome biology · doi:10.1186/s13059-016-0997-x · Cited by 3,373
Assembling large genomes with single-molecule sequencing and locality-sensitive hashing
Berlin, K., Koren, S., Chin, C.-S., Drake, J. P., Landolin, J. M., & Phillippy, A. M. (2015) · Nature Biotechnology · doi:10.1038/nbt.3238 · Cited by 947
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
Flajolet, P., Fusy, É., Gandouet, O., & Meunier, F. (2007) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.3545 · Cited by 709
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Becchetti, L., Boldi, P., Castillo, C., & Gionis, A. (2008) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1401890.1401898 · Cited by 317
A Comprehensive Study of the Past, Present, and Future of Data Deduplication
Xia, W., Jiang, H., Feng, D., Douglis, F., Shilane, P., Hua, Y., Fu, M., Zhang, Y., & Zhou, Y. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2571298 · Cited by 319
Metadata
- Authors
- Broder, A. Z.
- Corresponding author
- Broder, Andrei Z.
- ORCID
- Broder, Andrei Z.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 1-10
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2148885851
- Cited by
- 395
- References
- 17
- Citations by year
- 2026: 15 · 2025: 18 · 2024: 12 · 2023: 11 · 2022: 19 · 2021: 18 · 2020: 12 · 2019: 14 · 2018: 11 · 2017: 13 · 2016: 31 · 2015: 23 · 2014: 20 · 2013: 28 · 2012: 29
- FWCI
- 0.85
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Information Systems › Data Quality and Management
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Keywords
- near-duplicate detection, document filtering, random sampling, sketching, web indexing, search engine indexing, AltaVista
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
