Publications: Donald E. Knuth

← Back to Author Profile

  • Affiliation: Stanford University
  • Author ID: t0yrrzQAAAAJ
  • Cited publications: 516

Download CSV for Donald E. Knuth

Title Year Citations Score
The art of computer programming
Pearson Education, 1997
View on Google Scholar ↗
1997 57003 100.0%
Art of computer programming, volume 2: Seminumerical algorithms
Addison-Wesley Professional, 2014
View on Google Scholar ↗
2014 20612 100.0%
Concrete mathematics: a foundation for computer science
Computers in Physics 3 (5), 106-107, 1989
View on Google Scholar ↗
1989 10065 99.9%
On the LambertW function
Advances in Computational mathematics 5, 329-359, 1996
View on Google Scholar ↗
1996 7560 99.8%
Fast pattern matching in strings
SIAM journal on computing 6 (2), 323-350, 1977
View on Google Scholar ↗
1977 4566 99.6%
Semantics of context-free languages
Mathematical systems theory 2 (2), 127-145, 1968
View on Google Scholar ↗
1968 3133 99.5%
Literate programming
The computer journal 27 (2), 97-111, 1984
View on Google Scholar ↗
1984 2951 99.5%
The art of computer programming, 2 (Seminumerical Algorithms)
The Art of Computer Programming, 1969
View on Google Scholar ↗
1981 2659 99.4%
The texbook
Addison-Wesley, 1986
View on Google Scholar ↗
1986 3053 99.3%
The art of computer programming, volume 4A: combinatorial algorithms, part 1
Pearson Education India, 2011
View on Google Scholar ↗
2011 1835 99.2%
Seminumerical algorithms
The art of computer programming 2, 1981
View on Google Scholar ↗
1981 2205 99.2%
Simple word problems in universal algebras
Automation of Reasoning: 2: Classical Papers on Computational Logic 1967 …, 1983
View on Google Scholar ↗
1983 2578 99.0%
On the translation of languages from left to right
Information and control 8 (6), 607-639, 1965
View on Google Scholar ↗
1965 1248 98.9%
The Stanford GraphBase: a platform for combinatorial computing
AcM Press, 1993
View on Google Scholar ↗
1993 1486 98.6%
An analysis of alpha-beta pruning
Artificial intelligence 6 (4), 293-326, 1975
View on Google Scholar ↗
1975 1461 98.5%
An empirical study of FORTRAN programs
Software: Practice and experience 1 (2), 105-133, 1971
View on Google Scholar ↗
1971 1075 98.5%
Permutations, matrices, and generalized Young tableaux
Pacific journal of mathematics 34 (3), 709-727, 1970
View on Google Scholar ↗
1970 984 98.4%
Structured Programming with go to Statements
ACM Computing Surveys (CSUR) 6 (4), 261-301, 1974
View on Google Scholar ↗
1974 1183 97.9%
Big omicron and big omega and big theta
ACM Sigact News 8 (2), 18-24, 1976
View on Google Scholar ↗
1976 899 97.3%
Randomized incremental construction of Delaunay and Voronoi diagrams
Algorithmica 7 (1-6), 381-413, 1992
View on Google Scholar ↗
1992 935 97.1%
Optimum binary search trees
Acta informatica 1, 14-25, 1971
View on Google Scholar ↗
1971 635 96.9%
Marriages stables
Technical report, 1976
View on Google Scholar ↗
1976 761 96.9%
Sorting and searching
The art of computer programming 3, 1998
View on Google Scholar ↗
1998 863 96.5%
The METAFONT book
Addison-Wesley Longman Publishing Co., Inc., 1989
View on Google Scholar ↗
1989 641 96.4%
Estimating the efficiency of backtrack programs
Mathematics of computation 29 (129), 122-136, 1975
View on Google Scholar ↗
1975 543 96.3%
Mathematics for the Analysis of Algorithms
Birkhäuser, 1990
View on Google Scholar ↗
1990 683 96.2%
The Art of Computer Programming: Fundamental Algorithms, volume 1
Addison-Wesley Professional, 1997
View on Google Scholar ↗
1997 786 96.2%
Dynamic huffman coding
Journal of algorithms 6 (2), 163-180, 1985
View on Google Scholar ↗
1985 716 96.2%
Finite semifields and projective planes
California Institute of Technology, 1963
View on Google Scholar ↗
1963 362 96.0%
Two notes on notation
The American Mathematical Monthly 99 (5), 403-422, 1992
View on Google Scholar ↗
1992 640 95.5%
The birth of the giant component
Random Structures & Algorithms 4 (3), 233-358, 1993
View on Google Scholar ↗
1993 525 94.7%
The art of computer programming
Addison-Wesley, 1973
View on Google Scholar ↗
1973 373 94.4%
Digital halftones by dot diffusion
ACM Transactions on Graphics (TOG) 6 (4), 245-273, 1987
View on Google Scholar ↗
1987 454 94.4%
The complexity of nonuniform random number generation
Algorithm and Complexity, New Directions and Results, 1976
View on Google Scholar ↗
1976 422 94.0%
Complexity results for bandwidth minimization
SIAM Journal on Applied Mathematics 34 (3), 477-495, 1978
View on Google Scholar ↗
1978 406 94.0%
Backus normal form vs. backus naur form
Communications of the ACM 7 (12), 735-736, 1964
View on Google Scholar ↗
1964 348 93.9%
The art of computer programming, Volume III: Sorting and searching
Addison-Wesley series in computer science Show all parts in this series, 1973
View on Google Scholar ↗
1973 336 93.8%
A generalization of Dijkstra's algorithm
Information Processing Letters 6 (1), 1-5, 1977
View on Google Scholar ↗
1977 387 93.7%
Breaking paragraphs into lines
Software: Practice and Experience 11 (11), 1119-1184, 1981
View on Google Scholar ↗
1981 396 93.7%
TEX and METAFONT: New directions in typesetting
American Mathematical Society, 1979
View on Google Scholar ↗
1979 390 93.6%
0. Patashnik, Concrete Mathematics
A Foundation for Computer Science 104, 1989
View on Google Scholar ↗
1989 386 93.1%
Computer science and its relation to mathematics
The American Mathematical Monthly 81 (4), 323-343, 1974
View on Google Scholar ↗
1974 326 93.0%
Surreal numbers: how two ex-students turned on to pure mathematics and found total happiness: a mathematical novelette
(No Title), 1974
View on Google Scholar ↗
1974 326 93.0%
Simple word problems in universal algebras. Computational Problems in Abstract Algebra
Leech, J.(ed.), 263-297, 1970
View on Google Scholar ↗
1970 247 92.9%
Efficient balanced codes
IEEE transactions on information theory 32 (1), 51-53, 1986
View on Google Scholar ↗
1986 392 92.9%
Additional comments on a problem in concurrent programming control
Communications of the ACM 9 (5), 321-322, 1966
View on Google Scholar ↗
1966 266 92.9%
The sandwich theorem
arXiv preprint math/9312214, 1993
View on Google Scholar ↗
1993 402 92.9%
Semantics of context-free languages: Correction
Mathematical systems theory 5, 95-96, 1971
View on Google Scholar ↗
1971 269 92.8%
TEX: the Program
Reading: Addison-Wesley, 1984
View on Google Scholar ↗
1984 337 92.7%
Computer-drawn flowcharts
Communications of the ACM 6 (9), 555-563, 1963
View on Google Scholar ↗
1963 165 92.5%
Axioms and hulls
Springer Berlin Heidelberg, 1992
View on Google Scholar ↗
1992 368 91.9%
A imaginary number system
Communications of the ACM 3 (4), 245-247, 1960
View on Google Scholar ↗
1960 148 91.8%
Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms
American Mathematical Soc., 1997
View on Google Scholar ↗
1997 384 91.3%
Enumeration of plane partitions
Journal of Combinatorial Theory, Series A 13 (1), 40-54, 1972
View on Google Scholar ↗
1972 262 91.2%
The average height of planted plane trees
Graph theory and computing, 15-22, 1972
View on Google Scholar ↗
1972 256 91.1%
Computers & Typesetting
Addison-Wesley, 1986
View on Google Scholar ↗
1986 314 91.0%
Sorting and searching
(No Title), 2015
View on Google Scholar ↗
2015 225 90.7%
Top-down syntax analysis
Acta Informatica 1, 79-110, 1971
View on Google Scholar ↗
1971 197 90.0%
Dancing links
arXiv preprint cs/0011047, 2000
View on Google Scholar ↗
2000 381 90.0%
Mathematics and Computer Science: Coping with Finiteness: Advances in our ability to compute are bringing us substantially closer to ultimate limitations.
Science 194 (4271), 1235-1242, 1976
View on Google Scholar ↗
1976 251 89.8%
Mathematical analysis of algorithms
Computer Science Department, 1971
View on Google Scholar ↗
1971 184 89.3%
The errors of tex
Software: Practice and Experience 19 (7), 607-685, 1989
View on Google Scholar ↗
1989 261 89.1%
Computation of tangent, Euler, and Bernoulli numbers
Mathematics of Computation 21 (100), 663-688, 1967
View on Google Scholar ↗
1967 143 88.5%
Number representations and dragon curves
Journal of recreational Mathematics 3 (2), 66-81, 1970
View on Google Scholar ↗
1970 156 88.3%
The early development of programming languages
A history of computing in the twentieth century, 197-273, 1980
View on Google Scholar ↗
1980 206 88.1%
Notes on avoiding “go to” statements
Information processing letters 1 (1), 23-31, 1971
View on Google Scholar ↗
1971 161 88.1%
A sequence of series for the Lambert W function
Proceedings of the 1997 international symposium on Symbolic and algebraic …, 1997
View on Google Scholar ↗
1997 278 87.9%
The computer as master mind
Journal of Recreational Mathematics 9 (1), 1-6, 1976
View on Google Scholar ↗
1976 213 87.7%
Ancient babylonian algorithms
Communications of the ACM 15 (7), 671-677, 1972
View on Google Scholar ↗
1972 169 87.5%
Mathematical writing
Cambridge University Press, 1989
View on Google Scholar ↗
1989 224 87.5%
Algorithmic thinking and mathematical thinking
The American Mathematical Monthly 92 (3), 170-181, 1985
View on Google Scholar ↗
1985 218 87.3%
The problem of compatible representatives
SIAM Journal on Discrete Mathematics 5 (3), 422-427, 1992
View on Google Scholar ↗
1992 235 87.1%
Analysis of a simple factorization algorithm
Theoretical Computer Science 3 (3), 321-348, 1976
View on Google Scholar ↗
1976 200 87.1%
SOLߞA Symbolic Language for General-Purpose Systems Simulation
IEEE transactions on electronic computers, 401-408, 1964
View on Google Scholar ↗
1964 113 86.4%
METAFONT: the program
Addison-Wesley Longman Publishing Co., Inc., 1986
View on Google Scholar ↗
1986 192 85.8%
Johann Faulhaber and sums of powers
Mathematics of Computation 61 (203), 277-294, 1993
View on Google Scholar ↗
1993 200 85.5%
Lambert’s W function in Maple
Maple Technical Newsletter 9 (1), 12-22, 1993
View on Google Scholar ↗
1993 200 85.5%
The art of computer programming
Massachusetts: Addison-Wesley 3, 1973
View on Google Scholar ↗
1973 146 85.4%
The analysis of algorithms
Actes du Congres International des Mathématiciens (Nice, 1970) 3, 269-274, 1970
View on Google Scholar ↗
1970 123 85.4%
Digital typography
Csli Publications, 1999
View on Google Scholar ↗
1999 242 85.2%
The art of computer programming
Sorting and searching 3 (426-458), 4, 1999
View on Google Scholar ↗
1999 238 84.9%
Mathematical typography
Bulletin of the American Mathematical Society 1 (2), 337-372, 1979
View on Google Scholar ↗
1979 160 84.6%
Computer modern typefaces
Addison-Wesley Longman Publishing Co., Inc., 1986
View on Google Scholar ↗
1986 171 84.5%
Euler’s constant to 1271 places
Mathematics of Computation 16 (79), 275-281, 1962
View on Google Scholar ↗
1962 69 84.3%
A structured program to generate all topological sorting arrangements
Information Processing Letters 2 (6), 153-157, 1974
View on Google Scholar ↗
1974 135 84.2%
The art of computer programming, 2nd edn. Sorting and searching, vol. 3
Addison-Wesley, Reading, 1998
View on Google Scholar ↗
1998 213 83.9%
The CWEB system of structured documentation: version 3.0
Addison-Wesley Longman Publishing Co., Inc., 1994
View on Google Scholar ↗
1994 189 83.9%
Selected combinatorial research problems
Computer Science Department, Stanford University, 1972
View on Google Scholar ↗
1972 127 83.8%
The Art of Programming, vol. 2, Semi-Numerical Algorithms
Addison Wesley, Reading, MA, 1981
View on Google Scholar ↗
1981 152 83.7%
Von Neumann's first computer program
ACM Computing Surveys (CSUR) 2 (4), 247-260, 1970
View on Google Scholar ↗
1970 103 83.1%
Postscript about NP-hard problems
ACM SIGACT News 6 (2), 15-16, 1974
View on Google Scholar ↗
1974 124 83.1%
A characterization of parenthesis languages
Information and Control 11 (3), 269-289, 1967
View on Google Scholar ↗
1967 102 82.9%
The WEB system of structured documentation
Department of Computer Science, Stanford University, 1983
View on Google Scholar ↗
1983 142 82.7%
Ordered hash tables
The Computer Journal 17 (2), 135-142, 1974
View on Google Scholar ↗
1974 117 82.2%
The remaining trouble spots in ALGOL 60
Communications of the ACM 10 (10), 611-618, 1967
View on Google Scholar ↗
1967 94 81.7%
Optimal measurement points for program frequency counts
BIT Numerical Mathematics 13 (3), 313-322, 1973
View on Google Scholar ↗
1973 109 81.4%
ALGOL 60 confidential
Communications of the ACM 4 (6), 268-272, 1961
View on Google Scholar ↗
1961 49 81.1%
The first cycles in an evolving graph
Discrete Mathematics 75 (1-3), 167-215, 1989
View on Google Scholar ↗
1989 141 80.7%
The expected linearity of a simple equivalence algorithm
Theoretical Computer Science 6 (3), 281-315, 1978
View on Google Scholar ↗
1978 112 80.7%
The power of a prime that divides a generalized binomial coefficient.
Journal für die reine und angewandte Mathematik (Crelles Journal) 1989 (396 …, 1989
View on Google Scholar ↗
1989 139 80.5%
Subspaces, subsets, and partitions
Journal of Combinatorial Theory, Series A 10 (2), 178-180, 1971
View on Google Scholar ↗
1971 84 79.7%
A class of projective planes
Transactions of the American Mathematical Society 115, 541-549, 1965
View on Google Scholar ↗
1965 67 79.1%
Vol. 1: Fundamental Algorithms
The Art of Computer Programming. Addison-Wesley, Reading, Mass, 1968
View on Google Scholar ↗
1968 78 78.7%
Digital searching
The art of computer programming: sorting and searching. Volume 3, 1998
View on Google Scholar ↗
1998 153 78.7%
On methods of constructing sets of mutually orthogonal Latin squares using a computer. I
Technometrics 2 (4), 507-516, 1960
View on Google Scholar ↗
1960 59 78.6%
Section 5.2. 4: Sorting by merging
The Art of Computer Programming 3, 158-168, 1998
View on Google Scholar ↗
1998 152 78.6%
Evaluation of powers
Art of Computer Programming 2, 461-485, 1998
View on Google Scholar ↗
1998 148 78.1%
Evaluation of polynomials by computer
Communications of the ACM 5 (12), 595-599, 1962
View on Google Scholar ↗
1962 47 77.6%
Overlapping pfaffians
arXiv preprint math/9503234, 1995
View on Google Scholar ↗
1995 129 77.6%
Concrete mathematics: a foundation for computer science
Addison-Wesley, 2003
View on Google Scholar ↗
2003 152 77.3%
A trivial algorithm whose analysis isn't
Journal of computer and system sciences 16 (3), 301-322, 1978
View on Google Scholar ↗
1978 94 77.3%
Combinatorial analysis and computers
The American mathematical monthly 72 (sup2), 21-28, 1965
View on Google Scholar ↗
1965 56 77.2%
The genesis of attribute grammars
Attribute Grammars and their Applications: International Conference WAGA …, 2005
View on Google Scholar ↗
2005 141 77.2%
Algorithms and Complexity: New Directions and Recent Results, chapter The complexity of nonuniform random number generation
Academic Press, 1976
View on Google Scholar ↗
1976 92 77.1%
The asymptotic number of geometries
Journal of Combinatorial Theory, Series A 16 (3), 398-400, 1974
View on Google Scholar ↗
1974 83 76.7%
The Computers & Typesetting, Vol. A: The Texbook
Addison-Wesley Longman Publishing Co., Inc., 1986
View on Google Scholar ↗
1986 103 76.6%
Stable husbands
Random Structures & Algorithms 1 (1), 1-14, 1990
View on Google Scholar ↗
1990 112 76.4%
Analysis of the subtractive algorithm for greatest common divisors
Proceedings of the National Academy of Sciences 72 (12), 4720-4722, 1975
View on Google Scholar ↗
1975 86 76.2%
Notes on central groupoids
Journal of Combinatorial Theory 8 (4), 376-390, 1970
View on Google Scholar ↗
1970 59 76.0%
The average time for carry propagation
Indagationes Mathematicae (Proceedings) 81 (1), 238-242, 1978
View on Google Scholar ↗
1978 88 76.0%
Programming pearls: A literate program
Communications of the ACM 29 (6), 471-483, 1986
View on Google Scholar ↗
1986 97 75.4%
George Forsythe and the development of computer science
Communications of the ACM 15 (8), 721-726, 1972
View on Google Scholar ↗
1972 72 75.3%
Invited papers: History of writing compilers
Proceedings of the 1962 ACM national conference on Digest of technical …, 1962
View on Google Scholar ↗
1962 44 75.1%
The art ofcomputer programming
Seminumerical Algorithms 2, 1981
View on Google Scholar ↗
1981 86 74.8%
A formal definition of SOL
IEEE transactions on electronic computers, 409-414, 1964
View on Google Scholar ↗
1964 55 74.7%
Notes on generalized Dedekind sums
Computer Science Department, Stanford University, 1975
View on Google Scholar ↗
1975 76 74.2%
Deletions that preserve randomness
IEEE Transactions on Software Engineering, 351-359, 1977
View on Google Scholar ↗
1977 80 74.1%
Efficient representation of perm groups
Combinatorica 11 (1), 33-43, 1991
View on Google Scholar ↗
1991 97 73.9%
The art of computer programming: Combinatorial algorithms
Addison-Wesley Professional, 2022
View on Google Scholar ↗
2022 20 73.4%
A note on solid partitions
Mathematics of computation 24 (112), 955-961, 1970
View on Google Scholar ↗
1970 49 73.2%
A proposal for input-output conventions in ALGOL 60
Communications of the ACM 7 (5), 273-283, 1964
View on Google Scholar ↗
1964 51 73.1%
Patashnik
Concrete Mathematics-A Foundation for Computer Science, 1989
View on Google Scholar ↗
1989 89 72.8%
Notes on “open” addressing
Unpublished memorandum, 11-97, 1963
View on Google Scholar ↗
1963 38 72.5%
Algorithms
Scientific American 236 (4), 63-81, 1977
View on Google Scholar ↗
1977 73 72.2%
Convolution polynomials
arXiv preprint math/9207221, 1992
View on Google Scholar ↗
1992 87 71.4%
A recurrence related to trees
Proceedings of the American Mathematical Society 105 (2), 335-349, 1989
View on Google Scholar ↗
1989 82 71.2%
The Art of
Computer programming 2, 1973
View on Google Scholar ↗
1973 59 70.9%
Combinatorial Algorithms, Part 1, volume 4A of The Art of Computer Programming
A ddison-W esley P rofessional 2 (0), 1, 2011
View on Google Scholar ↗
2011 88 70.7%
Semantics of context-free languages
Corrections 5 (1), 95-96, 1971
View on Google Scholar ↗
1971 49 70.5%
On the Lambert W function
Adv. Comput. Math 5 (1), 329-359, 1996
View on Google Scholar ↗
1996 90 70.0%
The art of computer
Seminumercial Algorithms 2, 268-278, 1969
View on Google Scholar ↗
1969 44 69.9%
The Art of Computer Programming Vol. 2: Seminumerical Methods
Addison-Wesley, Reading, Mass, 1981
View on Google Scholar ↗
1981 68 69.9%
Oriented subtrees of an arc digraph
Journal of Combinatorial Theory 3 (4), 309-314, 1967
View on Google Scholar ↗
1967 45 69.3%
The average height of planted plane trees. Graph theory and computing
Academic Press, New York, 1972
View on Google Scholar ↗
1972 54 69.3%
The art of computer programming 1: Fundamental algorithms 2: Seminumerical algorithms 3: Sorting and searching
MA: Addison-Wesley 30, 1968
View on Google Scholar ↗
1968 46 69.2%
Deciphering a linear congruential encryption
IEEE Transactions on Information Theory 31 (1), 49-52, 1985
View on Google Scholar ↗
1985 71 69.2%
Nested satisfiability
Acta Informatica 28, 1-6, 1990
View on Google Scholar ↗
1990 72 68.0%
Algorithms in modern mathematics and computer science
Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench …, 2005
View on Google Scholar ↗
2005 89 67.9%
A terminological proposal
ACM SIGACT News 6 (1), 12-18, 1974
View on Google Scholar ↗
1974 51 67.9%
Algorithm and program; information and data
Communications of the ACM 9 (9), 654, 1966
View on Google Scholar ↗
1966 38 67.4%
An almost linear recurrence
Fibonacci Quart 4, 117-128, 1966
View on Google Scholar ↗
1966 38 67.4%
TheArtofComputerProgramming
Addison-Wesley 1, 973, 1968
View on Google Scholar ↗
1968 40 67.2%
Matematyka konkretna
Wydaw. Naukowe PWN, 2002
View on Google Scholar ↗
2002 85 65.9%
The Art of Computer Programming: Seminumerical Analysis
Addison-Wesley, 1973
View on Google Scholar ↗
1973 45 65.7%
Things a computer scientist rarely talks about
Csli Publications, 2001
View on Google Scholar ↗
2001 83 65.7%
A programming and problem-solving seminar
Department of Computer Science, Stanford University, 1977
View on Google Scholar ↗
1977 52 65.5%
Linear probing and graphs
Algorithmica 22, 561-568, 1998
View on Google Scholar ↗
1998 75 65.4%
Examples of formal semantics
Symposium on semantics of algorithmic languages, 212-235, 2006
View on Google Scholar ↗
2006 78 65.4%
Fibonacci multiplication
Appl. Math. Lett 1 (2), 3, 1988
View on Google Scholar ↗
1988 64 65.3%
Programming language for automata
Journal of the ACM (JACM) 14 (4), 615-635, 1967
View on Google Scholar ↗
1967 35 65.1%
Construction of a random sequence
View on Google Scholar ↗
1965 28 65.1%
Recurrence relations based on minimization
Journal of Mathematical Analysis and Applications 48 (2), 534-559, 1974
View on Google Scholar ↗
1974 45 65.1%
Computer Science and Mathematics: How a new discipline presently interacts with an old one, and what we may expect in the future
American Scientist 61 (6), 707-713, 1973
View on Google Scholar ↗
1973 43 64.6%
Mixing rightto-left texts with left-to-right texts
TUGboat 8 (1), 14, 1987
View on Google Scholar ↗
1987 57 64.5%
Minimizing drum latency time
Journal of the ACM (JACM) 8 (2), 119-150, 1961
View on Google Scholar ↗
1961 19 64.3%
The stanford graphbase: a platform for combinatorial algorithms
Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms …, 1993
View on Google Scholar ↗
1993 60 64.1%
A permanent inequality
The American Mathematical Monthly 88 (10), 731-740, 1981
View on Google Scholar ↗
1981 51 64.1%
Verification of link-level protocols
BIT Numerical Mathematics 21 (1), 31-36, 1981
View on Google Scholar ↗
1981 50 63.7%
Virtual fonts: more fun for grand wizards
TUGboat 11 (1), 13-23, 1990
View on Google Scholar ↗
1990 55 62.8%
The Art of Computer Programming, vol. 2 Reading
MA: Addison-Wesley, 1973
View on Google Scholar ↗
1973 40 62.6%
Inhomogeneous sorting
International Journal of Computer & Information Sciences 8, 255-260, 1979
View on Google Scholar ↗
1979 48 62.5%
The art of computer programming, 2: seminumerical algorithms, Addision Wesley
Reading, MA, 1998
View on Google Scholar ↗
1998 62 61.6%
Length of strings for a merge sort
Communications of the ACM 6 (11), 685-688, 1963
View on Google Scholar ↗
1963 21 61.6%
Wheels within wheels
Journal of Combinatorial Theory, Series B 16 (1), 42-46, 1974
View on Google Scholar ↗
1974 35 61.1%
Runcible—algebraic translation on a limited computer
Communications of the ACM 2 (11), 18-21, 1959
View on Google Scholar ↗
1959 20 61.0%
Random numbers
The art of computer programming 2, chater 3, 1981
View on Google Scholar ↗
1981 44 60.9%
The art of computer programming, vol 1: Fundamental
Algorithms. Reading, MA: Addison-Wesley, 1968
View on Google Scholar ↗
1968 30 60.5%
An analysis of optimum caching
Journal of Algorithms 6 (2), 181-199, 1985
View on Google Scholar ↗
1985 46 60.3%
Correction: Semantics of context-free languages
Mathematical Systems Theory 5 (1), 95-96, 1971
View on Google Scholar ↗
1971 29 60.2%
SMALGOL-61
Communications of the ACM 4 (11), 499-502, 1961
View on Google Scholar ↗
1961 17 60.1%
Activity in an interleaved memory
IEEE Transactions on Computers 24 (09), 943-944, 1975
View on Google Scholar ↗
1975 36 59.8%
Supernatural numbers
The mathematical gardner, 310-325, 1981
View on Google Scholar ↗
1981 41 59.1%
Random number generator
US Patent 3,548,174, 1970
View on Google Scholar ↗
1970 24 58.7%
The Art of Computer Programming: Semi
Numerical Algorithms 2, 192, 1997
View on Google Scholar ↗
1997 54 58.5%
Tau Epsilon Chi, a system for technical text
(No Title), 1979
View on Google Scholar ↗
1979 38 58.4%
An exact analysis of stable allocation
Journal of Algorithms 20 (2), 431-442, 1996
View on Google Scholar ↗
1996 49 58.3%
Textbook examples of recursion
Artificial Intelligence and Mathematical Theory of Computation. Papers in …, 1991
View on Google Scholar ↗
1991 43 58.0%
Iskusstvo programmirovaniâ dlâ EVM
Mir, 1976
View on Google Scholar ↗
1976 35 57.8%
The bose-nelson sorting problem
A survey of combinatorial theory, 163-172, 1973
View on Google Scholar ↗
1973 32 57.8%
Retrieval on secondary keys
The art of computer programming: Sorting and Searching 3, 550-567, 1997
View on Google Scholar ↗
1997 52 57.8%
Another enumeration of trees
Canadian Journal of Mathematics 20, 1077-1086, 1968
View on Google Scholar ↗
1968 26 57.5%
Evading the drift in floating-point addition
Information Processing Letters 3 (3), 84-87, 1975
View on Google Scholar ↗
1975 32 57.2%
A note on strategy elimination in bimatrix games
Operations Research Letters 7 (3), 103-107, 1988
View on Google Scholar ↗
1988 42 57.2%
Algoritmos fundamentales
Reverté, 2021
View on Google Scholar ↗
2021 17 57.1%
The linear congruential method
The Art of Computer Programming 2, 10-26, 1997
View on Google Scholar ↗
1997 50 57.0%
Complements and transitive closures.
Discret. Math. 2 (1), 17-29, 1972
View on Google Scholar ↗
1972 28 56.9%
MMIXware: a RISC computer for the third millennium
Springer Science & Business Media, 1999
View on Google Scholar ↗
1999 51 56.8%
The complexity of songs
Communications of the ACM 27 (4), 344-346, 1984
View on Google Scholar ↗
1984 35 56.7%
On methods of constructing sets of mutually orthogonal Latin squares using a computer. II
Technometrics 3 (1), 111-117, 1961
View on Google Scholar ↗
1961 14 56.3%
Selected papers on analysis of algorithms
CSLI Publications, 2000
View on Google Scholar ↗
2000 52 56.0%
Matroid partitioning
Computer Science Department, Stanford University, 1973
View on Google Scholar ↗
1973 29 56.0%
The calculation of Easter…
Communications of the ACM 5 (4), 209-210, 1962
View on Google Scholar ↗
1962 13 55.6%
Knuth, Permutations, matrices, and generalized Young tableaux, Pacific J
Math. 34, 709-727, 1970
View on Google Scholar ↗
1970 19 55.0%
The art of computer programming: Fascicles 0-4
Addison-Wesley Professional, 2009
View on Google Scholar ↗
2009 46 54.6%
Random matroids
Discrete Mathematics 12 (4), 341-358, 1975
View on Google Scholar ↗
1975 28 54.5%
The Art of Computer Programming, vol. 2, series in computer science and information processing
Reading, Mass.: Addison-Wesley, 1981
View on Google Scholar ↗
1981 32 54.5%
Typesetting concrete mathematics
TUGboat 10 (1), 31-36, 1989
View on Google Scholar ↗
1989 34 53.8%
Sztuka programowania: Sortowanie i wyszukiwanie
Wydawnictwa Naukowo-Techniczne, 2002
View on Google Scholar ↗
2002 46 53.8%
Tratat de programarea calculatoarelor
Editura Tehnică, 1974
View on Google Scholar ↗
1974 23 53.6%
Concrete Mathematics, AddisonWesley
Reading, MA, 1994
View on Google Scholar ↗
1994 38 53.4%
Semi-optimal bases for linear dependencies
Linear and Multilinear Algebra 17 (1), 1-4, 1985
View on Google Scholar ↗
1985 32 53.2%
Introduction to combinatorial algorithms and Boolean functions
(No Title), 2009
View on Google Scholar ↗
2009 43 53.1%
Selected papers on computer science
Cambridge University Press, 1996
View on Google Scholar ↗
1996 37 53.0%
A torture test for TEX
Department of Computer Science, Stanford University, 1984
View on Google Scholar ↗
1984 29 53.0%
The state of the art of computer programming
Computer Science Department School of Humanities and Sciences, Stanford …, 1976
View on Google Scholar ↗
1976 27 52.8%
Rice, The average height of planted plane trees, Graph theory and computing
Academic Press, New York, 1972
View on Google Scholar ↗
1972 23 52.8%
Lessons learned from Metafont
Visible Language 19 (1), 35, 1985
View on Google Scholar ↗
1985 31 52.5%
A Review of" Structured Programming"
Computer Science Department, Stanford University, 1973
View on Google Scholar ↗
1973 23 51.7%
Addition machines
SIAM Journal on Computing 19 (2), 329-340, 1990
View on Google Scholar ↗
1990 31 51.6%
Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench, Uzbek SSR September 16–22, 1979
Springer Berlin Heidelberg, 1981
View on Google Scholar ↗
1981 26 50.7%
Sur l'inversion de yαey au moyen des nombres de Stirling associés
Comptes rendus de l'Académie des sciences. Série 1, Mathématique 320 (12 …, 1995
View on Google Scholar ↗
1995 32 50.3%
El arte de programar ordenadores
Reverté, 1980
View on Google Scholar ↗
1980 23 50.1%
The toilet paper problem
The American Mathematical Monthly 91 (8), 465-470, 1984
View on Google Scholar ↗
1984 25 50.1%
METAFONT, a system for alphabet design
Computer Science Department, Stanford University, 1979
View on Google Scholar ↗
1979 25 50.0%
Huffman's algorithm via algebra
Journal of Combinatorial Theory, Series A 32 (2), 216-224, 1982
View on Google Scholar ↗
1982 26 50.0%
The Art of Computer Programming, Volume 1: Fundamental Algorithms.-3rd
Addison-Wesley, 1997
View on Google Scholar ↗
1997 34 49.7%
Matemática concreta: fundamentos para a ciência da computação
LTC, 1995
View on Google Scholar ↗
1995 30 49.1%
Duality in addition chains
Bulletin of the European Association for Theoretical Computer Science 13 (2 …, 1981
View on Google Scholar ↗
1981 23 48.5%
Programming pearls: literate programming
Communications of the ACM 29 (5), 384-369, 1986
View on Google Scholar ↗
1986 23 48.0%
The Art of Computer Programming: Basic Algorithms (Vol. 1)
Addison-Wesley, London, 1969
View on Google Scholar ↗
1969 13 47.9%
The distribution of continued fraction approximations
Journal of Number Theory 19 (3), 443-448, 1984
View on Google Scholar ↗
1984 22 47.8%
3: 16 Bible texts illuminated
AR Editions, Inc., 1991
View on Google Scholar ↗
1991 26 47.7%
The Art of Computer Programming, volume 2. AddisonWesley
Reading, MA, 1973
View on Google Scholar ↗
1973 18 47.5%
The Art of Computer Programming: Sorting and Searching, Addison-Wesley
Reading, MA, 1973
View on Google Scholar ↗
1973 18 47.5%
All questions answered
Notices of the AMS 49 (3), 318-324, 2002
View on Google Scholar ↗
2002 32 47.1%
A short proof of Darboux's lemma
Applied Mathematics Letters 2 (4), iii-iv, 1989
View on Google Scholar ↗
1989 24 47.0%
Seminumerical algorithm (arithmetic)
The art of computer programming 2, 1969
View on Google Scholar ↗
1969 12 46.6%
Seminumerical algorithms
The Art of Computer Programming 2, 351-354, 1969
View on Google Scholar ↗
1969 12 46.6%
The art of computer programming: generating all tuples and permutations
Addison-Wesley., 2005
View on Google Scholar ↗
2005 31 46.5%
Advances in Comp
Math 5, 329, 1996
View on Google Scholar ↗
1996 25 45.9%
Concrete mathematics Addison
Reading, MA 2, 1994
View on Google Scholar ↗
1994 25 45.7%
The art of computer programming, vol. 3: sorting and searching
Mathematics of Computation 28 (128), 1175-1180, 1974
View on Google Scholar ↗
1974 15 45.3%
The letter S
Computer Science Department, Stanford University, 1980
View on Google Scholar ↗
1980 17 45.0%
The IBM 650: An appreciation from the field
IEEE Annals of the History of Computing 8 (01), 50-55, 1986
View on Google Scholar ↗
1986 19 44.5%
A Fibonacci-like sequence of composite numbers
Mathematics Magazine 63 (1), 21-25, 1990
View on Google Scholar ↗
1990 21 44.5%
A simple program whose proof isn’t
Beauty is our business: a birthday salute to Edsger W. Dijkstra, 233-242, 1990
View on Google Scholar ↗
1990 21 44.5%
The Art of Computer Programming, 7 volumes (projected)
Reading, Mass.: Addison-Wesley, 1969
View on Google Scholar ↗
1969 11 44.3%
Selected papers on computer languages
CSLI Publications, 2002
View on Google Scholar ↗
2002 27 44.2%
Computation of tangent
Euler and Bernoulli, 1967
View on Google Scholar ↗
1967 10 43.9%
The art of computer programming, vol 3, 2nd edn. Sorting and searching
Addison Wesley Longman Publishing Co., Inc, Redwood City, 1998
View on Google Scholar ↗
1998 24 43.7%
A one-way, stackless quicksort algorithm
BIT Numerical Mathematics 26 (1), 127-130, 1986
View on Google Scholar ↗
1986 18 43.5%
Sequences with precisely k+ 1 k-blocks, Solution to problem E2307
Amer. Math. Monthly 79, 773-774, 1972
View on Google Scholar ↗
1972 14 43.4%
Optimal prepaging and font caching
ACM Transactions on Programming Languages and Systems (TOPLAS) 7 (1), 62-79, 1985
View on Google Scholar ↗
1985 19 43.1%
TEX: a system for technical text
American Mathematical Society, Providence, RI, 1979
View on Google Scholar ↗
1979 17 42.7%
The dangers of computer-science theory
Studies in Logic and the Foundations of Mathematics 74, 189-195, 1973
View on Google Scholar ↗
1973 14 42.6%
The complexity of songs
ACM SIGACT News 9 (2), 17-24, 1977
View on Google Scholar ↗
1977 15 41.8%
NegaFibonacci numbers and the hyperbolic plane
San Jose-Meeting of the Mathematical Association of America 5, 2008
View on Google Scholar ↗
2008 24 41.5%
Generating All Tuples and Permutations. The Art of Computer Programming, Vol. 4, Fascicle 2
Addison-Wesley, Reading, 2005
View on Google Scholar ↗
2005 23 41.3%
On the Lambert W function
Advances in Computational Mathematics 5 (1), 329-359, 1996
View on Google Scholar ↗
1996 18 40.5%
Aztec diamonds, checkerboard graphs, and spanning trees
arXiv preprint math/9501234, 1995
View on Google Scholar ↗
1995 18 40.4%
Tratat de programarea calculatoarelor: sortare şi căutare
Editura Tehnică, 1976
View on Google Scholar ↗
1976 13 40.4%
Notes on avoiding GO TO statements
Information processing letters 1, 23-31, 1971
View on Google Scholar ↗
1971 10 39.9%
Subsets, subspaces, and partitions
J. Combin. Theory 10, 178-180, 1971
View on Google Scholar ↗
1971 10 39.9%
Scaling and number base converting method and apparatus
US Patent 3,626,167, 1971
View on Google Scholar ↗
1971 10 39.9%
AMS Euler-A New Typeface for Mathematics
Scholarly Publishing 20 (3), 131-157, 1989
View on Google Scholar ↗
1989 16 39.5%
Sorting and searching (6. printing, newly updated and rev. ed.). Boston [ua]
Addison-Wesley, 2000
View on Google Scholar ↗
2000 20 39.4%
The Art of Computer Programming: Graph. Darst
Addison-Wesley, 1979
View on Google Scholar ↗
1979 14 39.4%
Shellsort with three increments
Random Structures & Algorithms 10 (1‐2), 125-142, 1997
View on Google Scholar ↗
1997 18 39.1%
The Art of Computer Programming, Vol. 2, 309, 316–332
Addison-Wesley, Reading, Massachusetts, 1969
View on Google Scholar ↗
1969 9 39.1%
Leaper graphs
The Mathematical Gazette 78 (483), 274-297, 1994
View on Google Scholar ↗
1994 17 38.9%
Context-Free Multilanguages.
Theoretical Studies in Computer Science, 1-13, 1992
View on Google Scholar ↗
1992 16 38.9%
Matematica discreta: principi matematici per l'informatica
Hoepli, 1992
View on Google Scholar ↗
1992 16 38.9%
计算机程序设计艺术: 排序与查找. 第 3 卷
国防工业出版社, 2002
View on Google Scholar ↗
2002 19 38.7%
Deciphering a linear congruential encryption
View on Google Scholar ↗
1980 12 38.6%
Arithmetik: Aus der Reihe The Art of Computer Programming
Springer-Verlag, 2013
View on Google Scholar ↗
2013 20 38.5%
The Art of Computer Programming: A Foundation for computer mathematics
Addison-Wesley Professional, 1973
View on Google Scholar ↗
1973 11 38.2%
Interview with Donald Knuth
Web page at http://www. informit. com/articles/article. aspx, 2010
View on Google Scholar ↗
2010 20 38.2%
Sorting and searching
The Art of Computer Programming 3 (3rd ed.). Addison-Wesley 5, 1997
View on Google Scholar ↗
1997 17 38.1%
An experiment in optimal sorting
Information Processing Letters 1 (4), 173-176, 1972
View on Google Scholar ↗
1972 10 38.0%
Dynamic storage allocation
View on Google Scholar ↗
1972 10 38.0%
Mariages Stables (Les Presses de l’Universite de Montreal, Montreal)
English translation:(1997) Stable Marriage and Its Relation to Other …, 1976
View on Google Scholar ↗
1976 11 37.9%
Identities from partition involutions
Computer Science Department, School of Humanities and Sciences, Stanford …, 1977
View on Google Scholar ↗
1977 12 37.9%
6581
The American Mathematical Monthly 97 (7), 626-630, 1990
View on Google Scholar ↗
1990 14 37.6%
On the Lambert W function
Advances in computational mathematics 5, 329-359, 1996
View on Google Scholar ↗
1996 15 37.5%
Knuth
Computer science and its relation to mathematics, 323-343, 1974
View on Google Scholar ↗
1974 10 37.5%
The Art of Computer Programming: Seminumerical algorithms. The Art of Computer Programming
Addison-Wesley Pub. Co, 1981
View on Google Scholar ↗
1981 12 37.3%
Mathématiques concrètes: fondations pour l'informatique
Inthernational Thomson Publ. France, 1998
View on Google Scholar ↗
1998 16 37.0%
The gnats and gnus document preparation system
G-Animal’s Journal 41 (7), 73, 1986
View on Google Scholar ↗
1986 12 36.8%
The triel: A new solution
J. Recreat. Math 6 (1), 1-7, 1973
View on Google Scholar ↗
1973 10 36.8%
Irredundant intervals
Journal of Experimental Algorithmics (JEA) 1, 1-es, 1996
View on Google Scholar ↗
1996 14 36.5%
On the Lambert W function
Advances in Computational Mathematics 5, 329-359, 1996
View on Google Scholar ↗
1996 14 36.5%
Polynomials involving the floor function
Mathematica Scandinavica, 194-200, 1995
View on Google Scholar ↗
1995 14 36.1%
Comparison of the sun-exposed and shaded side of apple fruit. I. Cuticle, epidermal cell size and surface waxes.
View on Google Scholar ↗
1987 12 36.1%
A Random Knockout Tournament (DE Knuth)
SIAM Review 29 (1), 127-129, 1987
View on Google Scholar ↗
1987 12 36.1%
计算机程序设计艺术: 英文版. 排序和查找. 第 3 卷
清华大学出版社, 2002
View on Google Scholar ↗
2002 16 36.0%
A számitógép-programozás müvészete
Műszaki Könyvkiadó, 2008
View on Google Scholar ↗
2008 17 35.8%
The TEXbook. 2 wyd. TA Computers and Wpiszsetting
Reading, Massachusetts: Addison-Wesley, 1984
View on Google Scholar ↗
1984 11 35.6%
How fast can we multiply
The Art of Computer Programming 2, 294-318, 1998
View on Google Scholar ↗
1998 14 35.0%
Two-way rounding
SIAM Journal on Discrete Mathematics 8 (2), 281-290, 1995
View on Google Scholar ↗
1995 13 35.0%
Lexicographic permutations with restrictions
Discrete Applied Mathematics 1 (1-2), 117-125, 1979
View on Google Scholar ↗
1979 11 35.0%
The birth of the giant component
arXiv preprint math.PR/9310236, 1993
View on Google Scholar ↗
1993 12 34.9%
The transistor considered harmful
Journal of Virtual, Interposable Models 43, 76-83, 2001
View on Google Scholar ↗
2001 14 34.8%
The Art of Computer Programming: Seminwnerical Algorithms
Computer Science and Information Processing. Addison-Wesley, Reading, MA, 1981
View on Google Scholar ↗
1981 10 34.6%
Binary decision diagrams
The Art of Computer Programming. Volume 4A: Combinatorial Algorithm, Part 1 …, 2011
View on Google Scholar ↗
2011 16 34.5%
Simple word problems in abstract algebra
Computational Problems in Abstract Algebra, 263-297, 1969
View on Google Scholar ↗
1969 7 34.3%
Mathematics and computer science: coping with finiteness
Mathematics: people, problems, results 2, 1984
View on Google Scholar ↗
1984 10 34.2%
An algorithm for Brownian zeroes
Computing 33 (1), 89-94, 1984
View on Google Scholar ↗
1984 10 34.2%
Computational problems in abstract algebra, chapter Simple word problems in universal algebra
Pergamon Press, 1970
View on Google Scholar ↗
1970 7 34.2%
Números surreales
Reverté, 1978
View on Google Scholar ↗
1978 9 34.1%
TEXware
Department of Computer Science, Stanford University, 1986
View on Google Scholar ↗
1986 10 33.8%
S. 0. Rice, The average height of planted plane trees
by Ronald C. Read, Academic Press, New York, 15-22, 1972
View on Google Scholar ↗
1972 8 33.8%
Fonts for digital halftones
TUGboat 8 (2), 135-160, 1987
View on Google Scholar ↗
1987 10 33.4%
Umění programování: 1. díl, Základní algoritmy
Vydání první. Brno: Computer Press as, 2008
View on Google Scholar ↗
2008 14 32.9%
The Art of Computing Programming, Volume III
Addisson-Wesley, 1973
View on Google Scholar ↗
1973 8 32.9%
Recounting the rationals, continued: 10906
The American Mathematical Monthly 110 (7), 642-643, 2003
View on Google Scholar ↗
2003 12 32.2%
Computer edit system
US Patent 3,454,929, 1969
View on Google Scholar ↗
1969 6 32.2%
The art of computer programming, vol. 2, chap. 4.6. 2
Addison WWesley, 1969
View on Google Scholar ↗
1969 6 32.2%
Digital computer having an indirect field length operation
US Patent 3,422,405, 1969
View on Google Scholar ↗
1969 6 32.2%
Seminumerical Algorithms, volume 2 of The Art of Computer Programming
Addison-Wesley, Reading, MA, 1969
View on Google Scholar ↗
1969 6 32.2%
Simple word problems in universal algebras, Computational Problems in Universal Algebras (J. Leech, ed.)
Pergamon Press, Oxford, 1969
View on Google Scholar ↗
1969 6 32.2%
Computer Musings: The associative law, or The anatomy of rotations in binary trees
University Video Communications, 1993
View on Google Scholar ↗
1993 10 32.1%
The Art of Computer Programming: Updates; Pre-Fascicle 2B, A Draft of Section 7.2. 1.2: Generating All Permutations
Addison-Wesley, 2002
View on Google Scholar ↗
2002 12 32.0%
Are toy problems useful
Popular Computing 5, 3-10, 1977
View on Google Scholar ↗
1977 8 31.6%
Serial isogons of 90 degrees
Mathematics Magazine 64 (5), 315-324, 1991
View on Google Scholar ↗
1991 10 31.5%
A list of the remaining trouble spots in ALGOL60
ALGOL Bulletin, 29-38, 1965
View on Google Scholar ↗
1965 5 31.5%
Controlling IPv7 using multimodal configurations
UIUC, Tech. Rep. 28-2307, 2001
View on Google Scholar ↗
2001 11 31.5%
Efficient coroutine generation of constrained gray sequences
From Object-Orientation to Formal Methods: Essays in Memory of Ole-Johan …, 2004
View on Google Scholar ↗
2004 12 31.4%
The Art of Computer Programming. Volume 1: Fundamental
Algorithms, 1968
View on Google Scholar ↗
1968 7 31.3%
Optimum binary search trees
Acta Informatica 1 (3), 270-270, 1972
View on Google Scholar ↗
1972 7 30.8%
TEX Przewodnik użytkownika
WNT, Warszawa, 2005
View on Google Scholar ↗
2005 11 30.5%
PB Bendix Simple Word Problems in Universal Algebra
Proc. Conf. on Computational Problems in Abstract Algebra, Oxford, 1967
View on Google Scholar ↗
1967 5 30.3%
Theory and practice, IV
Selected Papers on Computer Science, 129-139, 1996
View on Google Scholar ↗
1996 9 30.3%
Hashing
The art of computer programming 3, 506-549, 1973
View on Google Scholar ↗
1973 7 30.2%
Selected papers on fun & games
(No Title), 2011
View on Google Scholar ↗
2011 12 30.2%
Selected papers on discrete mathematics
(No Title), 2003
View on Google Scholar ↗
2003 10 29.8%
Umění programování
Computer Press, Albatros Media as, 2016
View on Google Scholar ↗
2016 11 29.4%
Bracket notation for thecoefficient of'operator
arXiv preprint math/9402216, 1994
View on Google Scholar ↗
1994 9 29.0%
Concrete Mathematics, second ediction
Addison-Wesley, 1994
View on Google Scholar ↗
1994 9 29.0%
Concrete Mathematics: a Foundation for Computer Science Reading
Massachusetts: Addison-Wesley, 1994
View on Google Scholar ↗
1994 9 29.0%
The art of computer programming Volume 2: Seminumerical Algorithms, [70–71]
Addison-Wesley, Reading, 1997
View on Google Scholar ↗
1997 9 28.9%
Sorting by Insertion
The art of computer programming 3, 80-105, 1998
View on Google Scholar ↗
1998 9 28.8%
Umění programování: Seminumerické algoritmy
Computer Press, 2010
View on Google Scholar ↗
2010 11 28.8%
The art of computer programming. Vol. 1: Fundamental algorithms.
Addison-Wesley Publishing Company Inc, 1968
View on Google Scholar ↗
1968 6 28.7%
Adv. in Comp. Math.
Adv. Comp. Math 5, 329, 1996
View on Google Scholar ↗
1996 8 28.6%
Robert w floyd, in memoriam
ACM SIGACT News 34 (4), 3-13, 2003
View on Google Scholar ↗
2003 9 28.5%
Elementary Problems: E3301-E3306
The American Mathematical Monthly 96 (1), 54-55, 1989
View on Google Scholar ↗
1989 8 28.3%
Sztuka programowania, t. 2
Wydawnictwo Naukowo-Techniczne, Warszawa, 2002
View on Google Scholar ↗
2002 9 28.2%
MIX: the design of a typical computer and its assembly language, with programming problems and a glossary of basic computer terminology
Addison Wesley Publishing Company, 1970
View on Google Scholar ↗
1970 5 28.0%
Clasificación y búsqueda
Reverté, 1986
View on Google Scholar ↗
1986 7 28.0%
11151
The American Mathematical Monthly 112 (4), 367-367, 2005
View on Google Scholar ↗
2005 9 28.0%
The Computer Modern family of typefaces
Department of Computer Science, Stanford University, 1980
View on Google Scholar ↗
1980 6 27.4%
Massachusetts
View on Google Scholar ↗
1973 6 27.4%
Mariages Stables. Les Presses de L’Université de Montréal (1976)
English translation in Stable Marriage and its Relation to Other …, 1976
View on Google Scholar ↗
1976 6 27.3%
VMariages Stables et leurs relations avec dnautres prob& lèmes combinatoiresV
Les Presses de lnUniversité Montréal, Montréal, 1976
View on Google Scholar ↗
1976 6 27.3%
Fascicle 6: Satisfiability, volume 19 of the art of computer programming
Addison-Wesley, Reading, Mass, 2015
View on Google Scholar ↗
2015 10 27.2%
Art of Computer Programming: Satisfiability, Volume 4, Fascicle 6
Addison-Wesley Professional, 2015
View on Google Scholar ↗
2015 10 27.2%
The Art of Computer Programming Second Edition, Vol Ⅲ
Addison Wesley, 1998
View on Google Scholar ↗
1998 8 27.2%
Sorting by merging. The art of computer programming
Sorting and Searching, 158-168, 1998
View on Google Scholar ↗
1998 8 27.2%
Sorting by Selection
The Art of Computer Programming 3, 138-141, 1997
View on Google Scholar ↗
1997 8 27.1%
Bottom-up education
Proceedings of the 8th annual conference on Innovation and technology in …, 2003
View on Google Scholar ↗
2003 8 27.0%
Le TEXbook: composition informatique
Vuibert informatique, 2003
View on Google Scholar ↗
2003 8 27.0%
Arta programării calculatoarelor
Teora, 1999
View on Google Scholar ↗
1999 8 26.9%
Let's not dumb down the history of computer science
Communications of the ACM 64 (2), 33-35, 2021
View on Google Scholar ↗
2021 5 26.8%
Arta programării calculatoarelor vol.
Tehnică–Bucureşti, 1977
View on Google Scholar ↗
1977 6 26.8%
A programming and problem-solving seminar
Department of Computer Science, Stanford University, 1983
View on Google Scholar ↗
1983 6 26.7%
The WEB System of Structured Documentation: Version 2.5
Stanford Univ., 1983
View on Google Scholar ↗
1983 6 26.7%
FundamentalAlgorithms, The Art of Computer Programming, Vol. 1
Addison-Wesley, Reading, Mass, 1968
View on Google Scholar ↗
1968 5 26.4%
Combinatorial algorithms
(No Title), 2005
View on Google Scholar ↗
2005 8 26.4%
The Art of Computer Programming (日本語版)
アスキー, 2004
View on Google Scholar ↗
2004 8 26.3%
Semantics of context-free languages 2 (2), 127-145, 1968
in: Mathematical System Theory 5 (1), 95-96, 1971
View on Google Scholar ↗
1971 5 26.2%
The art of computer programming: errata et addenda
Computer Science Department, Stanford University, 1971
View on Google Scholar ↗
1971 5 26.2%
The TEXbook
volume A de Computers and Typesetting. Addison-Wesley, Reading …, 1989
View on Google Scholar ↗
1989 7 26.2%
A Torture Test for TEX:(Version 1.3)
Stanford Univ., 1984
View on Google Scholar ↗
1984 6 26.1%
计算机程序恒计技巧第三卷排序和查拽
国防工业出版挂, 1984
View on Google Scholar ↗
1984 6 26.1%
METAFONT the Program
Addison-Wesley, Reading, Massachusetts, 1986
View on Google Scholar ↗
1986 6 25.8%
Computer Modern fonts
CTAN: cm, 1986
View on Google Scholar ↗
1986 6 25.8%
Optimal font caching
Department of Computer Science, Stanford University, 1982
View on Google Scholar ↗
1982 6 25.6%
Multiple Precision Arithmetic
The Art of Computer Programming: Combinatorial Algorithms, 268,269, 1998
View on Google Scholar ↗
1998 7 25.5%
Konkrét matematika: a számítástudomány alapja: tankönyv
Műszaki K., 1998
View on Google Scholar ↗
1998 7 25.5%
Knuth. Seminumerical Algorithms
vol. 2 of The Art of Computer Programming, 1998
View on Google Scholar ↗
1998 7 25.5%
Structured pqmmming with ‘go W statements, ACM Cornput
Surveys 6 (43), 261-302, 1974
View on Google Scholar ↗
1974 5 25.0%
The Gamow–Stern elevator problem
J. Recr. Math 2, 131-137, 1969
View on Google Scholar ↗
1969 4 24.7%
S. 0. Rice," The Average Height of Binary Trees and Other Simple Trees," pp, 15-22 in Graph Theory and Computing
Academic Press, New-York, 1972
View on Google Scholar ↗
1972 5 24.5%
Knuth, James H. Morris, and Vaughan R
Pratt. Fast pattern matching in strings. SIAM Journal on Computing 6 (2), 323, 1977
View on Google Scholar ↗
1977 5 24.4%
Fast string searching in strings
SIAM J. Comput 6 (2), 323-350, 1977
View on Google Scholar ↗
1977 5 24.4%
Morris
JH, and Pratt. VR Fast pattern matching in strings. SIAM\. Comput 6 (2), 323-350, 1977
View on Google Scholar ↗
1977 5 24.4%
Knuth-morris-pratt algorithm
SIAM Journal on Computing 6 (1), 323-350, 1977
View on Google Scholar ↗
1977 5 24.4%
The art of programming
Addison-Wesley Publishing Company, 1973
View on Google Scholar ↗
1973 5 24.3%
The Art of Computer Programming. Sorting and Searching, Section 6.2. 4, vol. 3
Addison-Wesley, Reading, 1973
View on Google Scholar ↗
1973 5 24.3%
The Art of Computer Programming
Addison-Wesley, 1973
View on Google Scholar ↗
1973 5 24.3%
CWEB user manual: The CWEB system of structured documentation
Stanford University, Department of Computer Science, 1990
View on Google Scholar ↗
1990 6 24.2%
The TEX tuneup of 2014
TUGboat [online], 5-8, 2014
View on Google Scholar ↗
2014 8 24.1%
Satisfiability and the art of computer programming
Theory and Applications of Satisfiability Testing–SAT 2012: 15th …, 2012
View on Google Scholar ↗
2012 8 24.1%
The Art of Programming: Sorting and Searching (Volume 3)
Addison-Wesley, Reading, MA, 1998
View on Google Scholar ↗
1998 6 23.7%
Le concept de métafonte
Communication & Langages 55 (1), 40-53, 1983
View on Google Scholar ↗
1983 5 23.6%
The Art of Computer Programming: Fundamental Algorithms. Massachusetts
Addison Wesley Longman, 1997
View on Google Scholar ↗
1997 6 23.4%
A course on Metafont programming
TUGboat 5 (2), 105-118, 1984
View on Google Scholar ↗
1984 5 23.3%
The TJjXbook, volume A of Computers and Typesetting
Addison-Wesley Publishing Company, Reading, Massachusetts, 1986
View on Google Scholar ↗
1986 5 23.1%
Selected papers on design of algorithms
Center for the Study of Language and Information/SRI, 2010
View on Google Scholar ↗
2010 7 23.1%
Computers & Typesetting, Volume B: TeX: The Program
Addison-Wesley Professional, 2021
View on Google Scholar ↗
2021 4 22.9%
A programming and problem-solving seminar
Stanford University, 1985
View on Google Scholar ↗
1985 5 21.8%
The birth of giant component
Random Structures and Algorithms 4, 233-358, 1993
View on Google Scholar ↗
1993 5 21.6%
Concrete Mathematics, Eighth Printing
Addison–Wesley, Reading, Massachusetts, 1989
View on Google Scholar ↗
1989 5 21.2%
Concrete mathematics,–Moscow,“
Mir”,–P 313, 1998
View on Google Scholar ↗
1998 5 21.2%
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation
ACM, 1997
View on Google Scholar ↗
1997 5 21.0%
Mmix
MMIXware: a RISC computer for the third millennium, 2-61, 1999
View on Google Scholar ↗
1999 5 21.0%
A case for evolutionary programming
Proceedings of SIGCOMM, 2004
View on Google Scholar ↗
2004 5 20.7%
Biographies-Robert W Floyd, in Memoriam
IEEE Annals of the History of Computing 26 (2), 75-83, 2004
View on Google Scholar ↗
2004 5 20.7%
10832
The American Mathematical Monthly 107 (9), 863-863, 2000
View on Google Scholar ↗
2000 5 20.6%
Satisfiability, Vol. 4, Fascicle 6 of The Art of Computer Programming
Addison-Wesley Professional, 2015
View on Google Scholar ↗
2015 6 20.6%
Twenty questions for donald knuth
Informit. com. Accessed 3, 2014
View on Google Scholar ↗
2014 6 20.5%
Tratat de programarea calculatoarelor: Algoritmi seminumerici
Editura Tehnică, 1983
View on Google Scholar ↗
1983 4 20.3%
Leaders in computing: Changing the digital world
BCS, The Chartered Institute, 2011
View on Google Scholar ↗
2011 5 19.5%
E3062
The American Mathematical Monthly 94 (4), 376-377, 1987
View on Google Scholar ↗
1987 4 19.4%
On Lambert’s
Adv. Comput. Math 5, 329-359, 1996
View on Google Scholar ↗
1996 4 18.8%
Seminumerical Algorithms, 25th print.; The art of computer programming
Addison-Wesley: Reading, Mass, 1996
View on Google Scholar ↗
1996 4 18.8%
Very magic squares
The American Mathematical Monthly 75 (3), 260-264, 1968
View on Google Scholar ↗
1968 3 18.7%
The Essential Knuth
Lonely Scholar, 2013
View on Google Scholar ↗
2013 5 18.7%
On numbers and games
Math. Soc. 84 (6), 1328-1336, 1978
View on Google Scholar ↗
1978 3 17.9%
A History of Computing in the Twentieth Century: A Collection of Essays
Academic Press, 1980
View on Google Scholar ↗
1980 3 17.7%
Computer science and mathematics
Mathematics: people, problems, results, 25-37, 1984
View on Google Scholar ↗
1984 3 16.8%
The TEXbook, chapter Appendix D
Addison–Wesley, 1984
View on Google Scholar ↗
1984 3 16.8%
The Texbook, by Donald E. Knuth
Addison-Wesley Publishing Company, 1984
View on Google Scholar ↗
1984 3 16.8%
History of binary and other nondecimal numeration: By Anton Glaser. Los Angeles, CA (Tomash Publishers). 1981. 218+ xiii pp
Historia mathematica 10 (2), 236-243, 1983
View on Google Scholar ↗
1983 3 16.8%
SAT11 and SAT11k
Proceedings of SAT Competition, 32, 2013
View on Google Scholar ↗
2013 4 16.5%
TEX: The
Lamport, L.: LaTeX–http://www. dante. de/http://www. tug. org, 1986
View on Google Scholar ↗
1986 3 16.4%
A programming and problem-solving seminar
Computer Science Department, Stanford University, 1979
View on Google Scholar ↗
1979 3 16.4%
Algorithmic Barriers Falling: P= NP?
Lonely Scholar; Geel, Belgium, 2014
View on Google Scholar ↗
2014 4 16.3%
Repaying our debts
Theoretical Foundations of Programming Methodology: Lecture Notes of an …, 1982
View on Google Scholar ↗
1982 3 16.0%
Knuth comments on code
BYTE 21 (9), 40-40, 1996
View on Google Scholar ↗
1996 3 15.7%
A Stirling series: 10832
The American Mathematical Monthly 108 (9), 877-878, 2001
View on Google Scholar ↗
2001 3 15.7%
Art of Computer Programming: MMIX-A RISC Computer for the New Millennium, Volume 1, Fascicle 1
Addison-Wesley Professional, 2005
View on Google Scholar ↗
2005 3 15.6%
Recipes and fractions
TUG-boat 6 (1), 36-38, 1985
View on Google Scholar ↗
1985 3 15.5%
Artistic Programming-a Citation-Classic Commentary on the Art of Computer-Programming, Vol 1, Fundamental Algorithms, Vol 2, Seminumerical Algorithms, Vol 3, Sorting and Searching by Knuth, DE
Current contents/engineering technology & applied sciences, 8-8, 1993
View on Google Scholar ↗
1993 3 15.3%
Stacks, Queues, and Deques
the Art of Computer Programming 1, 238-243, 1997
View on Google Scholar ↗
1997 3 15.2%
Binomial Identities
Mathematics for the Analysis of Algorithms, 1-10, 1990
View on Google Scholar ↗
1990 3 15.2%
A note on digitized angles
arXiv preprint cs/9301112, 1990
View on Google Scholar ↗
1990 3 15.2%
E3429
The American Mathematical Monthly 99 (7), 684-684, 1992
View on Google Scholar ↗
1992 3 15.2%
E3432
The American Mathematical Monthly 99 (7), 684-685, 1992
View on Google Scholar ↗
1992 3 15.2%
Section 5.2. 4: Sorting by merging
Sorting and Searching. The Art of Computer Programming 3, 158-168, 1998
View on Google Scholar ↗
1998 3 15.2%
A programming and problem solving seminar
Department of Computer Science, Stanford University, 1989
View on Google Scholar ↗
1989 3 14.8%
Evaluation of polynomials by computer
COMMUNICATIONS OF THE ACM 6 (2), 51-51, 1963
View on Google Scholar ↗
1963 2 14.1%
Structured programming with go to
Yourdon Press, 1974
View on Google Scholar ↗
1974 2 13.5%
The Art of Computer Programming (Vol. 3. Sortmg and Searching). Mass
Addison-Wesley, 1974
View on Google Scholar ↗
1974 2 13.5%
Elementary Problems: E2492-E2496
The American Mathematical Monthly 81 (8), 901-902, 1974
View on Google Scholar ↗
1974 2 13.5%
The Art of Computer Programming, (Addison-Wesley Series in Computer Science and Information
Addison-Wesley Longman Publishing Co., Inc., 1978
View on Google Scholar ↗
1978 2 13.4%
The Average Height of Plane Trees
View on Google Scholar ↗
1971 2 13.4%
A torture test for
Stanford Computer Science Report 1095, 78, 1984
View on Google Scholar ↗
1984 2 13.1%
Permutations with nonnegative partial sums
Discrete Mathematics 5 (4), 367-371, 1973
View on Google Scholar ↗
1973 2 12.7%
The art of computer programming. Volume 3, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills
Sorting and searching, Addison-Wesley Series in Computer Science and …, 1973
View on Google Scholar ↗
1973 2 12.7%
The Art of Computer Programming: Seminumerical Algorithms.-1981.-(RU-idnr: M104227155)
Addison-Wesley, 1973
View on Google Scholar ↗
1973 2 12.7%
The Art of Computer Programmhlg, Vol. 3
Sorting and Searching, 1973
View on Google Scholar ↗
1973 2 12.7%
A Programming and Problem-Solving Seminar
Department of Computer Science, Stanford University, 1983
View on Google Scholar ↗
1983 2 12.6%
A Test File for TeX.
View on Google Scholar ↗
1983 2 12.6%
SEQUENCES WITH PRECISELY K+ 1 K-BLOCKS
AMERICAN MATHEMATICAL MONTHLY 79 (7), 773-&, 1972
View on Google Scholar ↗
1972 2 12.2%
The Art of Computer Programming, Chapter 4, Section 3.3, 2nd edn., vol. 2
Addison-Wesley, Reading, MA, 1981
View on Google Scholar ↗
1981 2 12.0%
The Art of Computer Programming: Newly Available Sections of the Classic Work
Addison-Wesley, 2005
View on Google Scholar ↗
2005 2 11.9%
Sztuka programowania: Algorytmy podstawowe
Wydawnictwa Naukowo-Techniczne, 2002
View on Google Scholar ↗
2002 2 11.8%
A programming and problem-solving seminar
Stanford Univ., 1987
View on Google Scholar ↗
1987 2 11.8%
COMPARISON OF THE SUN-EXPOSED AND SHADED SIDE OF APPLE FRUITS. 2. LIPIDS OF THE FRUIT SKIN
GARTENBAUWISSENSCHAFT 52 (3), 140-144, 1987
View on Google Scholar ↗
1987 2 11.8%
Changes at the Journal of Algorithms
2010-06-29]. http://www. cs. colorado. edu/~ hal/s. pdf, 2003
View on Google Scholar ↗
2003 2 11.8%
Letter to Editoral Board
Journal of Algorithms 25, 2003
View on Google Scholar ↗
2003 2 11.8%
On the inversion of in terms of associated Stirling numbers
arXiv preprint math/9512230, 1995
View on Google Scholar ↗
1995 2 11.8%
Partitioned tensor products and their spectra
arXiv preprint math/9503233, 1995
View on Google Scholar ↗
1995 2 11.8%
Some Bernstein Polynomials: 10985
The American Mathematical Monthly 111 (5), 447-447, 2004
View on Google Scholar ↗
2004 2 11.7%
The Art of Computer Programming: Includes Index
Addison-Wesley, 2009
View on Google Scholar ↗
2009 2 11.6%
Combinatorial properties of permutations
The Art of Computer Programming 3, 11-72, 1998
View on Google Scholar ↗
1998 2 11.5%
CWEB User Manual: The CWEB System of Structured Documentation
Stanford University, Department of Computer Science, 1990
View on Google Scholar ↗
1990 2 11.5%
A bijection for ordered factorizations.
J. Comb. Theory, Ser. A 54 (2), 317-318, 1990
View on Google Scholar ↗
1990 2 11.5%
11369
The American Mathematical Monthly 115 (6), 567-567, 2008
View on Google Scholar ↗
2008 2 11.5%
Computer Science Department
Stanford University, Academic Press, 1992
View on Google Scholar ↗
1992 2 11.5%
TEXTURES: User's Guide
Blue Sky Research, 1994
View on Google Scholar ↗
1994 2 11.4%
Partitions of a circular set: 11151
The American Mathematical Monthly 114 (3), 265-266, 2007
View on Google Scholar ↗
2007 2 11.3%
nan
2022
View on Google Scholar ↗
2022 1 11.3%
Balanced Tilings of a Rectangle with Three Rows
The American Mathematical Monthly 125 (6), 566-568, 2018
View on Google Scholar ↗
2018 2 11.3%
Elementary Problems: E3427-E3432
The American Mathematical Monthly 98 (3), 263-264, 1991
View on Google Scholar ↗
1991 2 11.3%
Companion to the papers of Donald Knuth
(No Title), 2011
View on Google Scholar ↗
2011 2 11.2%
Éléments pour une histoire de l'informatique
(No Title), 2011
View on Google Scholar ↗
2011 2 11.2%
Συνκριτά μαθηματικά
View on Google Scholar ↗
2011 2 11.2%
Algorithmes
Center for the Study of Language and Information/SRI, 2011
View on Google Scholar ↗
2011 2 11.2%
Mathematical vanity plates
The Mathematical Intelligencer 33, 33-45, 2011
View on Google Scholar ↗
2011 2 11.2%
Algorithmic themes
A Century of Mathematics in America, Part I, 439-445, 1988
View on Google Scholar ↗
1988 2 11.2%
nan
2014
View on Google Scholar ↗
2014 2 10.6%
The Art of Computer Programming Volume 1 Fundamental Algorithms Third Edition 日本語版
ドワンゴ, 2015
View on Google Scholar ↗
2015 2 10.6%
The Art of Computer Programming Volume 3 Sorting and Searching Second Edition 日本語版
ドワンゴ, 2015
View on Google Scholar ↗
2015 2 10.6%
Backus' language
Communications of the ACM 5 (4), 185, 1962
View on Google Scholar ↗
1962 1 8.9%
5264
The American Mathematical Monthly 73 (2), 211-212, 1966
View on Google Scholar ↗
1966 1 8.5%
Representing Numbers Using Only One 4
Mathematics Magazine 37 (5), 308-310, 1964
View on Google Scholar ↗
1964 1 8.4%
E2328
The American Mathematical Monthly 79 (10), 1138-1139, 1972
View on Google Scholar ↗
1972 1 7.2%
The History of Sorting
View on Google Scholar ↗
1972 1 7.2%
TeX 82
Stanford Instructional Television Network, 1982
View on Google Scholar ↗
1982 1 7.1%
A torture test for METAFONT
Department of Computer Science, Stanford University, 1986
View on Google Scholar ↗
1986 1 7.0%
10906
The American Mathematical Monthly 108 (9), 872-872, 2001
View on Google Scholar ↗
2001 1 6.9%
10871
The American Mathematical Monthly 108 (4), 372-372, 2001
View on Google Scholar ↗
2001 1 6.9%
Sztuka programowania: Algorytmy seminumeryczne
Wydawnictwa Naukowo-Techniczne, 2002
View on Google Scholar ↗
2002 1 6.9%
计算机程序设计艺术: 英文版. 基本算法. 第 1 卷
清华大学出版社, 2002
View on Google Scholar ↗
2002 1 6.9%
The Knowlton–Graham Partition Problem
journal of combinatorial theory, Series A 73 (1), 185-189, 1996
View on Google Scholar ↗
1996 1 6.9%
Solving a Recurrence by Binary Expansion: 11320 [2007, 835]
The American Mathematical Monthly 116 (7), 649-649, 2009
View on Google Scholar ↗
2009 1 6.8%
11452
The American Mathematical Monthly 116 (7), 648-648, 2009
View on Google Scholar ↗
2009 1 6.8%
Zero-suppressed BDDs: A combinatorial alternative
The Art of Computer Programming: Bitwise Tricks & Techniques 4 (1), 117-126, 2009
View on Google Scholar ↗
2009 1 6.8%
" A Little Bit of Your Soul in It": An Interview with Donald Knuth
Writing on the Edge 9 (1), 10-25, 1997
View on Google Scholar ↗
1997 1 6.7%
10424
The American Mathematical Monthly 104 (5), 466-467, 1997
View on Google Scholar ↗
1997 1 6.7%
to The American Mathematical Monthly
The American Mathematical Monthly 104 (5), 456-457, 1997
View on Google Scholar ↗
1997 1 6.7%
4.5. 2 the Greatest Common Divisor
The Art of Computer Programming 2, 333-356, 1997
View on Google Scholar ↗
1997 1 6.7%
N-ciphered texts
Word Ways 20 (3), 13, 1987
View on Google Scholar ↗
1987 1 6.7%
Animals in a cage: 10875
The American Mathematical Monthly 110 (3), 243-245, 2003
View on Google Scholar ↗
2003 1 6.6%
Mini-indexes for literate programs
arXiv preprint cs/9401102, 1994
View on Google Scholar ↗
1994 1 6.6%
10689
The American Mathematical Monthly 105 (8), 769-769, 1998
View on Google Scholar ↗
1998 1 6.6%
5X5X5 Word Cubes By Computer
Word Ways 26 (2), 12, 1993
View on Google Scholar ↗
1993 1 6.5%
Arta programarii calculatoarelor: Algoritmi fundamentali
Teora, 2000
View on Google Scholar ↗
2000 1 6.5%
المرجع الألكتروني للمعلوماتية
View on Google Scholar ↗
2016 1 6.3%
E3303
The American Mathematical Monthly 97 (4), 348-349, 1990
View on Google Scholar ↗
1990 1 6.1%
An identity involving sums and products
AMERICAN MATHEMATICAL MONTHLY 97 (3), 256-257, 1990
View on Google Scholar ↗
1990 1 6.1%
E2982
The American Mathematical Monthly 96 (6), 525-526, 1989
View on Google Scholar ↗
1989 1 6.1%
TeX 3.0 ou le TeX nouveau va arriver
Cahiers GUTenberg, 39-45, 1989
View on Google Scholar ↗
1989 1 6.1%
METAFONTware
Stanford University, 1989
View on Google Scholar ↗
1989 1 6.1%