The DOI matches its Crossref record.
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A survey of decision tree classifier methodology
Safavian, S. R., & Landgrebe, D. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.97458 · Cited by 3,808
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Construction of multilocus genetic linkage maps in humans.
Lander, E. S., & Green, P. (1987) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.84.8.2363 · Cited by 1,428
Tree visualization with tree-maps: 2-d space-filling approach
Shneiderman, B. (1992) · ACM Transactions on Graphics · doi:10.1145/102377.115768 · Cited by 1,328
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
An analysis of alpha-beta pruning
Knuth, D. E., & Moore, R. W. (1975) · Artificial Intelligence · doi:10.1016/0004-3702(75)90019-3 · Cited by 1,004
Self-citationSPIRAL: Code Generation for DSP Transforms
Puschel, M., Moura, J. M. F., Johnson, J. R., Padua, D., Veloso, M. M., Singer, B. W., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., et al. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840306 · Cited by 826
Min-Wise Independent Permutations
Broder, A. Z., Charikar, M., Frieze, A. M., & Mitzenmacher, M. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1690 · Cited by 802
RNA sequence analysis using covariance models
Eddy, S. R., & Durbin, R. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.11.2079 · Cited by 793
A similarity measure for indefinite rankings
Webber, W., Moffat, A., & Zobel, J. (2010) · ACM Transactions on Information Systems · doi:10.1145/1852102.1852106 · Cited by 781
Algorithms for the Longest Common Subsequence Problem
Hirschberg, D. S. (1977) · Journal of the ACM · doi:10.1145/322033.322044 · Cited by 750
The existence of refinement mappings
Abadi, M., & Lamport, L. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90224-p · Cited by 737
Structured Programming with go to Statements
Knuth, D. E. (1974) · ACM Computing Surveys · doi:10.1145/356635.356640 · Cited by 678
Self-citationInferring decision trees using the minimum description lenght principle
Ross Quinlan, J., & Rivest, R. L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90010-2 · Cited by 652
Region-Based Memory Management
Tofte, M., & Talpin, J.-P. (1997) · Information and Computation · doi:10.1006/inco.1996.2613 · Cited by 615
Dynamic storage allocation: A survey and critical review
Wilson, P. R., Johnstone, M. S., Neely, M., & Boles, D. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60368-9_19 · Cited by 594
List processing in real time on a serial computer
Baker, H. G. (1978) · Communications of the ACM · doi:10.1145/359460.359470 · Cited by 592
Identifying Hierarchical Structure in Sequences: A linear-time algorithm
Nevill-Manning, C. G., & Witten, I. H. (1997) · Journal of Artificial Intelligence Research · doi:10.1613/jair.374 · Cited by 549
Atchison, W. F., Conte, S. D., Hamblen, J. W., Hull, T. E., Keenan, T. A., Kehl, W. B., McCluskey, E. J., Navarro, S. O., Rheinboldt, W. C., Schweppe, E. J., et al. (1968) · Communications of the ACM · doi:10.1145/362929.362976 · Cited by 468
Sequential abstract-state machines capture sequential algorithms
Gurevich, Y. (2000) · ACM Transactions on Computational Logic · doi:10.1145/343369.343384 · Cited by 458
Measurement of Areas on a Sphere Using Fibonacci and Latitude–Longitude Lattices
González, Á. (2010) · Mathematical Geosciences · doi:10.1007/s11004-009-9257-x · Cited by 450
Cohen, W. W. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276323 · Cited by 379
Complex Networks: Principles, Methods and Applications
Latora, V., Nicosia, V., & Russo, G. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316216002 · Cited by 372
MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
Lim, H., Han, D., Andersen, D. G., & Kaminsky, M. (2018) · Figshare · doi:10.1184/r1/6607280 · Cited by 361
Gallo, G., & Pallottino, S. (1988) · Annals of Operations Research · doi:10.1007/bf02288320 · Cited by 352
Software watermarking: models and dynamic embeddings
Collberg, C., & Thomborson, C. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292569 · Cited by 342
Implementation of the typed call-by-value λ-calculus using a stack of regions
Tofte, M., & Talpin, J.-P. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.177855 · Cited by 337
Performance evaluation of component-based software systems: A survey
Koziolek, H. (2010) · Performance Evaluation · doi:10.1016/j.peva.2009.07.007 · Cited by 329
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Berdine, J., Calcagno, C., & O’Hearn, P. W. (2006) · Lecture Notes in Computer Science · doi:10.1007/11804192_6 · Cited by 316
A System for Denial-of-Service Attack Detection Based on Multivariate Correlation Analysis
Tan, Z., Jamdagni, A., He, X., Nanda, P., & Liu, R. P. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.146 · Cited by 314
Fast Kernels for String and Tree Matching
Vishwanathan, S. V. N., & Smola, A. J. (2004) · Kernel Methods in Computational Biology · doi:10.7551/mitpress/4057.003.0008 · Cited by 294
Topologically sweeping an arrangement
Edelsbrunner, H., & Guibas, L. J. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12171 · Cited by 283
Dynamic Pricing Under a General Parametric Choice Model
Broder, J., & Rusmevichientong, P. (2012) · Operations Research · doi:10.1287/opre.1120.1057 · Cited by 275
Smith, E. M. B., & Pantelides, C. C. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00286-5 · Cited by 263
Semiring Frameworks and Algorithms for Shortest-Distance Problems
Mohri, M. (2002) · doi:10.25596/jalc-2002-321 · Cited by 254
The event scheduling problem in molecular dynamic simulation
Rapaport, D. C. (1980) · Journal of Computational Physics · doi:10.1016/0021-9991(80)90104-7 · Cited by 252
A trio of inference problems that could win you a Nobel Prize in statistics (if you help fund it)
(2014) · Past, Present, and Future of Statistical Science · doi:10.1201/b16720-52 · Cited by 23
AI-Generated Code Not Considered Harmful
Kendon, T., Wu, L., & Aycock, J. (2023) · Proceedings of the 25th Western Canadian Conference on Computing Education · doi:10.1145/3593342.3593349 · Cited by 13
Longest Gapped Repeats and Palindromes
Dumitran, M., Gawrychowski, P., & Manea, F. (2017) · Discrete Mathematics & Theoretical Computer Science · doi:10.23638/dmtcs-19-4-4 · Cited by 11
Metadata
- Authors
- Odeh, R. E., & Knuth, D. E.
- Venue
- Journal of the American Statistical Association
- Publisher
- JSTOR
- Published
- 1969-03
- Volume
- 64
- Issue
- 325
- Pages
- 401
- ISSN
- 0162-1459 (ISSN-L)
- OpenAlex
- W1993449345
- Cited by
- 2,525
- References
- 0
- FWCI
- 20.82
- 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.