Donald Knuth
Fletcher Jones Professor of Computer Science, Emeritus
Bio
Donald Ervin Knuth is an American computer scientist, mathematician, and Professor Emeritus at Stanford University.
He is the author of the multi-volume work The Art of Computer Programming and has been called the "father" of the analysis of algorithms. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system, the related METAFONT font definition language and rendering system, and the Computer Modern family of typefaces.
As a writer and scholar,[4] Knuth created the WEB and CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. As a member of the academic and scientific community, Knuth is strongly opposed to the policy of granting software patents. He has expressed his disagreement directly to the patent offices of the United States and Europe. (via Wikipedia)
Honors & Awards
-
Grace Murray Hopper Award, ACM (1971)
-
Member, American Academy of Arts and Sciences (1973)
-
Turing Award, ACM (1974)
-
Lester R Ford Award, Mathematical Association of America (1975)
-
Member, National Academy of Sciences (1975)
-
Distinguished Alumni Award, California Institute of Technology (1978)
-
National Medal of Science, President Carter (1979)
-
Distinguished Fellow, British Computer Society (1980)
-
Wallace McDowell Award, IEEE Computer Society (1980)
-
Member, National Academy of Engineering (1981)
-
Priestley Award, Dickinson College (1981)
-
Honorary Member, IEEE (1982)
-
Golden Plate Award, American Academy of Achievement (1985)
-
SIGCSE Award (Computer Science Education), ACM (1986)
-
Software Systems Award, ACM (1986)
-
Steele Prize for Exposition, American Mathematical Society (1986)
-
New York Academy of Sciences Award, New York Academy of Sciences (1987)
-
Franklin Medal, Franklin Institute (1988)
-
Gold Medal Award, Case Alumni Association (1990)
-
Foreign Associate, Académie des Sciences, Paris (1992)
-
Foreign Mermber, Norwegian Academy of Sciences (1993)
-
Lester R Ford Award, Mathematical Association of America (1993)
-
Adelsköld Medal, Royal Swedish Academy of Sciences (1994)
-
Best New Book: Computer Science, Association of American Publishers (1994)
-
Fellow, ACM (1994)
-
Harvey Prize, Technion (1995)
-
John von Neumann Medal, IEEE (1995)
-
Kyoto Prize, Inamori Foundation (1996)
-
Fellow, Computer History Museum (1998)
-
Foreign Member, Royal Society of London (2003)
-
Honorary Fellow, Magdalen College, Oxford (2005)
-
Foreign Member, Russian Academy of Sciences (2008)
-
Fellow, SIAM (2009)
-
Frontiers of Knowledge Award, BBVA Foundation (2010)
-
Katayanagi Prize, Carnegie-Mellon University (2010)
-
ABACUS Award, Upsilon Pi Upsilon (2011)
-
Faraday Medal, IET (2011)
-
Hero Award, Stanford University School of Engineering (2011)
-
Member, American Philosophical Sociery (2012)
-
Platinum Gold Medal for Computer Science Education, ETH Zürich (2012)
-
Fellow, American Mathematical Society (2013)
-
Peter Karow Award, ATypI (2013)
-
Honorary Member, London Mathematical Society (2015)
-
Trotter Prize, Texas A&M University (2018)
Professional Education
-
PhD, California Institute of Technology, Mathematics (1963)
Patents
-
Donald Knuth, Stephen N Schiller. "United States Patent 5,305,118 Methods of controlling dot size in digital half toning with multi-cell threshold arrays", Adobe Systems, Apr 19, 1994
-
Donald Knuth, LeRoy R Guck, Lawrence G Hanson. "United States Patent 3,626,167 Scaling and number base converting method and apparatus", Burroughs Corporation, Dec 7, 1971
-
Donald Knuth. "United States Patent 3,548,174 Random number generator", Burroughs Corporation, Dec 15, 1970
-
Donald Knuth, Donald P Hynes. "United States Patent 3,454,929 Computer edit system", Burroughs Corporation, Jul 8, 1969
-
Donald Knuth, Roger E Packard. "United States Patent 3,422,405 Digital computers having an indirect field length operation", Burroughs Corporation, Jan 14, 1969
All Publications
- Selected papers on fun and games CSLI Publications. 2011
- Combinatorial algorithms, part 1 The art of computer programming Addison-Wesley. 2005; 4A
-
MMIX
MIXWARE: A RISC COMPUTER FOR THE THIRD MILLENNIUM
1999; 1750: 2-?
View details for Web of Science ID 000172021800001
- Digital Typography CSLI Publications. 1999
- Sorting and searching The art of computer programming Addison-Wesley. 1998; 3
- Fundamental Algorithms The art of computer programming Addison-Wesley. 1997; 1
- Seminumerical algorithms The art of computer programming Addison-Wesley. 1997; 2
- Concrete Mathematics: A foundation for computer science Addison-Wesley. 1994
- The Stanford GraphBase: A platform for combinatorial computing Addison-Wesley. 1994
-
THE BIRTH OF THE GIANT COMPONENT
RANDOM STRUCTURES & ALGORITHMS
1993; 4 (3): 233-358
View details for Web of Science ID A1993LG35900002
-
2 NOTES ON NOTATION
AMERICAN MATHEMATICAL MONTHLY
1992; 99 (5): 403-422
View details for Web of Science ID A1992HT65900001
-
AXIOMS AND HULLS
LECTURE NOTES IN COMPUTER SCIENCE
1992; 606: R3-?
View details for Web of Science ID A1992KR93000001
- 3:16 Bible Texts Illuminated A R Editions. 1990
-
THE ERRORS OF TEX
SOFTWARE-PRACTICE & EXPERIENCE
1989; 19 (7): 607-685
View details for Web of Science ID A1989AF73300001
- The METAFONTbook Computers & Typesetting Addison-Wesley. 1986; C
-
LITERATE PROGRAMMING
COMPUTER JOURNAL
1984; 27 (2): 97-111
View details for Web of Science ID A1984ST33100001
- The TeXbook Computers & Typesetting Addison-Wesley. 1984; A
-
THE CONCEPT OF A META-FONT
VISIBLE LANGUAGE
1982; 16 (1): 3-27
View details for Web of Science ID A1982NS49700001
-
BREAKING PARAGRAPHS INTO LINES
SOFTWARE-PRACTICE & EXPERIENCE
1981; 11 (11): 1119-1184
View details for Web of Science ID A1981MR22500001
-
MATHEMATICAL TYPOGRAPHY
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY
1979; 1 (2): 337-372
View details for Web of Science ID A1979GQ83700003
-
MATHEMATICS AND COMPUTER SCIENCE - COPING WITH FINITENESS
SCIENCE
1976; 194 (4271): 1235-1242
Abstract
By presenting these examples, I have tried to illustrate four main points. 1) Finite numbers can be really enormous, and the known universe is very small. Therefore the distinction between finite and infinite is not as relevant as the distinction between realistic and unrealistic. 2) In many cases there are subtle ways to solve very large problems quickly, in spite of the fact that they appear at first to require examination of too many possibilities. 3) There are also cases where we can prove that a fairly natural problem is intrinsically hard, far beyond our conceivable capabilities. 4) It takes a good deal of skill to decide whether a given problem is in the easy or hard class; but even if a problem does turn out to be hard there are useful and interesting ways to change it into one that can be done satisfactorily.
View details for Web of Science ID A1976CN68700005
View details for PubMedID 17797067
-
COMPUTER PROGRAMMING AS AN ART
COMMUNICATIONS OF THE ACM
1974; 17 (12): 667-673
View details for Web of Science ID A1974U883300001
- Surreal Numbers Addison-Wesley. 1974
-
Balanced Colorings of Graphs Proposal
AMERICAN MATHEMATICAL MONTHLY
2023; 130 (5): 488-489
View details for Web of Science ID 001117348100003
-
Let's Not Dumb Down the History of Computer Science
COMMUNICATIONS OF THE ACM
2021; 64 (2): 33–35
View details for DOI 10.1145/3442377
View details for Web of Science ID 000613706000022
-
Dispersed Rooks on a Chessboard
AMERICAN MATHEMATICAL MONTHLY
2020; 127 (4): 379
View details for Web of Science ID 000522913000027
-
A Property of Conjugate Partitions Proposal
AMERICAN MATHEMATICAL MONTHLY
2020; 127 (2): 186
View details for Web of Science ID 000506445300024
-
Log-Concavity of a Binomial Sum Proposal
AMERICAN MATHEMATICAL MONTHLY
2019; 126 (3): 283–84
View details for Web of Science ID 000460705200017
- Fantasia Apocalyptica Illustrated CSLI Publications. 2018
-
Balanced Tilings of a Rectangle with Three Rows
AMERICAN MATHEMATICAL MONTHLY
2018; 125 (6): 566
View details for Web of Science ID 000457783200017
-
A Permanent Solution
AMERICAN MATHEMATICAL MONTHLY
2018; 125 (10): 946
View details for Web of Science ID 000457781200014
-
Mathematical Vanity Plates
MATHEMATICAL INTELLIGENCER
2011; 33 (1): 33-45
View details for DOI 10.1007/s00283-010-9170-7
View details for Web of Science ID 000287850200007
- Companion to the papers of Donald Knuth CSLI Publications. 2011
- A symmetric Eulerian identity Journal of Combinatorics 2010; 1 (1): 29-38
- Selected papers on design of algorithms CSLI Publications. 2010
-
Robert W Floyd, in memoriam
IEEE ANNALS OF THE HISTORY OF COMPUTING
2004; 26 (2): 75-83
View details for Web of Science ID 000221468800008
-
Efficient coroutine generation of constrained gray sequences
FROM OBJECT-ORIENTATION TO FORMAL METHODS
2004; 2635: 183-208
View details for Web of Science ID 000222824500011
- Selected papers on computer languages CSLI Publications. 2003
- Selected papers on discrete mathematics CSLI Publications. 2003
- Things a computer scientist rarely talks about CSLI Publications. 2001
- Dancing links Millennial Perspectives in Computer Science Palgrave. 2000: 187–214
- Selected papers on the analysis of algorithms CSLI Publications. 2000
-
Linear probing and graphs
ALGORITHMICA
1998; 22 (4): 561-568
View details for Web of Science ID 000077034800012
-
Aztec diamonds, checkerboard graphs, and spanning trees
JOURNAL OF ALGEBRAIC COMBINATORICS
1997; 6 (3): 253-257
View details for Web of Science ID A1997XH47900004
-
Partitioned tensor products and their spectra
JOURNAL OF ALGEBRAIC COMBINATORICS
1997; 6 (3): 259-267
View details for Web of Science ID A1997XH47900005
-
Shellsort with three increments
RANDOM STRUCTURES & ALGORITHMS
1997; 10 (1-2): 125-142
View details for Web of Science ID A1997WP10400006
-
An exact analysis of stable allocation
JOURNAL OF ALGORITHMS
1996; 20 (2): 431-442
View details for Web of Science ID A1996UC84600011
-
On the Lambert W function
ADVANCES IN COMPUTATIONAL MATHEMATICS
1996; 5 (4): 329-359
View details for Web of Science ID A1996VQ64200003
- Selected papers on computer science CSLI Publications. 1996
- Irredundant intervals ACM Journal of Experimental Algorithmics 1996; 1: 1-19
-
The Knowlton-Graham partition problem
JOURNAL OF COMBINATORIAL THEORY SERIES A
1996; 73 (1): 185-189
View details for Web of Science ID A1996TQ99600015
-
ON THE INVERSION OF Y(ALPHA) E(Y) IN TERMS OF ASSOCIATED STIRLING NUMBERS
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE
1995; 320 (12): 1449-1452
View details for Web of Science ID A1995RJ55200005
-
2-WAY ROUNDING
SIAM JOURNAL ON DISCRETE MATHEMATICS
1995; 8 (2): 281-290
View details for Web of Science ID A1995QZ38600009
-
Polynomials involving the floor function
MATHEMATICA SCANDINAVICA
1995; 76 (2): 194-200
View details for Web of Science ID A1995TN14700003
-
SPEECH UPON RECEIVING HONORARY DEGREE FROM ST-PETERSBURG UNIVERSITY
PROGRAMMING AND COMPUTER SOFTWARE
1994; 20 (6): 290-290
View details for Web of Science ID A1994RB95300007
-
MINI-INDEXES FOR LITERATE PROGRAMS
SOFTWARE-CONCEPTS AND TOOLS
1994; 15 (1): 2-11
View details for Web of Science ID A1994NK91900001
- The sandwich theorem Electronic Journal of Combinatorics 1994; 1: 1-48
- Leaper graphs The Mathematical Gazette 1994; 78: 274-297
-
FAULHABER,JOHANN AND SUMS OF POWERS
MATHEMATICS OF COMPUTATION
1993; 61 (203): 277-294
View details for Web of Science ID A1993LQ84200023
-
THE STANFORD GRAPHBASE - A PLATFORM FOR COMBINATORIAL ALGORITHMS
4TH ANNUAL ACM-SIAM SYMP ON DISCRETE ALGORITHMS
SIAM. 1993: 41–43
View details for Web of Science ID A1993BX60X00005
-
THE PROBLEM OF COMPATIBLE REPRESENTATIVES
SIAM JOURNAL ON DISCRETE MATHEMATICS
1992; 5 (3): 422-427
View details for Web of Science ID A1992JF54700011
-
RANDOMIZED INCREMENTAL CONSTRUCTION OF DELAUNAY AND VORONOI DIAGRAMS
ALGORITHMICA
1992; 7 (4): 381-413
View details for Web of Science ID A1992HG34400002
- Convolution polynomials Mathematica Journal 1992; 2 (4): 67-78
- Context-free multilanguages Theoretical Studies in Computer Science Academic Press. 1992: 1–13
- Literate Programming CSLI Publications. 1992
-
THEORY AND PRACTICE
THEORETICAL COMPUTER SCIENCE
1991; 90 (1): 1-15
View details for Web of Science ID A1991GQ94100002
-
EFFICIENT REPRESENTATION OF PERM GROUPS
COMBINATORICA
1991; 11 (1): 33-43
View details for Web of Science ID A1991GB07600005
- Textbook examples of recursion Artificial Intelligence and Mathematical Theory of Computation Academic Press. 1991: 207–229
-
ADDITION MACHINES
SIAM JOURNAL ON COMPUTING
1990; 19 (2): 329-340
View details for Web of Science ID A1990CV72400009
-
RANDOMIZED INCREMENTAL CONSTRUCTION OF DELAUNAY AND VORONOI DIAGRAMS
17TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING ( ICALP 90 )
SPRINGER-VERLAG. 1990: 414–431
View details for Web of Science ID A1990BR56W00032
-
THE GENESIS OF ATTRIBUTE GRAMMARS
INTERNATIONAL WORKSHOP ON ATTRIBUTE GRAMMARS AND THEIR APPLICATIONS ( WAGA )
SPRINGER-VERLAG BERLIN. 1990: 1–12
View details for Web of Science ID A1990BR95F00001
-
NESTED SATISFIABILITY
ACTA INFORMATICA
1990; 28 (1): 1-6
View details for Web of Science ID A1990EK65400001
- Stable husbands Random Structures and Algorithms 1990; 1 (1): 1-14
- Mathematics for the analysis of algorithms Birkhauser Boston. 1990
-
THE 1ST CYCLES IN AN EVOLVING GRAPH
DISCRETE MATHEMATICS
1989; 75 (1-3): 167-215
View details for Web of Science ID A1989AB74600018
-
AMS EULER - A NEW TYPEFACE FOR MATHEMATICS
SCHOLARLY PUBLISHING
1989; 20 (3): 131-157
View details for Web of Science ID A1989U148300001
-
A RECURRENCE RELATED TO TREES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
1989; 105 (2): 335-349
View details for Web of Science ID A1989T910900013
-
THE POWER OF A PRIME THAT DIVIDES A GENERALIZED BINOMIAL COEFFICIENT
JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK
1989; 396: 212-219
View details for Web of Science ID A1989U389300008
-
A NOTE ON STRATEGY ELIMINATION IN BIMATRIX GAMES
OPERATIONS RESEARCH LETTERS
1988; 7 (3): 103-107
View details for Web of Science ID A1988P282200001
-
DIGITAL HALFTONES BY DOT DIFFUSION
ACM TRANSACTIONS ON GRAPHICS
1987; 6 (4): 245-273
View details for Web of Science ID A1987L598200001
-
COMPUTER-SCIENCE CONSIDERATIONS
BYTE
1986; 11 (2): 169-?
View details for Web of Science ID A1986AYK6700028
-
THE IBM-650 - AN APPRECIATION FROM THE FIELD
ANNALS OF THE HISTORY OF COMPUTING
1986; 8 (1): 50-55
View details for Web of Science ID A1986AYS4700013
- Computer Modern Typefaces Computers & Typesetting Addison-Wesley. 1986; E
- METAFONT: The Program Computers & Typesetting Addison-Wesley. 1986; D
- TeX: The Program Computers & Typesetting Addison-Wesley. 1986; B
-
EFFICIENT BALANCED CODES
IEEE TRANSACTIONS ON INFORMATION THEORY
1986; 32 (1): 51-53
View details for Web of Science ID A1986A548200005
-
AN ANALYSIS OF OPTIMUM CACHING
JOURNAL OF ALGORITHMS
1985; 6 (2): 181-199
View details for Web of Science ID A1985AKL3500002
- Semi-optimal bases for linear dependencies Linear and Multilinear Algebra 1985; 17 (1): 1-4
-
ALGORITHMIC THINKING AND MATHEMATICAL THINKING
AMERICAN MATHEMATICAL MONTHLY
1985; 92 (3): 170-181
View details for Web of Science ID A1985ACX9100002
-
LESSONS LEARNED FROM METAFONT + USE OF COMPUTERS IN TYPE DESIGN
VISIBLE LANGUAGE
1985; 19 (1): 34-53
View details for Web of Science ID A1985AJW0100004
-
DYNAMIC HUFFMAN CODING
JOURNAL OF ALGORITHMS
1985; 6 (2): 163-180
View details for Web of Science ID A1985AKL3500001
-
DECIPHERING A LINEAR CONGRUENTIAL ENCRYPTION
IEEE TRANSACTIONS ON INFORMATION THEORY
1985; 31 (1): 49-52
View details for Web of Science ID A1985ACJ4600006
-
OPTIMAL PREPAGING AND FONT CACHING
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
1985; 7 (1): 62-79
View details for Web of Science ID A1985ACD2000004
-
THE TOILET PAPER PROBLEM
AMERICAN MATHEMATICAL MONTHLY
1984; 91 (8): 465-470
View details for Web of Science ID A1984TL36500001
-
THE COMPLEXITY OF SONGS
COMMUNICATIONS OF THE ACM
1984; 27 (4): 344-348
View details for Web of Science ID A1984SK54400021
-
THE DISTRIBUTION OF CONTINUED-FRACTION APPROXIMATIONS
JOURNAL OF NUMBER THEORY
1984; 19 (3): 443-448
View details for Web of Science ID A1984TX75500011
-
AN ALGORITHM FOR BROWNIAN ZEROS
COMPUTING
1984; 33 (1): 89-94
View details for Web of Science ID A1984TH51600009
-
HUFFMAN-ALGORITHM VIA ALGEBRA
JOURNAL OF COMBINATORIAL THEORY SERIES A
1982; 32 (2): 216-224
View details for Web of Science ID A1982NP07900006
-
A PERMANENT INEQUALITY
AMERICAN MATHEMATICAL MONTHLY
1981; 88 (10): 731-740
View details for Web of Science ID A1981MS21300002
- Supernatural numbers The Mathematical Gardner Wadsworth International. 1981: 310–325
-
VERIFICATION OF LINK-LEVEL PROTOCOLS
BIT
1981; 21 (1): 31-36
View details for Web of Science ID A1981ML65400003
- The early development of programming languages A History of Computing in the Twentieth Century Academic Press. 1980: 197–273
- The letter S Mathematical Intelligencer 1980; 2: 114-122
-
LEXICOGRAPHIC PERMUTATIONS WITH RESTRICTIONS
DISCRETE APPLIED MATHEMATICS
1979; 1 (1-2): 117-125
View details for Web of Science ID A1979JB34500008
-
INHOMOGENEOUS SORTING
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES
1979; 8 (4): 255-260
View details for Web of Science ID A1979HH33400001
-
AVERAGE TIME FOR CARRY PROPAGATION
PROCEEDINGS OF THE KONINKLIJKE NEDERLANDSE AKADEMIE VAN WETENSCHAPPEN SERIES A-MATHEMATICAL SCIENCES
1978; 81 (2): 238-242
View details for Web of Science ID A1978FC51800009
- The expected linearity of a simple equivalence algorithm Theoretical Computer Science 1978; 6: 281-315
-
COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION
SIAM JOURNAL ON APPLIED MATHEMATICS
1978; 34 (3): 477-495
View details for Web of Science ID A1978EZ73500004
-
IDENTITIES FROM PARTITION INVOLUTIONS
FIBONACCI QUARTERLY
1978; 16 (3): 198-212
View details for Web of Science ID A1978FV94500003
-
TRIVIAL ALGORITHM WHOSE ANALYSIS ISNT
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
1978; 16 (3): 301-322
View details for Web of Science ID A1978FF01600002
-
DELETIONS THAT PRESERVE RANDOMNESS
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
1977; 3 (5): 351-359
View details for Web of Science ID A1977DV06000003
- Notes on generalized Dedekind sums Acta Arithmetica 1977; 33: 297-325
- Fast pattern matching in strings SIAM Journal on Computing 1977; 6: 323-350
-
GENERALIZATION OF DIJKSTRAS ALGORITHM
INFORMATION PROCESSING LETTERS
1977; 6 (1): 1-5
View details for Web of Science ID A1977DQ27800001
-
ALGORITHMS
SCIENTIFIC AMERICAN
1977; 236 (4): 63-?
View details for Web of Science ID A1977DA10100004
- Analysis of a simple factorization algorithm Theoretical Computer Science 1976; 3: 321-348
- The complexity of nonuniform random number generation Algorithms and Complexity Academic Press. 1976: 357–428
-
ESTIMATING EFFICIENCY OF BACKTRACK PROGRAMS
MATHEMATICS OF COMPUTATION
1975; 29 (129): 121-136
View details for Web of Science ID A1975V616300014
-
RANDOM MATROIDS
DISCRETE MATHEMATICS
1975; 12 (4): 341-358
View details for Web of Science ID A1975AQ65000003
-
ANALYSIS OF ALPHA-BETA PRUNING
ARTIFICIAL INTELLIGENCE
1975; 6 (4): 293-326
View details for Web of Science ID A1975AZ10700001
-
ANALYSIS OF SUBTRACTIVE ALGORITHM FOR GREATEST COMMON DIVISORS
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA
1975; 72 (12): 4720-4722
Abstract
The sum of all partial quotients in the regular continued fraction expansions of m/n, for 1 = m = n, is shown to be 6pi(-2)n(ln n)(2) + O(n log n(log log n)(2)). This result is applied to the analysis of what is perhaps the oldest non-trivial algorithm for number-theoretic computations.
View details for Web of Science ID A1975BB20500009
View details for PubMedID 16592294
View details for PubMedCentralID PMC388801
-
RECURRENCE RELATIONS BASED ON MINIMIZATION
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS
1974; 48 (2): 534-559
View details for Web of Science ID A1974U792800015
- Structured programming with go to statements Computing Surveys 1974; 6 (4): 261-301
-
COMPUTER SCIENCE AND ITS RELATION TO MATHEMATICS
AMERICAN MATHEMATICAL MONTHLY
1974; 81 (4): 323-343
View details for Web of Science ID A1974S682800001
-
ORDERED HASH TABLES
COMPUTER JOURNAL
1974; 17 (2): 135-142
View details for Web of Science ID A1974T505700008
- Enumeration of plane partitions Journal of Combinatorial Theory Series A 1972; 13 (1): 40-54
- An empirical study of FORTRAN programs SOFTWARE--Practice and Experience 1971; 1: 105-133
- Simple word problems in universal algebras Compututational Problems in Abstract Algebra Pergamon. 1970: 263–297
- Permutations, matrices, and generalized Young tableaux Pacific Journal of Mathematics 1970; 34: 709-727
- Finite semifields and projective planes Journal of Algebra 1965; 2 (2): 182-217
- On the translation of languages from left to right Information and Control 1965; 8 (5): 607-639
- Minimizing drum latency time Journal of the ACM 1961; 8 (2): 119-150
- The potrzebie system of weights and measures MAD Magazine 1957; 1 (33): 36-37