|
|
|
|
David Eppstein
|
| |
|
| |
David Arthur Eppstein (born 1963) is an English-born American professor of computer science at University of California, Irvine and a mathematician. His is known for his work in computational geometry, graph algorithms and recreational mathematics.
in England of New Zealander parents, Eppstein is now a United States citizen. He received a B.S. in mathematics with distinction 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 postdoctorate at Xerox's Palo Alto Research Center.

Discussion
Ask a question about 'David Eppstein'
Start a new discussion about 'David Eppstein'
Answer questions from other users
|
Encyclopedia
David Arthur Eppstein (born 1963) is an English-born American professor of computer science at University of California, Irvine and a mathematician. His is known for his work in computational geometry, graph algorithms and recreational mathematics.
Biography
Born in England of New Zealander parents, Eppstein is now a United States citizen. He received a B.S. in mathematics with distinction 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 postdoctorate 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.
Research interests
Eppstein's research is focused mostly in finite element meshing, minimum spanning trees, shortest paths, dynamic graph data structures, graph coloring, graph drawing, computational robust statistics and geometric Optimization (mathematics).
Eppstein is a current Editorial Board member for the Journal of Graph Algorithms and Applications and the Chicago Journal of Theoretical Computer Science. He is a past editor of the journal ACM Transactions on Algorithms and of the Journal of Algorithms and of the SIAM Journal on Computing.
Selected publications
- D. Eppstein, Finding the k shortest paths, SIAM J. Comput. 28 (1999), no. 2, 652–673
- D. Eppstein, Z Galil, GF Italiano, A Nissenzweig, Sparsification—a technique for speeding up dynamic graph algorithms, J. ACM 44 (1997), no. 5, 669–696.
- N. Amenta, M. Bern, D. Eppstein, The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction Graphical Models and Image Processing, 1998
- M. Bern and D. Eppstein, Mesh generation and optimal triangulation, Tech. Rep. CSL-92-1, Xerox PARC, 1992. Computing in Euclidean Geometry, D.-Z. Du and F.K. Hwang, eds., World Scientific, 1992, pp. 23–90.
Books
D. Eppstein, J.-Cl. Falmagne, and S. Ovchinnikov. Media Theory. Springer-Verlag, 2008.
Awards
Eppstein received the NSF Young Investigator award (1992 – 1999), and has been accepted to the NSF graduate fellowship (1984–1987) and the National Merit scholarship (1981–1984).
External links
|
| |
|
|