The DOI matches its Crossref record.
The Art of Computer Programming, Volume 3, Sorting and Searching
Abstract
M. V. Wilkes; The Art of Computer Programming, Volume 3, Sorting and Searching, The Computer Journal, Volume 17, Issue 4, 1 November 1974, Pages 324, https://do
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
Advances in Record-Linkage Methodology as Applied to Matching the 1985 Census of Tampa, Florida
Jaro, M. A. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478785 · Cited by 1,401
Algorithms for Reporting and Counting Geometric Intersections
Bentley, & Ottmann (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675432 · Cited by 996
Mason, S. J., & Graham, N. E. (2002) · Quarterly Journal of the Royal Meteorological Society · doi:10.1256/003590002320603584 · Cited by 868
Böhm, C., Berchtold, S., & Keim, D. A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502809 · Cited by 827
Navarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
A practical part-of-speech tagger
Cutting, D., Kupiec, J., Pedersen, J., & Sibun, P. (1992) · Proceedings of the third conference on Applied natural language processing - · doi:10.3115/974499.974523 · Cited by 618
A locally adaptive data compression scheme
Bentley, J. L., Sleator, D. D., Tarjan, R. E., & Wei, V. K. (1986) · Communications of the ACM · doi:10.1145/5684.5688 · Cited by 523
Learning to Hash for Indexing Big Data—A Survey
Wang, J., Liu, W., Kumar, S., & Chang, S.-F. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2487976 · Cited by 519
Learning to Rank Using User Clicks and Visual Features for Image Retrieval
Yu, J., Tao, D., Wang, M., & Rui, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2336697 · Cited by 445
High performance dynamic lock-free hash tables and list-based sets
Michael, M. M. (2002) · Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures · doi:10.1145/564870.564881 · Cited by 413
The LRU-K page replacement algorithm for database disk buffering
O'Neil, E. J., O'Neil, P. E., & Weikum, G. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170081 · Cited by 369
Tight Bounds on the Complexity of Parallel Sorting
Leighton, T. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.5009385 · Cited by 368
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Computer programs for detecting and correcting spelling errors
Peterson, J. L. (1980) · Communications of the ACM · doi:10.1145/359038.359041 · Cited by 334
Reducing the space requirement of suffix trees
Kurtz, S. (1999) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199911)29:13<1149::aid-spe274>3.0.co;2-o · Cited by 334
Flajolet, P., & Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_34 · Cited by 274
Quantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
Metadata
- Authors
- Wilkes, M. V.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1974-11-01
- Volume
- 17
- Issue
- 4
- Pages
- 324-324
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2326587081
- Cited by
- 707
- References
- 0
- FWCI
- 4.63
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.