Academic genealogy of computer scientists

From Wikipedia, the free encyclopedia
Jump to: navigation, search

The following is an academic genealogy of computer scientists and is constructed by following the pedigree of thesis advisors.

Smaller text indicates advisors or advisees specialized in a field unrelated to computer science.





Many French computer scientists worked at the National Institute for Research in Computer Science and Control (INRIA).




Van Wijngaarden / Dijkstra[edit]

Adriaan van Wijngaarden was director of the computer science department at the Centrum Wiskunde & Informatica. It was influential in the development of ALGOL 68.

Brouwer / Van Dalen[edit]

Several of the students of Dirk van Dalen, a descendant of Brouwer, became the first Dutch theoretical computer scientists, which still has a strong focus on lambda calculus, rewrite systems and functional programming.

  • Luitzen Egbertus Jan Brouwer (1907: Over de grondslagen der wiskunde. Universiteit van Amsterdam)
    • Arend Heyting (1925: Intuitionistische axiomatiek der projectieve meetkunde. Universiteit van Amsterdam)
      • Dirk van Dalen (1963: Extension Problems in Intuitionistic Plane Projective Geometry. Universiteit van Amsterdam)
        • Henk Barendregt (1971: Some Extensional Terms for Combinatory Logics and Lambda-Calculi. Universiteit Utrecht)
        • Jan van Leeuwen (1972: Rule-Labeled Programs: A Study of a Generalization of Context-Free Grammars and Some Classes of Formal Languages. Universiteit Utrecht)
          • Mark Overmars (1983: The Design of Dynamic Data Structures. Universiteit Utrecht)
            • Mark de Berg (1992: Efficient Algorithms for Ray Shooting and Hidden Surface Removal. Universiteit Utrecht)
            • Marc van Kreveld (1992: New Results on Data Structures in Computational Geometry. Universiteit Utrecht)
          • Hans Bodlaender (1986: Distributed Computing - Structure and Complexity. Universiteit Utrecht)
          • Harry Wijshoff (1987: Data Organization in Parallel Computers. Universiteit Utrecht)
          • Gerard Tel (1989: The Structure of Distributed Algorithms. Universiteit Utrecht)
        • Jan Bergstra (1976: Computability and Continuity in Finite Types. Universiteit Utrecht)
          • Frits Vaandrager (1990: Algebraic Techniques for Concurrency and Their Application. Universiteit van Amsterdam)
          • Linda van der Gaag (1990: Probability-Based Models for Plausible Reasoning. Universiteit van Amsterdam)
          • Chris Verhoef (1990: Linear unary operators in process algebra. Universiteit van Amsterdam)
          • Jan Friso Groote (1991: Process Algebra and Structured Operational Semantics. Universiteit van Amsterdam)
          • Wan Fokkink (1994: Clocks, Trees and Stars in Process Theory. Universiteit van Amsterdam)
          • Jaco van de Pol (1996: Termination of Higher-Order Rewrite Systems. Universiteit Utrecht) (Secondary advisor: Marc Bezem)
        • Jan Willem Klop (1980: Combinatory reduction systems. Universiteit Utrecht)
          • Vincent van Oostrom (1994: Confluence for Abstract and Higher-Order Rewriting. Vrije Universiteit Amsterdam)
        • Albert Visser (1981: Aspects of Diagonalization & Provability. Universiteit Utrecht)
        • Wim Ruitenburg (1982: Intuitionistic Algebra, Theory and Sheaf Models. Universiteit Utrecht)
        • Catholijn Jonker (1994: Constraints and Negations in Logic Programming. Universiteit Utrecht) (Secondary advisor: Jan van Leeuwen)
      • Anne Sjerp Troelstra (1966: Intuitionistic General Topology. Universiteit van Amsterdam)
        • Gerard R. Renardel de Lavalette (1985: Theories with Type-free Application and Extended Bar Induction. Universiteit van Amsterdam)
        • Ieke Moerdijk (1985: Topics in Intuitionism and Topos Theory. Universiteit van Amsterdam)
        • Marc Bezem (1986: Bar recursion and functionals of finite type. Universiteit Utrecht) (Secondary advisor: Dirk van Dalen)




United Kingdom[edit]


Rod Burstall was one of the founders of the Laboratory for Foundations of Computer Science at the University of Edinburgh.


Maurice Wilkes was the first head of the University of Cambridge Computer Laboratory

Robin Milner never did a Ph.D.


Christopher Strachey was the first Professor of Computation at Oxford.

Tony Hoare established the undergraduate computer science course and led the Oxford University Computing Laboratory for many years.


North America[edit]



Hopcroft / Lefschetz[edit]

California Institute of Technology[edit]




Bob Floyd never received a PhD, although he worked closely with Donald Knuth on The Art of Computer Programming.




  • Emory Leon Chaffee ((year unknown): (dissertation title unknown). )
    • Howard Aiken ((year unknown): (dissertation title unknown). )
      • Gerrit Blaauw ((year unknown): (dissertation title unknown). )
      • Fred Brooks (1956: The Analytic Design of Automatic Data Processing Systems. )
      • Anthony Oettinger (1954: A Study for the Design of an Automatic Dictionary. )
        • William Hines Bossert ((year unknown): (dissertation title unknown). )
        • Sheila Greibach (1963: Inverses of Phrase Structure Generators. Harvard University)
          • Ronald Book ( : Grammars with Time Functions. )
          • Michael J. Fischer ((year unknown): (dissertation title unknown). )
          • Jean Gallier (1978: Semantics and Correctness of Classes of Deterministic and Nondeterministic Recursive Programs. University of California, Los Angeles)
            • Wayne Snyder (1988: Complete Sets of Transformations for General Unification. University of Pennsylvania)
        • Richard Karp (1959: Some Applications of Logical Syntax to Digital Computer Programming. Harvard University)
          • Robert Keller (computer scientist) (1970: Closures of Parallel Program Schemata. University of California, Berkeley)
            • Paul Hudak (1982: Object and Task Reclamation in Distributed Applicative Processing Systems. University of Utah)
              • Kai Li ((year unknown): (dissertation title unknown). )
          • Kellogg Booth ((year unknown): (dissertation title unknown). )
          • Ron Shamir ((year unknown): (dissertation title unknown). )
          • Rajeev Motwani (1988: Probabilistic Analysis of Matching and network flow Algorithms. )
        • Eugene Lawler (1963: Some Aspects of Discrete Mathematical Programming. )
          • David Shmoys (1984: Approximation Algorithms for Problems in Sequencing, Scheduling, and Communication Network Design. )
          • Lee J. White (1967: A Parametric Study of Matchings and Coverings in Weighted Graphs. University of Michigan)
            • Sargur Srihari (1976: Comparative Evaluation of Stored Pattern Classifiers. The Ohio State University)
              • Venu Govindaraju (1992: Locating Faces in Newspaper Photographs. University at Buffalo)



See also[edit]


Further reading[edit]

External links[edit]