📜 Post with us on Reddit
📝 Create a new article
🏭 Create a company page
🇬🇧 - in English
🇫🇷 - en Français (FR)
🇵🇹 - em Português (PT)
🇩🇪 - auf Deutsch (DE)
🇯🇵 - 日本語で (JA)
Sponsored articles

You can edit almost every page by Creating an account and confirming your email.

Academic genealogy of computer scientists

From EverybodyWiki Bios & Wiki

This list is incomplete; you can help by expanding it.

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.

Europe

Denmark

Finland

France

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

Germany

Italy

Netherlands

Van Wijngaarden / Dijkstra

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)
        • Gerard Holzmann (1979: Coordination Problems in Multiprocessing Systems. Technische Universiteit Delft)
      • 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 Evaluation 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)
          • 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 Linear 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-Oriented 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 Dalen

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)
          • Hans van Ditmarsch (2000: Knowledge Games. Rijksuniversiteit Groningen) (Secondary advisor: Johan van Benthem)
        • 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)

Norway

Poland

Sweden

United Kingdom

Edinburgh

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

Robin Milner was co-founder of the Edinburgh Laboratory for Foundations of Computer Science despite never doing a Ph.D.

  • Robin Milner
    • Mads Tofte (1987: Operational Semantics and Polymorphic Type Inference. University of Edinburgh)
    • Faron Moller (1989: Axioms for Concurrency. University of Edinburgh)
    • Chris Tofts (1990: (dissertation title unknown). University of Edinburgh)
    • Davide Sangiorgi (1993: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. University of Edinburgh)

Cambridge

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

Oxford

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.

Warwick

North America

Church

Harvard

  • Alfred North Whitehead (1884: (dissertation title unknown). University of Cambridge)
    • Willard Van Orman Quine (1932: The Logic of Sequences: A Generalization of Principia Mathematica. Harvard University)
      • Hao Wang (academic) (1948: An Economical Ontology for Classical Arithmetic. Harvard University)
        • Stephen Cook (1966: On the Minimum Computation Time of Functions. Harvard University)
          • Walter Savitch (1969: Nondeterministic Tape Bounded Turing Machines. University of California, Berkeley)
          • Anna Lubiw (1985: Orderings and Some Combinatorial Optimization Problems with Geometric Applications. University of Toronto)
            • Erik D. Demaine (2001: Folding and Unfolding. University of Waterloo)
              • Mohammad Hajiaghayi (2005: The Bidimensionality Theory and Its Algorithmic Applications. Massachusetts Institute of Technology)
              • Mihai Pătraşcu (2008: Lower Bound Techniques for Data Structures. Massachusetts Institute of Technology)
          • Arvind Gupta (academic) (1990: Constuctivity Issues in Tree Minors. University of Toronto)
          • Toniann Pitassi (1992: The Complexity of Weak Formal Systems. University of Toronto)
          • Mark Braverman (mathematician) (2008: Computability and Complexity of Julia Sets. University of Toronto)

