generated by bibbase.org
  2012 (2)
An Algorithmic View of the Universe. Papadimitriou, C. H.; Adleman, L. M.; Karp, R. M.; Knuth, D. E.; Tarjan, R. E.; and Valiant, L. G. In ACM Turing Centenary Celebration, ACM-TURING '12, San Francisco, California, USA, June 15-16, 2012, pages 13:1, 2012. ACM
An Algorithmic View of the Universe [link]Paper   doi   link   bibtex  
Satisfiability and The Art of Computer Programming. Knuth, D. E. In Cimatti, A.; and Sebastiani, R., editor(s), Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings, volume 7317, of Lecture Notes in Computer Science, pages 15, 2012. Springer
Satisfiability and The Art of Computer Programming [link]Paper   doi   link   bibtex  
  1993 (1)
The Stanford GraphBase: A Platform for Combinatorial Algorithms. Knuth, D. E. In Ramachandran, V., editor(s), Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA, pages 41–43, 1993. ACM/SIAM
The Stanford GraphBase: A Platform for Combinatorial Algorithms [link]Paper   link   bibtex  
  1981 (1)
Algorithms in Modern Mathematics and Computer Science, Proceedings, Urgench, Uzbek SSR, USSR, September 16-22, 1979. Ershov, A. P.; and Knuth, D. E., editors. Volume 122, of Lecture Notes in Computer Science.Springer. 1981.
Algorithms in Modern Mathematics and Computer Science, Proceedings, Urgench, Uzbek SSR, USSR, September 16-22, 1979 [link]Paper   doi   link   bibtex  
  1977 (1)
Fast Pattern Matching in Strings. Knuth, D. E.; Jr., J. H. M.; and Pratt, V. R. SIAM J. Comput., 6(2): 323–350. 1977.
Fast Pattern Matching in Strings [link]Paper   doi   link   bibtex  
  1975 (1)
An Analysis of Alpha-Beta Pruning. Knuth, D. E.; and Moore, R. W. Artif. Intell., 6(4): 293–326. 1975.
An Analysis of Alpha-Beta Pruning [link]Paper   doi   link   bibtex  
  1973 (1)
The Art of Computer Programming, Volume III: Sorting and Searching. Knuth, D. E. Addison-Wesley, 1973.
link   bibtex  
  1971 (2)
Examples of formal semantics. Knuth, D. E. In Engeler, E., editor(s), Symposium on Semantics of Algorithmic Languages, volume 188, of Lecture Notes in Mathematics, pages 212–235. Springer, 1971.
Examples of formal semantics [link]Paper   doi   link   bibtex  
Mathematical Analysis of Algorithms. Knuth, D. E. In Freiman, C. V.; Griffith, J. E.; and Rosenfeld, J. L., editor(s), Information Processing, Proceedings of IFIP Congress 1971, Volume 1 - Foundations and Systems, Ljubljana, Yugoslavia, August 23-28, 1971, pages 19–27, 1971. North-Holland
link   bibtex  
  1968 (2)
The Art of Computer Programming, Volume I: Fundamental Algorithms. Knuth, D. E. Addison-Wesley, 1968.
link   bibtex  
Semantics of Context-Free Languages. Knuth, D. E. Math. Syst. Theory, 2(2): 127–145. 1968.
Semantics of Context-Free Languages [link]Paper   doi   link   bibtex