David Eppstein
| David Eppstein | |
|---|---|
 |
|
| Born | David Arthur Eppstein 1963 (age 53–54) England |
| Residence | Irvine, California |
| Citizenship | American |
| Fields | Computer science |
| Institutions | University of California, Irvine |
| Alma mater |
Stanford University Columbia University |
| Thesis | Efficient algorithms for sequence analysis with concave and convex gap costs (1989) |
| Doctoral advisor | Zvi Galil |
| Known for |
Computational geometry Graph algorithms Recreational mathematics |
David Arthur Eppstein (born 1963) is an American computer scientist and mathematician. He is a Chancellor's Professor of computer science at University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
He received a B.S. in mathematics from Stanford University in 1984, and later an M.S. (1985) and Ph.D. (1989) in computer science from Columbia University, after which he took a postdoctoral position at Xerox's Palo Alto Research Center. He joined the UC Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005. In 2014, he was named a Chancellor's Professor.
In computer science, Eppstein's research is focused mostly in computational geometry: minimum spanning trees, shortest paths, dynamic graph data structures, graph coloring, graph drawing and geometric optimization. He has published also in application areas such as finite element meshing, which is used in engineering design, and in computational statistics, particularly in robust, multivariate, nonparametric statistics.
...
Wikipedia