Hopcroft / Lefschetz

  • Felix Klein (1868: Über die Transformation der allgemeinen Gleichung des zweiten Grades zwischen Linien-Koordinaten auf eine kanonische Form. Rheinische Friedrich-Wilhelms-Universität Bonn)
    • Ferdinand von Lindemann (1873: Über unendlich kleine Bewegungen und über Kraftsysteme bei allgemeiner projektivischer Maßbestimmung. Friedrich-Alexander-Universität Erlangen-Nürnberg)
      • Arnold Sommerfeld (1891: Die willkürlichen Functionen in der mathematischen Physik. Universität Königsberg)
        • Ernst Guillemin (1926: Theorie der Frequenzvervielfachung durch Eisenkernkoppelung. Ludwig-Maximilians-Universität München)
          • Robert Fano (1947: Theoretical Limitations on the Broadband Matching of Arbitrary Impedances. Massachusetts Institute of Technology)
          • William Linvill (1949: Analysis and Design of Sampled-Data Control Systems. Massachusetts Institute of Technology)
            • Bernard Widrow (1956: A Study of Rough Amplitude Quantization by Means of Nyquist Sampling Theory. Massachusetts Institute of Technology)
              • Richard Mattson (1962: The Analysis and Synthesis of Adaptive Systems Which Use Networks of Threshold Elements. Stanford University)
                • John Hopcroft (1964: Synthesis of Threshold Logic Networks. Stanford University)
                  • Alfred Aho (1967: Indexed Grammars: An Extension of Context Free Grammars. Princeton University)
                  • Zvi Galil (1975: The Complexity of Resolution Procedures for Theorem Proving in the Propositional Calculus. Cornell University)
                  • Merrick L. Furst (1980: A Subexponential Algorithm for Trivalent Isomorphism. Cornell University)
                    • Andrew Appel (1985: Compile-Time Evaluation and Code Generation in Semantics-Directed Compilers. Carnegie Mellon University) (Primary advisor: Ravi Sethi)
    • Oskar Bolza (1886: Über die Reduction hyperelliptischer Integrale erster Ordnung and erster Gattung auf elliptische, insbesondere über die Reduction durch eine Transformation vierten Grades. Georg-August-Universität Göttingen)
    • William Edward Story (1875: On the Algebraic Relations Existing Between the Polars of a Binary Quantic. Universität Leipzig)
      • Solomon Lefschetz (1911: On the Existence of Loci with Given Singularities. Clark University)
        • Albert W. Tucker (1932: An Abstract Approach to Manifolds. Princeton University)
          • Marvin Minsky (1954: Theory of Neural-Analog Reinforcement Systems and Its Application to the Brain Model Problem. Princeton University)
            • Manuel Blum (1964: A Machine-Independent Theory of the Complexity of Recursive Functions. Massachusetts Institute of Technology)
              • John Gill, III (1972: Probabilistic Turing Machines and Complexity of Computation. University of California, Berkeley)
              • Gary Miller (computer scientist) (1975: Riemann's Hypothesis and Tests for Primality. University of California, Berkeley)
                • F. Thomson Leighton (1981: Layouts for the Shuffle-Exchange Graph and Lower Bound Techniques for VLSI. Massachusetts Institute of Technology)
                  • Peter Shor (1985: Random Planar Matching and Bin Packing. Massachusetts Institute of Technology)
              • Dana Angluin (1976: An Application of the Theory of Computational Complexity to the Study of Inductive Inference. University of California, Berkeley)
              • Leonard Adleman (1976: Number-Theoretic Aspects of Computational Complexity. University of California, Berkeley)
              • Michael Sipser (1980: Nondeterminism and the Size of Two-Way Finite Automata. University of California, Berkeley)
                • Lance Fortnow (1989: Complexity-Theoretic Aspects of Interactive Proof Systems. Massachusetts Institute of Technology)
                • Leonard Schulman (1992: Communication in the Presence of Noise. Massachusetts Institute of Technology)
                • Daniel Spielman (1995: Computationally Efficient Error-Correcting Codes and Holographic Proofs. Massachusetts Institute of Technology)
              • Jeffrey Shallit (1983: Metric Theory of Pierce Expansions. University of California, Berkeley)
              • Silvio Micali (1983: Randomness Versus Hardness. University of California, Berkeley)
                • Mihir Bellare (1991: Randomness in Interactive Proofs. Massachusetts Institute of Technology)
                • Bonnie Berger (1990: Using Randomness to Design Efficient Deterministic Algorithms. Massachusetts Institute of Technology)
                  • Lior Pachter (1999: Domino Tiling, Gene Recognition and Mice. Massachusetts Institute of Technology)
                  • Serafim Batzoglou (2004: Computational Genomics: Mapping, Comparison, and Annotation of Genomes. Massachusetts Institute of Technology)
                • Phillip Rogaway (1991: The Round Complexity of Secure Protocols. Massachusetts Institute of Technology)
                • Rafail Ostrovsky (1992: Software Protection and Simulation by Oblivious RAMs. Massachusetts Institute of Technology)
              • Eric Bach (1984: Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms. University of California, Berkeley)
              • Shafrira Goldwasser (1984: Probabilistic Encryption: Theory and Applications. University of California, Berkeley)
                • Johan Håstad (1986: Computational Limitations of Small Depth Circuits. Massachusetts Institute of Technology)
                • Salil Vadhan (1999: A Study of Statistical Zero-Knowledge Proofs. Massachusetts Institute of Technology)
                • Amit Sahai (2000: New Frontiers in Zero Knowledge. Massachusetts Institute of Technology)
              • Vijay Vazirani (1984: Maximum Matchings without Blossoms. University of California, Berkeley)
              • Umesh Vazirani (1986: Randomness, Adversaries and Computation. University of California, Berkeley)
                • Madhu Sudan (1992: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. University of California, Berkeley)
                • Sanjeev Arora (1994: Probabilistic Checking of Proofs and Hardness of Approximation Problems. University of California, Berkeley)
                • Andris Ambainis (2001: Quantum Entanglement, Quantum Communication and the Limits of Quantum Computing. University of California, Berkeley)
                • Scott Aaronson (2004: Limits on Efficient Computation in the Physical World. University of California, Berkeley)
              • Steven Rudich (1989: Limits on the Provable Consequences of One-Way Functions. University of California, Berkeley)
                • James Aspnes (1992: Wait-Free Consensus. Carnegie Mellon University)
              • Moni Naor (1989: Implicit Storage Schemes for Quick Retrieval. University of California, Berkeley)
              • Ronitt Rubinfeld (1990: A Mathematical Theory of Self-Checking, Self-Testing and Self-Correcting Programs. University of California, Berkeley)
              • Sampath Kannan (1990: Program Checkers for Algebraic Problems. University of California, Berkeley)
              • Russell Impagliazzo (1992: Pseudo-Random Generators for Probabilistic Algorithms and for Cryptography. University of California, Berkeley)
              • Mor Harchol-Balter (1996: Network Analysis without Exponentiality Assumptions. University of California, Berkeley)
              • Luis von Ahn (2005: Human Computation. Carnegie Mellon University)
              • Ryan Williams (computer scientist) (2007: Algorithms and Resource Requirements for Fundamental Problems. Carnegie Mellon University)
            • Gerald Sussman (1973: A Computational Model of Skill Acquisition. Massachusetts Institute of Technology)
              • Drew McDermott (1976: Flexibility and Efficiency in a Computer Program for Designing Circuits. Massachusetts Institute of Technology)
              • Guy Steele, Jr. (1980: The Definition and Implementation of a Computer Programming Language Based on Constraints. Massachusetts Institute of Technology)
                • Philip Wadler (1984: Listlessness Is Better than Laziness: An Algorithm that Transforms Applicative Programs to Eliminate Intermediate Lists. Carnegie Mellon University) (Primary advisor: Nico Habermann)
              • Ken Forbus (1984: Qualitative Process Theory. Massachusetts Institute of Technology)
            • Scott Fahlman (1977: A System for Representing and Using Real-World Knowledge. Massachusetts Institute of Technology) (Secondary advisor: Gerald Sussman)
        • John McCarthy (computer scientist) (1951: Projection Operators and Partial Differential Equations. Princeton University)
          • Barbara Huberman Liskov (1968: A Program to Play Chess End Games. Stanford University)
            • Maurice Herlihy (1984: Modular Composition of Fault-Tolerant Systems. Massachusetts Institute of Technology)
            • J. Eliot B. Moss (1981: Nested Transactions: An Approach to Reliable Distributed Computing. Massachusetts Institute of Technology)
            • William Edward Weihl (1984: Specification and Implementation of Atomic Data Types. Massachusetts Institute of Technology)
              • Gary T. Leavens (1989: Verifying Object-Oriented Programs that Use Subtypes. Massachusetts Institute of Technology)
              • Eric Brewer (scientist) (1994: Portable High-Performance Supercomputing: High-Level Platform-Dependent Optimization. Massachusetts Institute of Technology)
                • Ian Avrum Goldberg (2000: A Pseudonymous Communications Infrastructure for the Internet. University of California, Berkeley)
                • Nikita Borisov (2005: Anonymous Routing in Structured Peer-to-Peer Overlays. University of California, Berkeley)
                • David A. Wagner (2000: Static Analysis and Computer Security: New Techniques for Software Assurance. University of California, Berkeley)"
            • Sanjay Ghemawat (1995: The Modified Object Buffer: A Storage Management Technique for Object-Oriented Databases. Massachusetts Institute of Technology)

California Institute of Technology

Knuth

Hartmanis

Floyd

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

  • Bob Floyd (1953: Bachelor's degree in liberal arts; 1958: Bachelor's degree in physics. The University of Chicago)
    • Zohar Manna (1968: Termination of Algorithms. Carnegie Mellon University)
      • Adi Shamir (1977: The Fixed Points Of Recursive Definitions. Weizmann Institute of Science)
        • Eli Biham (1992: Differential Cryptanalysis Of Iterated Cryptosystems. Weizmann Institute of Science)
        • Uriel Feige (1992: Alternative Models For Zero Knowledge Interactive Proofs. Weizmann Institute of Science)
        • Amos Fiat (1987: Fibonacci Lattices: Theory And Application. Weizmann Institute of Science)
      • Martín Abadi (1987: Temporal Theorem Proving. Stanford University)
      • Shmuel Katz (computer scientist) (1977: Invariants And The Logical Analysis Of Programs. Weizmann Institute of Science)
      • Nachum Dershowitz (1979: The Evolution of Programs. Weizmann Institute of Science)
    • Jay Earley (1968: An Efficient Context-Free Parsing Algorithm. Carnegie Mellon University)
    • Robert Tarjan (1972: An Efficient Planarity Algorithm. Stanford University)
      • Daniel Sleator (1981: An O(nmlog⁡n) Algorithm for Maximum Network Flow. Princeton University)
      • John R. Gilbert (1981: Graph Separator Theorems and Sparse Gaussian Elimination. Stanford University)
        • Raimund Seidel (1987: Output-Size Sensitive Algorithms for Constructive Problems in Computational Geometry. Cornell University)
          • Nina Amenta (1994: Helly Theorems and Generalized Linear Programming. University of California, Berkeley)
      • Monika Henzinger (1993: Fully Dynamic Graph Algorithms and Their Data Structures. Princeton University)
    • Ronald Rivest (1974: Analysis of Associative Retrieval Algorithms. Stanford University)
      • Ron Pinter (1982: The Impact of Layer Assignment Methods on Layout Algorithms for Integrated Circuits. Massachusetts Institute of Technology)
      • Alan Sherman (1987: Cryptology and VLSI: I. Detecting and Exploiting Algebraic Weaknesses in Cryptosystems II. Algorithms for Placing Modules on a Custom VLSI Chip. Massachusetts Institute of Technology)
      • Burt Kaliski (1988: Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other Tools. Massachusetts Institute of Technology)
      • Avrim Blum (1991: Algorithms for Approximate Graph Coloring. Massachusetts Institute of Technology)
      • Robert Schapire (1991: The Design and Analysis of Efficient Learning Algorithms. Massachusetts Institute of Technology)
      • Mona Singh (scientist) (1995: Machine Learning Algorithms. Massachusetts Institute of Technology)
    • David Plaisted (1976: Theorem Proving and Semantic Trees. Stanford University)

Ullman

Hilbert

Aiken

  • Emory Leon Chaffee (1911: A New Method of Impact Excitation of Undamped Oscillations and Their Analysis by Means of Braun Tube Oscillographs. Harvard University)
    • Howard Aiken (1939: A Study of the Laws of Space Change. Harvard University)
      • Gerrit Blaauw (1952: The Application of Selenium Rectifiers as Switching Devices in the Mark IV Calculator. Harvard University)
        • Christian Vissers (1977: Interface; Definition, Design, and Description of the Relation of Digital System Parts. Universiteit Twente)
          • Hendrik Brinksma (1988: On the Design of Extended LOTOS; a Specification Language for Open Distributed Systems. Universiteit Twente)
      • Fred Brooks (1956: The Analytic Design of Automatic Data Processing Systems. Harvard University)
      • Anthony Oettinger (1954: A Study for the Design of an Automatic Dictionary. Harvard University)
        • William Hines Bossert (1963: Simulation of Character Displacement in Animals. Harvard University)
        • Sheila Greibach (1963: Inverses of Phrase Structure Generators. Harvard University)
          • Ronald Book (1969: Grammars with Time Functions. Harvard University)
          • Michael J. Fischer (1968: Grammars with Macro-Like Productions. Harvard University)
            • Mitchell Wand (1973: Mathematical Foundations of Language Theory. Massachusetts Institute of Technology)
            • Michael Martin Hammer (1973: A New Grammatical Transformation into Deterministic Top-Down Form. Massachusetts Institute of Technology)
              • Dennis McLeod (1978: A Semantic Data Model and Its Associated Structured User Interface. Massachusetts Institute of Technology)
          • 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 (1986: Shared Virtual Memory on Loosely Coupled Multiprocessors. Yale University)
          • Kellogg Booth (1975: University of California, Berkeley . University of California, Berkeley)
          • Ron Shamir (1984: On the Complexity of the Simplex Method. University of California, Berkeley)
          • Rajeev Motwani (1988: Probabilistic Analysis of Matching and network flow Algorithms. University of California, Berkeley)
        • Eugene Lawler (1963: Some Aspects of Discrete Mathematical Programming. Harvard University)
          • David Shmoys (1984: Approximation Algorithms for Problems in Sequencing, Scheduling, and Communication Network Design. University of California, Berkeley)
            • Philip N. Klein (1988: Efficient Parallel Algorithms for Planar, Chordal, and Interval Graphs. Massachusetts Institute of Technology)
            • Clifford Stein (1992: Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems. Massachusetts Institute of Technology)
          • Lee J. White (1967: A Parametric Study of Matchings and Coverings in Weighted Graphs. University of Michigan)

Stanford

Other

See also

References

  1. ↑ Elizabeth A. Unger at the Mathematics Genealogy Project

Further reading

  • Johnson, David S. (Summer 1984). "The genealogy of theoretical computer science: a preliminary report". ACM SIGACT News. 16 (2): 36–49. doi:10.1145/1008959.1008960.
  • Parberry, Ian; Johnson, David S. (June 1995). James Ford; Fillia Makedon; Samuel Rebelsky, eds. "The SIGACT Theoretical Computer Science Genealogy: Preliminary Report" (PDF). Proceedings of DAGS 95, "Electronic Publishing and the Information Superhighway". Boston, MA: Birkhauser: 197–205.
  • Coonce, Harry B. (December 2004). "Computer science and the mathematics genealogy project". ACM SIGACT News. 35 (4).

External links


📰 Article(s) of the same category(ies)

📰 Article(s) of the same category(ies)


This article "Academic genealogy of computer scientists" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Academic genealogy of computer scientists. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.


Retrieved from "https://en.everybodywiki.com/index.php?title=Academic_genealogy_of_computer_scientists&oldid=6251638"
License CC BY-SA 3.0
Powered by MediaWiki