ICS 161, Winter 1996:
Design and Analysis of Algorithms

Algorithm Designers

This file lists names and (sometimes) home pages of algorithm
designers whose algorithms were discussed in the lectures.

Manuel Blum is a professor at U.C. Berkeley. He was one of
the inventors of the deterministic linear
time selection algorithm. He won the Turing award, the ACM's
highest honor, in 1995. His most recent research has been on
methods for automatically checking the correctness of programs.

Edsger Wybe Dijkstra is Schlumberger Professor of Computer
Science and Mathematics at U. Texas, Austin. He won the Turing
award, the ACM's highest honor, in 1972. Dijkstra's algorithm finds shortest
paths from a single source to all other vertices of a graph.

Donald Ervin Knuth is a professor (emeritus) at Stanford. He is
most famous for inventing the TeX and Metafont typesetting systems,
and for writing "The Art of Computer Programming", a multi-volume
compendium on algorithms that is still worth reading (even though
much of it was written in the 1960's). He won the Turing award, the
ACM's highest honor, in 1974. Knuth was one of the inventors of the
Knuth-Morris-Pratt string matching
algorithm.

John von Neumann was a mathematician of many
talents; among other works, he invented linear programming, automata theory, and game theory. He also
helped build one of the first electronic computers, ENIAC. In 1945,
he discovered merge sort.