David Eppstein
| David Eppstein | |
|---|---|
 | |
| Born |
David Arthur Eppstein 1963 (age 50–51) 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)[1] is an American computer scientist and mathematician. He is professor of computer science at University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics.
Biography
Born in England of New Zealander parents, Eppstein is a United States citizen. 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.[2]
Research interests
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.
Eppstein served as the program chair for the theory track of the ACM Symposium on Computational Geometry in 2001, the program chair of the ACM-SIAM Symposium on Discrete Algorithms in 2002, and the co-chair for the International Symposium on Graph Drawing in 2009.[3]
Selected publications
- Eppstein, David (1999). "Finding the k shortest paths". SIAM Journal on Computing 28 (2): 652–673. doi:10.1109/SFCS.1994.365697.
- D. Eppstein, Z Galil, GF Italiano, A Nissenzweig (1997). "Sparsification—a technique for speeding up dynamic graph algorithms". Journal of the ACM 44 (5): 669–696. doi:10.1145/265910.265914.
- N. Amenta, M. Bern, D. Eppstein (1998). "The Crust and the β-Skeleton: Combinatorial Curve Reconstruction". Graphical Models and Image Processing 60 (2): 125. doi:10.1006/gmip.1998.0465.
- M. Bern & D. Eppstein (1992). "Mesh generation and optimal triangulation". Technical Report CSL-92-1 (Xerox PARC). Republished in D.-Z. Du & F.K. Hwang, ed. (1992). Computing in Euclidean Geometry. World Scientific. pp. 23–90.
Books
- D. Eppstein, J.-Cl. Falmagne, and S. Ovchinnikov (2008). Media Theory. Springer-Verlag. ISBN 978-3-642-09083-7.
Awards
In 2011, he was named an ACM Fellow for his contributions to graph algorithms and computational geometry.[4]
References
- ↑ 11011110 - User Profile
- ↑ "David Eppstein's Online Curriculum Vitae". Retrieved April 9, 2008.
- ↑ 17th International Symposium on Graph Drawing
- ↑ ACM Fellows:David Eppstein, Association for Computing Machinery. December, 2011.
External links
- "David Eppstein". Donald Bren School of Information and Computer Sciences, University of California, Irvine. Retrieved August 15, 2008.
- "David Eppstein Bibliography". The DBLP Computer Science Bibliography. Retrieved August 15, 2008.
- "Eppstein's Geometry Junkyard". Retrieved August 15, 2008.
- David Eppstein at the Mathematics Genealogy Project.
- "David Eppstein". Microsoft Academic Search.
|