Sneha Girap (Editor)

David Eppstein

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Citizenship
  
American

Doctoral advisor
  
Zvi Galil

Fields
  
Computer Science


Role
  
Computer scientist

Name
  
David Eppstein

Books
  
Media theory

David Eppstein httpswwwicsuciedueppsteinsarasomos4gard

Institutions
  
University of California, Irvine

Alma mater
  
Stanford University Columbia University

Thesis
  
Efficient algorithms for sequence analysis with concave and convex gap costs (1989)

Known for
  
Computational geometry Graph algorithms Recreational mathematics

Residence
  
Irvine, California, United States

Education
  
Stanford University, Columbia University

David eppstein structures in solution spaces three lessons from jean claude


David Arthur Eppstein (born 1963) is an American computer scientist and mathematician. He is a Chancellor's Professor of computer science at the 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.

Contents

Biography

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.

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.

Other interests

Since 2007, Eppstein has been an administrator at the English Wikipedia. He also runs 0xDE, a blog about computational geometry and recreational mathematics.

Awards

In 1984 Eppstein was awarded a National Science Foundation Graduate Research Fellowship. In 1992, Eppstein received a National Science Foundation Young Investigator Award along with six other UC-Irvine academics. In 2011, he was named an ACM Fellow for his contributions to graph algorithms and computational geometry.

Selected publications

  • Eppstein, David (1999). "Finding the k shortest paths". SIAM Journal on Computing. 28 (2): 652–673. doi:10.1109/SFCS.1994.365697. 
  • Eppstein, D.; Galil, Z.; Italiano, G. F.; Nissenzweig, A. (1997). "Sparsification—a technique for speeding up dynamic graph algorithms". Journal of the ACM. 44 (5): 669–696. doi:10.1145/265910.265914. 
  • Amenta, N.; Bern, M.; Eppstein, D. (1998). "The Crust and the β-Skeleton: Combinatorial Curve Reconstruction". Graphical Models and Image Processing. 60 (2): 125–135. doi:10.1006/gmip.1998.0465. 
  • Bern, Marshall; Eppstein, David (1992). "Mesh generation and optimal triangulation" (PDF). Technical Report CSL-92-1. Xerox PARC.  Republished in Du, D.-Z.; Hwang, F. K., eds. (1992). Computing in Euclidean Geometry. World Scientific. pp. 23–90. 
  • Books

  • Eppstein, D.; Falmagne, J.-Cl.; Ovchinnikov, S. (2008). Media Theory. Springer-Verlag. ISBN 978-3-642-09083-7. 
  • References

    David Eppstein Wikipedia