Donald E. Knuth - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Donald E. Knuth' as author, editor, or advisor:

The Complexity of Songs (April 1984 Special Section)Donald E. Knuth. CACM, 27(4):344-348, 1984.
An Exact Analysis of Stable AllocationDonald E. Knuth. jal, 20(2):431-442, 1996.
Solving a Recurrence by Binary Expansion: 11320 [2007, 835]Donald E. Knuth, O. P. Lossers. tamm, 116(7):649, 2009. [doi]
Computer Programming as an ArtDonald E. Knuth. CACM, 17(12):667-673, 1974.
Additional comments on a problem in concurrent programming controlDonald E. Knuth. CACM, 9(5):321-322, 1966. [doi]
Problem 10906Donald E. Knuth. tamm, 108(9):872, 2001. [doi]
Shellsort with three incrementsSvante Janson, Donald E. Knuth. rsa, 10(1-2):125-142, 1997.
Concrete mathematics - a foundation for computer science (2. ed.)Ronald L. Graham, Donald E. Knuth, Oren Patashnik. Addison-Wesley, 1994.
A Structured Program to Generate all Topological Sorting ArrangementsDonald E. Knuth, Jayme Luiz Szwarcfiter. ipl, 2(6):153-157, 1974.
Problem 11243Donald E. Knuth. tamm, 113(8):759, 2006. [doi]
A Trivial Algorithm Whose Analysis Isn tArne T. Jonassen, Donald E. Knuth. jcss, 16(3):301-322, 1978.
The calculation of EasterDonald E. Knuth. CACM, 5(4):209-210, 1962. [doi]
Enumeration of Plane PartitionsEdward A. Bender, Donald E. Knuth. JCT, 13(1):40-54, 1972.
The Knowlton-Graham Partition ProblemDonald E. Knuth. JCT, 73(1):185-189, 1996. [doi]
An Algorithmic View of the UniverseChristos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant. acm 2012: [doi]
Deletions That Preserve RandomnessDonald E. Knuth. TSE, 3(5):351-359, 1977.
Evading the Drift in Floating-Point AdditionJohn F. Reiser, Donald E. Knuth. ipl, 3(3):84-87, 1975.
ArithmetikDonald E. Knuth. Springer, 2001. [doi]
The first cycles in an evolving graphPhilippe Flajolet, Donald E. Knuth, Boris Pittel. DM, 75(1-3):167-215, 1989. [doi]
An Analysis of Optimum CachingDonald E. Knuth. jal, 6(2):181-199, 1985.
Leaves of Ordered Trees: 10757Mark E. Kidwell, Donald E. Knuth, O. P. Lossers. tamm, 108(9):874-875, 2001. [doi]
Literate programmingDonald E. Knuth. Volume 27 of CSLI lecture notes series, Center for the Study of Language and Information, 1992.
Ancient Babylonian AlgorithmsDonald E. Knuth. CACM, 15(7):671-677, 1972.
Sums and Powers, Set Counting, and Coefficient Tracking: 11274 [2007, 165]Donald E. Knuth, Julian L. Hook. tamm, 116(6):548-549, 2009. [doi]
Irredundant IntervalsDonald E. Knuth. jea, 1:1, 1996. [doi]
The complexity of songsDonald E. Knuth. sigact, 9(2):17-24, 1977. [doi]
Companion to the papers of Donald KnuthDonald E. Knuth. Volume 202 of CSLI lecture notes series, Cambridge University Press, 2012. [doi]
A terminological proposalDonald E. Knuth. sigact, 6(1):12-18, 1974. [doi]
Problem 10985Donald E. Knuth. tamm, 110(1):58, 2003. [doi]
An algorithm for Brownian zeroesDonald E. Knuth. computing, 33(1):89-94, 1984. [doi]
Problem 11452Donald E. Knuth. tamm, 116(7):648, 2009. [doi]
Erratum: Evading the Drift in Floating-Point AdditionJohn F. Reiser, Donald E. Knuth. ipl, 3(5):164, 1975.
SMALGOL-61G. A. Bachelor, J. R. H. Dempster, Donald E. Knuth, Joseph Speroni. CACM, 4(11):499-502, 1961. [doi]
Backus languageDonald E. Knuth, Saul Gorn. CACM, 5(4):185, 1962. [doi]
Postscript about NP-hard problemsDonald E. Knuth. sigact, 6(2):15-16, 1974. [doi]
A proposal for input-output conventions in ALGOL 60Donald E. Knuth. CACM, 7(5):273-283, 1964. [doi]
Efficient Coroutine Generation of Constrained Gray SequencesDonald E. Knuth, Frank Ruskey. BIRTHDAY 2004: 183-208 [doi]
Top-Down Syntax AnalysisDonald E. Knuth. ACTA, 1:79-110, 1971.
Linear Probing and GraphsDonald E. Knuth. algorithmica, 22(4):561-568, 1998. [doi]
Some Bernstein Polynomials: 10985Donald E. Knuth, et al.. tamm, 111(5):447, 2004. [doi]
Problem 10871Donald E. Knuth. tamm, 108(4):372, 2001. [doi]
Fast Pattern Matching in StringsDonald E. Knuth, James H. Morris Jr., Vaughan R. Pratt. SICOMP, 6(2):323-350, 1977.
Son of seminumerical algorithmsDonald E. Knuth. cca, 9(4):10-11, 1975. [doi]
Balanced Neighborhood Squares: 10871Donald E. Knuth, Gabriel D. Carroll. tamm, 110(2):161-162, 2003. [doi]
A Note on Digitized AnglesDonald E. Knuth. epodd, 3(2):99-104, 1990.
Exploring All Binary Mazes: 10720Donald E. Knuth, O. P. Lossers. tamm, 110(1):60-61, 2003. [doi]
Activity in an Interleaved MemoryDonald E. Knuth, Gururaj S. Rao. TC, 24(9):943-944, 1975.
Selected Papers on Fun and GamesDonald E. Knuth. Volume 192 of CSLI lecture notes series, Cambridge University Press, 2011. [doi]
Selected papers on analysis of algorithmsDonald E. Knuth. Volume 102 of CSLI lecture notes series, CSLI Publications, 2000.
Min-Plus Matrix Multiplication: 10834Sung-Soo Kim, Richard Johnsonbaugh, Ronald E. Prather, Donald E. Knuth. tamm, 109(7):667-668, 2002. [doi]
A Modular Triple: 11021Donald E. Knuth, Silvia Fernández, Gerry Myerson. tamm, 112(3):279-280, 2005. [doi]
The IBM 650: An Appreciation from the FieldDonald E. Knuth. annals, 8(1):50-55, 1986. [doi]
Problem 11369Donald E. Knuth. tamm, 115(6):567, 2008. [doi]
Verification of Link-Level ProtocolsDonald E. Knuth. bit, 21(1):31-36, 1981.
Theory and PracticeDonald E. Knuth. TCS, 90(1):1-15, 1991.
Stable HusbandsDonald E. Knuth, Rajeev Motwani, Boris Pittel. soda 1990: 397-404
Breaking Paragraphs into LinesDonald E. Knuth, Michael F. Plass. SPE, 11(11):1119-1184, 1981.
A Sequence of Series for the Lambert W FunctionRobert M. Corless, David J. Jeffrey, Donald E. Knuth. issac 1997: 197-204
Correction: Semantics of Context-Free LanguagesDonald E. Knuth. mst, 5(1):95-96, 1971.
George Forsythe and the Development of Computer ScienceDonald E. Knuth. CACM, 15(8):721-726, 1972.
Problem 10832Donald E. Knuth. tamm, 107(9):863, 2000. [doi]
Digital Halftones by Dot DiffusionDonald E. Knuth. tog, 6(4):245-273, 1987. [doi]
Problem 11151Donald E. Knuth. tamm, 112(4):367, 2005. [doi]
A bijection for ordered factorizationsRichard Garfield, Donald E. Knuth, Herbert S. Wilf. JCT, 54(2):317-318, 1990. [doi]
Erratum: A Structured Program to Generate all Topological Sorting ArrangementsDonald E. Knuth, Jayme Luiz Szwarcfiter. ipl, 3(2):64, 1974.
Selected Papers on Design of AlgorithmsDonald E. Knuth. Volume 191 of CSLI lecture notes series, Cambridge University Press, 2010. [doi]
All Questions Answered (Invited Talk)Donald E. Knuth. cp 2022: [doi]
The Art of Computer Programming, Volume III: Sorting and SearchingDonald E. Knuth. Addison-Wesley, 1973.
A Formal Definition of SOLDonald E. Knuth, J. L. McNeley. TC, 13(4):409-414, 1964. [doi]
The remaining trouble spots in ALGOL 60Donald E. Knuth. CACM, 10(10):611-618, 1967. [doi]
Minimizing Drum Latency TimeDonald E. Knuth. JACM, 8(2):119-150, 1961. [doi]
Problem 11320Donald E. Knuth. tamm, 114(9):835, 2007. [doi]
Animals in a Cage: 10875Donald E. Knuth, Richard Stong. tamm, 110(3):243-245, 2003. [doi]
Review of 'Introduction to Combinatorial Mathematics' (Liu, C. L.; 1968)Donald E. Knuth. TIT, 17(1):119-120, 1971. [doi]
On the Lambert::::W:::: functionRobert M. Corless, Gaston H. Gonnet, D. E. G. Hare, David J. Jeffrey, Donald E. Knuth. adcm, 5(1):329-359, 1996. [doi]
ALGOL 60 confidentialDonald E. Knuth, Jack N. Merner. CACM, 4(6):268-272, 1961. [doi]
Big Omicron and big Omega and big ThetaDonald E. Knuth. sigact, 8(2):18-24, 1976. [doi]
Structured Programming with go to StatementsDonald E. Knuth. ACM Comput. Surv., 6(4):261-301, 1974.
An Analysis of Alpha-Beta PruningDonald E. Knuth, Ronald W. Moore. ai, 6(4):293-326, 1975.
Nested SatisfiabilityDonald E. Knuth. ACTA, 28(1):1-6, 1990.
The Asymptotic Number of GeometriesDonald E. Knuth. JCT, 16(3):398-400, 1974.
Ordered Hash TablesO. Amble, Donald E. Knuth. cj, 17(2):135-142, 1974.
Randomized Incremental Construction of Delaunay and Voronoi DiagramsLeonidas J. Guibas, Donald E. Knuth, Micha Sharir. algorithmica, 7(4):381-413, 1992.
Dynamic Huffman CodingDonald E. Knuth. jal, 6(2):163-180, 1985.
Addition MachinesRobert W. Floyd, Donald E. Knuth. SICOMP, 19(2):329-340, 1990.
Examples of formal semanticsDonald E. Knuth. In Erwin Engeler, editor, Symposium on Semantics of Algorithmic Languages. Volume 188 of Lecture Notes in Mathematics, pages 212-235, Springer, 1971. [doi]
The Expected Linearity of a Simple Equivalence AlgorithmDonald E. Knuth, Arnold Schönhage. TCS, 6:281-315, 1978.
The Errors of TEXDonald E. Knuth. SPE, 19(7):607-685, 1989.
RUNCIBLE-Algebraic Translation on a Limited ComputerDonald E. Knuth. CACM, 2(11):18-21, 1959. [doi]
The Stanford GraphBase - a platform for combinatorial computingDonald E. Knuth. ACM, 1993.
Optimal Prepaging and Font CachingDavid R. Fuchs, Donald E. Knuth. TOPLAS, 7(1):62-79, 1985. [doi]
The Problem of Compatible RepresentativesDonald E. Knuth, Arvind Raghunathan. siamdm, 5(3):422-427, 1992.
Evaluation of polynomials by computerDonald E. Knuth. CACM, 5(12):595-599, 1962. [doi]
Problem 11078Donald E. Knuth. tamm, 111(4):361, 2004. [doi]
The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd EditionDonald E. Knuth. Addison-Wesley, 1973.
backus normal form vs. Backus Naur formDonald E. Knuth. CACM, 7(12):735-736, 1964. [doi]
Algorithms in Modern Mathematics and Computer Science, Proceedings, Urgench, Uzbek SSR, September 16-22, 1979Andrei P. Ershov, Donald E. Knuth, editors, Volume 122 of Lecture Notes in Computer Science, Springer, 1981.
An Empirical Study of FORTRAN ProgramsDonald E. Knuth. SPE, 1(2):105-133, 1971.
Problem 11336Donald E. Knuth. tamm, 115(1):71, 2008. [doi]
Complements and transitive closuresRonald L. Graham, Donald E. Knuth, T. S. Motzkin. DM, 2(1):17-29, 1972. [doi]
Optimum Binary Search TreesDonald E. Knuth. ACTA, 1:14-25, 1971.
Invited papers: History of writing compilersDonald E. Knuth. acm 1962: 43 [doi]
Random matroidsDonald E. Knuth. DM, 12(4):341-358, 1975. [doi]
The Art of Computer Programming, Volume II: Seminumerical Algorithms, 2nd EditionDonald E. Knuth. Addison-Wesley, 1981.
A Characterization of Parenthesis LanguagesDonald E. Knuth. iandc, 11(3):269-289, September 1967.
Let's not dumb down the history of computer scienceDonald E. Knuth, Len Shustek. CACM, 64(2):33-35, 2021. [doi]
On the translation of languages from left to rightDonald E. Knuth. Information and Control, 8(6), 1965.
Computer-drawn flowchartsDonald E. Knuth. CACM, 6(9):555-563, 1963. [doi]
Mathematical WritingDonald E. Knuth, Tracy Larrabee, Paul M. Roberts. Volume 14 of MAA notes, Mathematical Association of America, 1989.
The Stanford GraphBase: A Platform for Combinatorial AlgorithmsDonald E. Knuth. soda 1993: 41-43
Analysis of a Simple Factorization AlgorithmDonald E. Knuth, Luis Trabb Pardo. TCS, 3(3):321-348, 1976.
Problem 11264Donald E. Knuth. tamm, 114(1):77, 2007. [doi]
A Combinatorial Maximum: 11142Donald E. Knuth, Roberto Tauraso. tamm, 114(4):361-362, 2007. [doi]
Cube-Free Sums: 11078Donald E. Knuth, Robin Chapman. tamm, 113(4):368-369, 2006. [doi]
Deciphering a linear congruential encryptionDonald E. Knuth. TIT, 31(1):49-52, 1985.
Permutations with nonnegative partial sumsDonald E. Knuth. DM, 5(4):367-371, 1973. [doi]
An Imaginary Number SystemDonald E. Knuth. CACM, 3(4):245-247, 1960. [doi]
The Joys of the AsymptoticsDonald E. Knuth. hercma 2002: 1
Mini-Indexes for Literate ProgramsDonald E. Knuth. stp, 15(1):2-11, 1994.
Algorithms in modern mathematics and computer scienceDonald E. Knuth. ershov 1981: 82-99
Notes on Avoiding go to StatementsDonald E. Knuth, Robert W. Floyd. ipl, 1(1):23-31, 1971.
Digital typographyDonald E. Knuth. Volume 78 of CSLI lecture notes series, Cambridge University Press, 1999.
Errata: Notes on Avoiding go to StatementsDonald E. Knuth, Robert W. Floyd. ipl, 1(4):177, 1972.
Inhomogeneous sortingA. V. Anisimov, Donald E. Knuth. ijpp, 8(4):255-260, 1979. [doi]
Axioms and HullsDonald E. Knuth. Volume 606 of Lecture Notes in Computer Science, Springer, 1992.
Semantics of Context-Free LanguagesDonald E. Knuth. mst, 2(2):127-145, 1968. [doi]
Length of strings for a merge sortDonald E. Knuth. CACM, 6(11):685-688, 1963. [doi]
The Art of Computer Programming, Volume II: Seminumerical AlgorithmsDonald E. Knuth. Addison-Wesley, 1969.
Fibonacci in Complex Camouflage: 10858Donald E. Knuth, Robin Chapman. tamm, 111(2):166-167, 2004. [doi]
Stable HusbandsDonald E. Knuth, Rajeev Motwani, Boris Pittel. rsa, 1(1):1-14, 1990.
Von Neumann s First Computer ProgramDonald E. Knuth. ACM Comput. Surv., 2(4):247-260, 1970.
Satisfiability and The Art of Computer ProgrammingDonald E. Knuth. sat 2012: 15 [doi]
Products of Transpositions: 10913Donald E. Knuth, Reiner Martin. tamm, 110(9):844-845, 2003. [doi]
Randomized Incremental Construction of Delaunay and Voronoi DiagramsLeonidas J. Guibas, Donald E. Knuth, Micha Sharir. icalp 1990: 414-431
Recounting the Rationals, Continued: 10906Donald E. Knuth, C. P. Rupert, Alex Smith, Richard Stong. tamm, 110(7):642-643, 2003. [doi]
The Probability of Being in a State: 10726Donald E. Knuth, Darin Stephenson. tamm, 107(5):469-470, 2000. [doi]
The Art of Computer Programming, Volume I: Fundamental AlgorithmsDonald E. Knuth. Addison-Wesley, 1968.
Problem 11142Donald E. Knuth. tamm, 112(3):273-274, 2005. [doi]
Concrete Mathematics: A Foundation for Computer Science, 2nd EdRonald L. Graham, Donald E. Knuth, Oren Patashnik. Addison-Wesley, 1994. [doi]
Bottom-up educationDonald E. Knuth. iticse 2003: 2 [doi]
The Real Numbers, Algebraically: 10689Donald E. Knuth, Vaughan R. Pratt, O. P. Lossers. tamm, 107(8):755, 2000. [doi]
Problem 10858Donald E. Knuth. tamm, 108(3):271, 2001. [doi]
Literate ProgrammingDonald E. Knuth. cj, 27(2):97-111, 1984.
An Experiment in Optimal SortingDonald E. Knuth, E. B. Kaehler. ipl, 1(4):173-176, 1972.
The Birth of the Giant ComponentSvante Janson, Donald E. Knuth, Tomasz Luczak, Boris Pittel. rsa, 4(3):233-359, 1993.
Problem 10913Donald E. Knuth. tamm, 108(10):977, 2001. [doi]
Two-Way RoundingDonald E. Knuth. siamdm, 8(2):281-290, 1995. [doi]
TeX: The ProgramDonald E. Knuth. Addison-Wesley, 1986.
The Genesis of Attribute GrammarsDonald E. Knuth. waga 1990: 1-12
SOLߞA Symbolic Language for General-Purpose Systems SimulationDonald E. Knuth, J. L. McNeley. TC, 13(4):401-408, 1964. [doi]
Robert W Floyd, In MemoriamDonald E. Knuth. sigact, 34(4):3-13, 2003. [doi]
The CWEB system of structured documentation - version 3.0Donald E. Knuth, Silvio Levy. Addison-Wesley, 1994.
Selected papers on computer scienceDonald E. Knuth. Volume 59 of CSLI lecture notes series, CSLI, 1996.
On the Translation of Languages from Left to RigthDonald E. Knuth. iandc, 8(6):607-639, December 1965.
Selected papers on computer languagesDonald E. Knuth. Volume 139 of CSLI lecture notes series, CSLI Publications, 2003.
Textbook Examples of RecursionDonald E. Knuth. BIRTHDAY 1991: 207-229 [doi]
The Sandwich TheoremDonald E. Knuth. combinatorics, 1, 1994. [doi]
Mathematical Analysis of AlgorithmsDonald E. Knuth. ifip 1971: 19-27
Reversal by Swaps: 11264 [2007, 77]Donald E. Knuth, Richard Stong. tamm, 116(3):277-278, 2009. [doi]
Problem 11274Donald E. Knuth. tamm, 114(2):165, 2007. [doi]
A Generalization of Dijkstra s AlgorithmDonald E. Knuth. ipl, 6(1):1-5, 1977.
Letters to the editor: three letters on mergingDonald E. Knuth, Martin A. Goetz. CACM, 6(10):585, 1963. [doi]
Lexicographic permutations with restrictionsDonald E. Knuth. DAM, 1(1-2):117-125, 1979. [doi]
A Stirling Series: 10832Donald E. Knuth, Cecil C. Rousseau. tamm, 108(9):877-878, 2001. [doi]
Huffman s Algorithm via AlgebraDonald E. Knuth. JCT, 32(2):216-224, 1982.
Min-Plus Matrix Multiplication: 10834Sung-Soo Kim, Richard Johnsonbaugh, Ronald E. Prather, Donald E. Knuth. tamm, 109(8):763-764, 2002. [doi]
MMIXware, A RISC Computer for the Third MillenniumDonald E. Knuth. Volume 1750 of Lecture Notes in Computer Science, Springer, 1999.
The TeXbookDonald E. Knuth. Addison-Wesley, 1986.
Highly Variable Lists: 10691Donald E. Knuth, Allan Pedersen. tamm, 110(1):59-60, 2003. [doi]
Perfect Parity Patterns: 11243Donald E. Knuth, Robin Chapman, Reiner Martin. tamm, 115(7):668-670, 2008. [doi]
Programming Language for AutomataDonald E. Knuth, Richard H. Bigelow. JACM, 14(4):615-635, 1967. [doi]
A Fibonacci-Lucas Extremum: 10825Carl Miller, Donald E. Knuth. tamm, 109(8):762-763, 2002. [doi]
Problem 10875Donald E. Knuth. tamm, 108(5):469, 2001. [doi]
Efficient representation of perm groupsDonald E. Knuth. combinatorica, 11(1):33-43, 1991.
Near-deBruijn Cycles: 11336 [2008, 71]Donald E. Knuth, et al.. tamm, 116(9):848-849, 2009. [doi]
Overlapping PfaffiansDonald E. Knuth. combinatorics, 3(2), 1996. [doi]
Concrete mathematics - a foundation for computer scienceRonald L. Graham, Donald E. Knuth, Oren Patashnik. Addison-Wesley, 1989.
Efficient balanced codesDonald E. Knuth. TIT, 32(1):51-53, 1986.
Analysis of the subtractive algorithm for greatest common divisorsAndrew Chi-Chih Yao, Donald E. Knuth. cca, 10(2):9-13, 1976. [doi]
Partitions of a Circular Set: 11151Donald E. Knuth, O. P. Lossers. tamm, 114(3):265-266, 2007. [doi]
Context-Free MultilanguagesDonald E. Knuth. BIRTHDAY 1992: 1-13

All Publications

Filter by Year

Filter by Type

Filter by Topic

Filter by Venue

Filter by Co-author

Filter by Top terms

Download

External Links

Profile Name

Statistics

Aliases

Researchr

Donald E. Knuth's Profile

Unidentified Publications