Tree of Don Knuth students for the Computer History Exhibits

Last updated 10 Feb. 2003. We'd like to add current locations and email, and second and further level students. A major update was provided by Vaughan Pratt. Send updates by email to: gio at cs.stanford.edu (Gio Wiederhold).

Professor Donald Erwin Knuth (at Stanford 1969-today)

Mathematics Genealogy for Don Knuth, showing
Ancestor Lie -> Thue -> Skolem -> Ore -> Hall -> Knuth ->Pratt -> Harel (more below)
LocationNorwayNorwayOsloYaleYaleCaltechStanfordMIT
year of PhD1872~1884~1912~19261936196319721978
# students411622281210
# descendants290166165164143612513
and continuing, see below, through at least two more generations.

Students of Professor Knuth (most at Stanford)

    year-of-PhD Name "thesis" (last known location <email>)
  1. 1969? R. Stockton Gaines [EE Princeton] co advisor with Peter Winners (IDA, ISI, 1995 Acorn <>)
  2. 1971 Wayne Theodore Wilner, ``Declarative Semantic Definition'' (Adminstaff, Kingwood TX, <drwtwilner at hotmail.com>)
  3. 1972. Vaughan Ronald Pratt, ``Shellsort and Sorting Networks'' (MIT, 1980 Stanford Univ., emeritus 2000 <pratt at cs.stanford.edu >)
      Professor Pratt, MIT, Stanford
      At MIT
    1. 1978 David Harel, MIT, ``Logics of programs: axiomatics and descriptive power'' (Weizmann, <harel at wisdom.weizmann.ac.il>)
        Professor Harel, Weizmann Institute
      1. 1985 Rivka Zarhy-Sherman - coadvisor: Amir Pnueli, Weizmann Inst., ``On variants of propositional program logics''( < >)
      2. 1986 Yishai Feldman, Weizmann Institute, ``Enriched analysis of protein structure'' (IDC Herzliya, <yishai at idc.ac.il>)
          Professor Yishai Feldman
        1. 1997 Vered Gafni, Tel Aviv ``MASS/PLOT, A Specification Framework for Real-Time Systems'' ( < >)
      3. 1986 David Peleg, Weizmann Institute, ``The schematology and logic of concurrent programs'' (Weizmann, <peleg at wisdom.weizmann.ac.il>)
          Professor Peleg
        1. 1994 Guy Kortsarz, Weizmann Institute, ``Algorithm techniques for combinatorial approximation''
        2. 1997 Avishai Wool, Weizmann Institute, ``Quorum systems for distributed control protocols''
      4. 1989 Doron Drusinsky, Weizmann Institute, ``On synchronized statecharts'' ( < >)
      5. 1991 Ron Unger, Weizmann Institute, ``Enriched analysis of protein structure''( < >)
      6. 1992 Rafi Heiman, Weizmann Institute, ``Randomized decision tree complexity for read-once Boolean functions'' ( < >)
      7. 1994 Yosee Feldman, Weizmann Institute, ``Animation of concurrent computation'' ( < >)
      8. 1996 Tirza Hirst, Weizmann Institute, ``Topics on infinite recursive structures'' ( < >)
      9. 1996 Danny Raz, Weizmann Institute, ``On the Power of Commuting''
      10. 1997 Eli Singerman, Weizmann Institute, ``Results on propositional logics of programs'' ( < >)
    2. 1981 Bob Street, ``Propositional Dynamic Logic and the Divergence of Programs'', MIT -- coadvisor: Albert Meyer (Stanford) .
      At Stanford
    3. 1984 Jay Gischer, ``Partial orders and the axiomatic theory of shuffle'', Stanford ( < >) .
    4. 1991 Ross Casley, ``On the specification of concurrent systems'', Stanford ( < >) .
    5. 1991 Roger Crew, ``Metric process models'', Stanford ( <crew at cs.stanford.edu>) .
    6. 1992 Orli Waarts, ``New algorithms and primitives for multiprocessor coordination'', Stanford ( < >) .
    7. 1994 Gideon Avrahami, ``Identification and analysis of curves in digital images'', Stanford ( <gidi at franklin.com>).
    8. 1994 David Magerman, ``Natural language parsing as statistical pattern recognition'', Stanford -- coadvisor: Fred Jelinek ( <magerman at rentec.com>).
    9. 1994 Vineet Gupta, ``Chu spaces as a model of concurrency'', Stanford ( <vineet at stratify.com>) .
    10. 1997 Anna Patterson, ``Logic of constructive duality'', U. Illinois -- coadvisor: Gul Aga ( ) .
    11. 1999 Paul Fahn, ``Measuring information efficiency by bounded oracle computation'', - coadvisor: Tom Cover (<fahn at fahn.com>)
    12. 2001 Parham Aarabi [EE, CIS] - coadvisor: Bernard Widrow ``Spatial integration and localization of dynamic sensors''
        Professor Aarabi Univ. Toronto
      1. 2006 Guangji Shi, "Phase Based Speech Processing" ( < >).
    13. 2003 Ramon Prieto [EE] - coadvisor: Bernard Widrow ''Classification of Phonemes Using Pitch Synchronous Glottal Cycle Analysis", ( <rprieto at cs.stanford.edu@gt;)
  4. 1972 Clark Allan Crane, ``Linear Lists and Priority Queues as Balanced Binary Trees'' ( < >)
  5. 1972. Isu Fang, ``FOLDS, A Declarative Formal Language Definition System'' ( < >)
  6. 1972 Michael Lawrence Fredman, ``Growth Properties of a Class of Recursively Defined Functions'' (UCSD, Rutgers Univ. < >)
      Professor Fredman, UC San Diego
    1. 1992 Bing Xioa ( < >) at Rutgers
    2. 1994 Haripriyan K. Hampapuram ( < >)
    3. 2001 Amr Elmasry (2002 Alexandria Univ. < >)
        Prof. Elmasry, Alexandria Univ.
      1. to come
    4. 2001 John Iacono ( < >)
  7. 1974 Richard Lee Sites, ``Proving that Computer Programs Terminate Cleanly'' (DEC < >)
  8. 1975 Gary Don Knott, ``Deletion in Binary Storage Trees'' (NIH < >)
    1. 19xx S. K. Bhaskar (co-advised with Hanan Samet) ( < >)
  9. 1975 Edwin Hallowell Satterthwaite, Jr. -- with Niklaus Wirth ``Source Language Debugging Tools'' ( < >)
  10. 1975 Robert Sedgewick, ``Quicksort'' (Brown, Princeton <rs at cs.princeton.edu>
      Professor Sedgewick, 1975 Brown Univ., Princeton since 1985
    1. 1987 Mark Weiss (FIU <>)
    2. 1990 Mordecai Golin (INRIA, HKUST <>)
        Prof. Golin, Hong Kong Univ. of Science and Tech.
      1. 2000 Wai Fong (<>)
    3. 1990 Sarantos Kapidakis (<>)
    4. 1992 Russel Schaffer (<>)
  11. 1976 Leonidas Ioannis Guibas, ``The Analysis of Hashing Algorithms'' (Stanford Univ. since 1984 <guibas at cs.stanford.edu>).
      Professor Guibas, Stanford:
    1. ~1989 John Hershberger (Mentor Graphics < >)
    2. ~1993 Jack Snoeyink (UNC <snoeyink at cs.unc.edu>)
    3. ~1987 Jorge Stolfi (Univ. of Campinas, Brazil <stolfi at dcc.unicamp.br>)
    4. 1991 David Salesin (Un. of Washington and Microsoft Research <salesin at cs.washington.edu>)
    5. 1997 Eric Veach (Pixar, Google < >)
    6. 2001 Menelaos Karavelas (SCCM) (Notre Dame Univ. <mkaravel at cse.nd.edu>)
  12. 1977 Mark Robbin Brown, ``The Analysis of a Practical and Nearly Optimal Priority Queue'' (Netscape < >)
  13. 1977 Richard Eric Sweet - with Cordell Green, ``Empirical Estimates of Program Entropy'' ( < >)
  14. 1977 John Fredrick Reiser, ``Analysis of Additive Random Number Generators'' ( < >)
  15. 1977 Bernard Marcel Mont-Reynaud, ``Hierarchical Properties of Flows, and the Determination of Inner Loops''( < >)
  16. 1978 Luis Isidoro Trabb Pardo, ``Set Representation and Set Intersection'' (PLX < >)
  17. 1979 Lyle Harold Ramshaw, ``Formalizing the Analysis of Algorithms'' ( < >)
  18. 1980 Christopher John Van Wyk, ``A Language for Typesetting Graphics'' (Drew Univ., NJ, <cvanwyk at drew.edu>).
  19. 1980 Jeffrey Scott Vitter, ``Analysis of Coalesced Hashing'' (Purdue Univ. <jsv at Purdue.edu>)
      Professor Vitter, 1980 Brown Univ., 1993 Duke Univ., 2002 Purdue Univ.
    1. at Brown
      1985 Wen-Chin Chen (National Taiwan University <wcchen at csie.ntu.edu.tw>)
        Professor Chen, National Taiwan University
      1. 1990 K. L. Chung (Nat. Univ. of Sc&Tech <klching at csie.ntust.edu.tw>:)
      2. 1997 L. H. Wang (Alethia Univ. <wanglh at email.au.edu.tw>)
      3. 1997 A. K. Shiah (Cyberlink <Ak_shiah at gocyberlink.com>)
      4. 2000 S.-S Yu (National ChiNan Univ. <ssyu at ncnu.edu.tw>)
      5. 2001 K. N. Chang (National ChiNan Univ. <klim at ncnu.edu.tw>)
      6. 2002 D. R. Liu (Setabox <drliu at setabox.com.tw>)
      7. 2003 M. J. Shieh (Cyberlink <mj_shieh at gocyberlink.com>)
    2. 1992 Jyh-Han Lin (Motorola <EJL007 at motorola.com>)
    3. 1993 Paul Howard (AT&T Research, Microway <paulhoward at microway.com>)
    4. 1993 Mark H. Nodine (Motorola <mnodine at acm.org>)
    5. 1995 Sai Subramanian (Nortel Networks, Navini <sai at navini.com>)
    6. 1995 P. Krishnan (Lucent Bell Labs, Avaya <pk at research.avayalabs.com>)
    7. 1997 Darren Vengroff (Pelago <vengroff at pelago.com>)
    8. 1997 Dzung Hoang (Sony, Conexant <dthoang at yahoo.com >)
    9. 1999 T. M. Murali (Virginia Tech Univ. <murali at cs.vt.edu>)
    10. at Duke
      1998 Rakesh Barve (Veveo <rakesh at veveo.tv>)
    11. 1999 Min Wang (IBM <min at us.ibm.com>)
    12. 2001 Apostol (Paul) Natsev (IBM <natsev at us.ibm.com>)
    13. 2001 Tavi Procopiuc (Google <tavi at google.com>)
    14. 2004 Lipyeow Lim (IBM <liplim at us.ibm.com>)
  20. 1981 Michael Frederick Plass, ``Optimal Pagination Techniques for Automatic Typesetting Systems'' ( < >)
  21. 1982 Ignacio Andres Zabala Salelles [not in CS list], ``Interacting with Graphic Objects'' ( < >)
  22. 1983 Daniel Hill Greene, ``Labelled Formal Languages and Their Uses'' ( < >)
  23. 1983 Franklin Mark Liang, ``Word Hy-phen-a-tion by Com-put-er'' ( < >)
  24. 1985 Andrei Zary Broder, ``Weighted Random Mappings'' (IBM Watson Labs. < >)
  25. 1985 John Douglas Hobby, ``Digitized Brush Trajectories'' ( < >)
  26. 1987 Scott Edward Kim, ``Viewpoint: Toward a Computer for Visual Thinkers'' ( < >)
  27. 1989 Pang-Chieh Chen, ``Heuristic Sampling in Backtrack Trees'' ( < >)
  28. 1990 Ramsey Wadi Haddad, ``Triangularization: A Two-Processor Scheduling Problem'' ( < >)
  29. 1991 Tomas Feder, ``Stable Networks and Product Graphs'' ( < >)
Up one level to Old-timers
Back to Root of the Student Trees or to the main page for the Exhibits