Open main menu

Wikipedia β

Academic genealogy of computer scientists

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.

Contents

EuropeEdit

DenmarkEdit

FinlandEdit

FranceEdit

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

GermanyEdit

ItalyEdit

NetherlandsEdit

Van Wijngaarden / DijkstraEdit

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

  • Cornelis Benjamin Biezeno (1933: honoris causa. Universiteit van Amsterdam)
    • Adriaan van Wijngaarden (1945: Enige toepassingen van Fourierintegralen op elastische problemen. Technische Universiteit Delft)
      • Willem van der Poel (1956: The Logical Principles of Some Simple Computers. Universiteit van Amsterdam)
      • Edsger Dijkstra (1959: Communication with an Automatic Computer. Universiteit van Amsterdam)
        • Nico Habermann (1967: On the Harmonious Co-operation of Abstract Machines. Technische Universiteit Eindhoven)
          • Lawrence Snyder (1973: An Analysis of Parameter Evalutation Mechanisms for Recursive Procedures. Carnegie Mellon University)
          • Tim Teitelbaum (1975: Minimal Distance Analysis of Syntax Errors in Computer Programs. Carnegie Mellon University)
          • Sten Andler (1979: Predicate Path Expressions: A High-level Synchronization Mechanism. Carnegie Mellon University)
          • John Ousterhout (1980: Partitioning and Cooperation in a Distributed Multiprocessor Operating System: MEDUSA. Carnegie Mellon University)
          • Philip Wadler (1984: Listlessness Is Better than Laziness: An Algorithm that Transforms Applicative Programs to Eliminate Intermediate Lists. Carnegie Mellon University) (Secondary advisor: Guy L. Steele, Jr.)
          • David Notkin (1984: Interactive Structure-Oriented Computing. Carnegie Mellon University)
        • Martin Rem (1976: Associons and the Closure Statement. Technische Universiteit Eindhoven) (Secondary advisor: Frans Kruseman Aretz)
          • Jan L. A. van de Snepscheut (1983: Trace Theory and VLSI Design. Technische Universiteit Eindhoven) (Secondary advisor: Edsger Dijkstra)
            • Peter Hilbers (1989: Mappings of Algorithms on Processor Networks. Rijksuniversiteit Groningen)
          • Jan Tijmen Udding (1984: Classification and Composition of Delay-Insensitive Circuits. Technische Universiteit Eindhoven) (Secondary advisor: Edsger Dijkstra)
          • Anne Kaldewaij (1986: A Formalism for Concurrent Processes. Technische Universiteit Eindhoven) (Secondary advisor: Frans Kruseman Aretz)
      • Guus Zoutendijk (1960: Methods of Feasible Directions : A Study in Lineair and Non-linear Programming. Universiteit van Amsterdam)
      • Jaco de Bakker (1967: Formal Definition of Programming Languages: with an Application to the Definition of ALGOL 60. Universiteit van Amsterdam)
        • Willem-Paul de Roever (1974: Recursive Program Schemes: Semantics and Proof Theory. Vrije Universiteit Amsterdam)
        • Paul Vitanyi (1978: Lindenmayer Systems: Structure, Languages, and Growth Functions. Vrije Universiteit Amsterdam) (Secondary advisor: Arto K. Salomaa)
          • Ronald Cramer (1997: Modular design of secure yet practical cryptographic protocols. Universiteit van Amsterdam) (Secondary advisor: Ivan Bjerre Damgård)
          • Peter Grünwald (1998: The minimum description length principle and reasoning under uncertainty. Universiteit van Amsterdam)
        • Anton Nijholt (1980: Context-Free Grammars : Covers, Normal Forms, and Parsing. Vrije Universiteit Amsterdam)
        • John-Jules Meyer (1985: Programming Calculi Based on Fixed Point Transformations: Semantics and Applications. Vrije Universiteit Amsterdam)
        • Joost Kok (1989: Semantic Models for Parallel Computation in Data Flow, Logic- and Object-Oriented Programming. Vrije Universiteit Amsterdam)
        • Jan Rutten (1989: A Parallel Object-Oriented Language: Design and Semantic Foundations. Vrije Universiteit Amsterdam)
        • Frank S. de Boer (1991: Reasoning about Dynamically Evolving Process Structures: A Proof Theory for the Parallel Object-0riented Language POOL. Vrije Universiteit Amsterdam)
        • Marcello Bonsangue (1996: Topological Dualities in Semantics. Vrije Universiteit Amsterdam) (Secondary advisor: Joost Kok)
      • Reinder van de Riet (1968: Algol 60 as Formula Manipulation Language. Universiteit van Amsterdam)
        • Peter Apers (1982: Query Processing and Data Allocation in Distributed Database Systems. Vrije Universiteit Amsterdam)
        • Martin L. Kersten (1985: A Model for a Secure Programming Environment. Vrije Universiteit Amsterdam) (Secondary advisor: Anthony Ira Wasserman)
          • Stefan Manegold (2002: Understanding, Modeling, and Improving Main-Memory Database Performance. Universiteit van Amsterdam)
        • Roel Wieringa (1990: Algebraic Foundations for Dynamic Conceptual Models. Vrije Universiteit Amsterdam)
        • Frances Brazier (1991: Design and Evaluation of a User Interface for Information Retrieval. Vrije Universiteit Amsterdam) (Primary advisor: Sipke D. Fokkema)
      • Hugo Brandt Corstius (1970: Exercises in Computational Linguistics. Universiteit van Amsterdam) (Secondary advisor: Frans Kruseman Aretz)
      • Maarten van Emden (1971: An Analysis of Complexity. Universiteit van Amsterdam)
      • Peter van Emde Boas (1974: Abstract Resource-Bound Classes. Universiteit van Amsterdam) (Secondary advisor: Pieter Cornelis Baayen)
        • Arjen Lenstra (1984: Polynomial Time Algorithms for the Factorization of Polynomials. Universiteit van Amsterdam)
        • Leen Torenvliet (1986: Structural Concepts in Relativised Hierarchies. Universiteit van Amsterdam)
        • Harry Buhrman (1993: Resource Bounded Reductions. Universiteit van Amsterdam) (Primary advisor: Steven Elliot Homer)
      • Herman te Riele (1976: A Computational Study of Generalized Aliquot Sequences. Universiteit van Amsterdam)
      • Dick Grune (1982: On the Design of ALEPH. Universiteit van Amsterdam) (Secondary advisor: Cornelis H. A. Koster)

Brouwer / Van DalenEdit

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)

NorwayEdit

PolandEdit

SwedenEdit

United KingdomEdit

EdinburghEdit

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

Chistopher Longuet-Higgins, Richard Gregory, and Donald Mitchie founded the Department of Machine Intelligence and Perception at the University of Edinburgh

CambridgeEdit

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

Robin Milner never did a Ph.D.

OxfordEdit

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.

WarwickEdit

North AmericaEdit

ChurchEdit

HarvardEdit

Hopcroft / LefschetzEdit

California Institute of TechnologyEdit

KnuthEdit

HartmanisEdit

FloydEdit

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

UllmanEdit

HilbertEdit

AikenEdit

  • 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)

StanfordEdit

OtherEdit

See alsoEdit

ReferencesEdit

Further readingEdit

External linksEdit