Research Interests: Computational geometry, analysis of algorithms, data structures. Dr. Dillencourt is particularly interested in the areas of computational geometry and graph theory, and in the interplay between these two areas.
David Eppstein, Professor (Ph.D. Columbia University, 1989) eppstein@ics.uci.edu
Research Interests: Analysis of algorithms, computational geometry, graph theory. Dr. Eppstein's thesis work was on algorithms for analysis of sequence data in molecular biology, but his more recent research has been in both computational geometry and graph algorithms.
Dan Hirschberg, Professor (Ph.D. Princeton University, 1975) dan@ics.uci.edu
Research Interests: Analysis of algorithms, data compression, data structures. Most of Dr. Hirschberg's work has concentrated on five areas: common subsequence problems, algorithms using a parallel processor, design of efficient data structures, breakpoint problems and data compression.
Sandy Irani, Associate Professor (Ph.D. University of California, Berkeley, 1990) irani@ics.uci.edu
Research Interests: Analysis of algorithms, on-line algorithms, graph theory and combinatorics. Most of Dr. Irani's research has been in the area of on-line algorithms. She has worked on problems in on-line data structures, on-line graph coloring and paging.
George S. Lueker, Professor (Ph.D. Princeton University, 1975) lueker@ics.uci.edu
Research Interests: Computational complexity, probabilistic analysis of algorithms, data structures. Dr. Lueker is especially interested in applications of probability to problems in computer science, in particular the analysis of the behavior of algorithms and optimization problems when some assumption is made about the probability distribution of inputs.