Остановите войну!
for scientists:
default search action
Donald E. Knuth
- > Home > Persons > Donald E. Knuth
Publications
- 2012
- [c15]Christos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant:
An Algorithmic View of the Universe. ACM-TURING 2012: 13:1 - 2009
- [j137]Donald E. Knuth, Richard Stong:
Reversal by Swaps: 11264 [2007, 77]. Am. Math. Mon. 116(3): 277-278 (2009) - [j134]Donald E. Knuth, O. P. Lossers:
Solving a Recurrence by Binary Expansion: 11320 [2007, 835]. Am. Math. Mon. 116(7): 649 (2009) - [j133]Donald E. Knuth, et al.:
Near-deBruijn Cycles: 11336 [2008, 71]. Am. Math. Mon. 116(9): 848-849 (2009) - 2008
- [j130]Donald E. Knuth, Robin Chapman, Reiner Martin:
Perfect Parity Patterns: 11243. Am. Math. Mon. 115(7): 668-670 (2008) - 2007
- [j127]Donald E. Knuth, O. P. Lossers:
Partitions of a Circular Set: 11151. Am. Math. Mon. 114(3): 265-266 (2007) - [j126]Donald E. Knuth, Roberto Tauraso:
A Combinatorial Maximum: 11142. Am. Math. Mon. 114(4): 361-362 (2007) - 2006
- [j124]Donald E. Knuth, Robin Chapman:
Cube-Free Sums: 11078. Am. Math. Mon. 113(4): 368-369 (2006) - 2005
- [j121]Donald E. Knuth, Silvia Fernández, Gerry Myerson:
A Modular Triple: 11021. Am. Math. Mon. 112(3): 279-280 (2005) - 2004
- [j119]Donald E. Knuth, Robin Chapman:
Fibonacci in Complex Camouflage: 10858. Am. Math. Mon. 111(2): 166-167 (2004) - [j117]Donald E. Knuth, et al.:
Some Bernstein Polynomials: 10985. Am. Math. Mon. 111(5): 447 (2004) - 2003
- [j113]Donald E. Knuth, O. P. Lossers:
Exploring All Binary Mazes: 10720. Am. Math. Mon. 110(1): 60-61 (2003) - [j111]Donald E. Knuth, Richard Stong:
Animals in a Cage: 10875. Am. Math. Mon. 110(3): 243-245 (2003) - [j110]Donald E. Knuth, C. P. Rupert, Alex Smith, Richard Stong:
Recounting the Rationals, Continued: 10906. Am. Math. Mon. 110(7): 642-643 (2003) - [j109]Donald E. Knuth, Reiner Martin:
Products of Transpositions: 10913. Am. Math. Mon. 110(9): 844-845 (2003) - 2001
- [j101]Mark E. Kidwell, Donald E. Knuth, O. P. Lossers:
Leaves of Ordered Trees: 10757. Am. Math. Mon. 108(9): 874-875 (2001) - 2000
- [j97]Donald E. Knuth, Vaughan R. Pratt, O. P. Lossers:
The Real Numbers, Algebraically: 10689. Am. Math. Mon. 107(8): 755 (2000) - 1997
- [j94]Svante Janson, Donald E. Knuth:
Shellsort with three increments. Random Struct. Algorithms 10(1-2): 125-142 (1997) - [c10]Robert M. Corless, David J. Jeffrey, Donald E. Knuth:
A Sequence of Series for the Lambert W Function. ISSAC 1997: 197-204 - 1996
- [j93]Robert M. Corless, Gaston H. Gonnet, D. E. G. Hare, David J. Jeffrey, Donald E. Knuth:
On the LambertW function. Adv. Comput. Math. 5(1): 329-359 (1996) - 1994
- [b17]Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete Mathematics: A Foundation for Computer Science, 2nd Ed. Addison-Wesley 1994, ISBN 0-201-55802-5 - [b15]Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete mathematics - a foundation for computer science (2. ed.). Addison-Wesley 1994, ISBN 978-0-201-55802-9, pp. I-XIII, 1-657 - 1993
- [j85]Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris G. Pittel:
The Birth of the Giant Component. Random Struct. Algorithms 4(3): 233-359 (1993) - 1992
- [j84]Leonidas J. Guibas, Donald E. Knuth, Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams. Algorithmica 7(4): 381-413 (1992) - [j83]Donald E. Knuth, Arvind Raghunathan:
The Problem of Compatible Representatives. SIAM J. Discret. Math. 5(3): 422-427 (1992) - 1990
- [j78]Richard Garfield, Donald E. Knuth, Herbert S. Wilf:
A bijection for ordered factorizations. J. Comb. Theory, Ser. A 54(2): 317-318 (1990) - [j77]Donald E. Knuth, Rajeev Motwani, Boris G. Pittel:
Stable Husbands. Random Struct. Algorithms 1(1): 1-14 (1990) - [j76]Robert W. Floyd, Donald E. Knuth:
Addition Machines. SIAM J. Comput. 19(2): 329-340 (1990) - [c6]Leonidas J. Guibas, Donald E. Knuth, Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams. ICALP 1990: 414-431 - [c5]Donald E. Knuth, Rajeev Motwani, Boris G. Pittel:
Stable Husbands. SODA 1990: 397-404 - 1989
- [b10]Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete mathematics - a foundation for computer science. Addison-Wesley 1989, ISBN 978-0-201-14236-5, pp. I-XIII, 1-623 - [j75]Philippe Flajolet, Donald E. Knuth, Boris G. Pittel:
The first cycles in an evolving graph. Discret. Math. 75(1-3): 167-215 (1989) - 1981
- [j61]Donald E. Knuth, Michael F. Plass:
Breaking Paragraphs into Lines. Softw. Pract. Exp. 11(11): 1119-1184 (1981) - 1977
- [j55]Donald E. Knuth, James H. Morris Jr., Vaughan R. Pratt:
Fast Pattern Matching in Strings. SIAM J. Comput. 6(2): 323-350 (1977) - 1976
- [j52]Andrew Chi-Chih Yao, Donald E. Knuth:
Analysis of the subtractive algorithm for greatest common divisors. SIGSAM Bull. 10(2): 9-13 (1976) - [j50]Donald E. Knuth, Luis Trabb Pardo:
Analysis of a Simple Factorization Algorithm. Theor. Comput. Sci. 3(3): 321-348 (1976) - 1974
- [j40]Donald E. Knuth, Jayme Luiz Szwarcfiter:
A Structured Program to Generate all Topological Sorting Arrangements. Inf. Process. Lett. 2(6): 153-157 (1974) - [j39]Donald E. Knuth, Jayme Luiz Szwarcfiter:
Erratum: A Structured Program to Generate all Topological Sorting Arrangements. Inf. Process. Lett. 3(2): 64 (1974) - 1972
- [j32]Ronald L. Graham, Donald E. Knuth, Theodore S. Motzkin:
Complements and transitive closures. Discret. Math. 2(1): 17-29 (1972) - [j30]Donald E. Knuth, Robert W. Floyd:
Errata: Notes on Avoiding "go to" Statements. Inf. Process. Lett. 1(4): 177 (1972) - [j29]Edward A. Bender, Donald E. Knuth:
Enumeration of Plane Partitions. J. Comb. Theory, Ser. A 13(1): 40-54 (1972) - 1971
- [j26]Donald E. Knuth, Robert W. Floyd:
Notes on Avoiding "go to" Statements. Inf. Process. Lett. 1(1): 23-31 (1971)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint