The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Min-wise independent permutations (extended abstract)
Open accessAbstract
We define and study the notion of min-wise independent families of permutations.We say that F ⊆ S n is min-wise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr min{π(X)} = π(x) = 1 |X| .
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,000
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Introduction to Analytic Number Theory
Apostol, T. M. (1976) · Undergraduate Texts in Mathematics · doi:10.1007/978-3-662-28579-4 · Cited by 2,617
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
On the resemblance and containment of documents
Broder, A. Z. (2002) · Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) · doi:10.1109/sequen.1997.666900 · Cited by 1,698
Self-citationIntroduction to Analytic Number Theory
Apostol, T. M. (1976) · Undergraduate texts in mathematics · doi:10.1007/978-1-4757-5579-4 · Cited by 1,583
Syntactic clustering of the Web
Broder, A. Z., 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,343
Self-citationBerners-Lee, T., Cailliau, R., Luotonen, A., Nielsen, H. F., & Secret, A. (1994) · Communications of the ACM · doi:10.1145/179606.179671 · Cited by 1,128
Dynamic Perfect Hashing: Upper and Lower Bounds
Dietzfelbinger, M., Karlin, A. R., Mehlhorn, K., der Heide, F. M. A., Rohnert, H., & Tarjan, R. E. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21968 · Cited by 421
Cited by
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437
Data Streams: Algorithms and Applications
Muthukrishnan, S. (2005) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000002 · Cited by 718
Detecting near-duplicates for web crawling
Manku, G. S., Jain, A., & Das Sarma, A. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242592 · Cited by 617
Identifying and Filtering Near-Duplicate Documents
Broder, A. Z. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45123-4_1 · Cited by 395
Self-citationEfficient community detection in large networks using content and links
Ruan, Y., Fuhry, D., & Parthasarathy, S. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488483 · Cited by 304
Metadata
- Authors
- Broder, A. Z., Charikar, M., Frieze, A. M., & Mitzenmacher, M.
- Venue
- Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 327-336
- OpenAlex
- W1991800036
- Cited by
- 364
- References
- 14
- FWCI
- 6.72
- Type
- conference paper
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Min-wise independent permutations (extended abstract). https://app.cochat.ai/papers/10.1145/276698.276781
- The paper
- Broder, A. Z., Charikar, M., Frieze, A. M., & Mitzenmacher, M. (1998). Min-wise independent permutations (extended abstract). Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98. https://doi.org/10.1145/276698.276781
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
