David Eppstein

David Eppstein
Born David Arthur Eppstein
1963 (age 53–54)[1]
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
Website
https://11011110.github.io/blog/

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.[2] He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.

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.[3] In 2014, he was named a Chancellor's Professor.[4]

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.[5]

Other interests

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

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.[7] In 2011, he was named an ACM Fellow for his contributions to graph algorithms and computational geometry.[8]

Selected publications

Books

See also

References

  1. ↑ Eppstein, David. "11011110 - User Profile". livejournal.com. Archived from the original on June 30, 2012. Retrieved November 1, 2016.
  2. ↑ "Chancellor's Professors - UCI". Retrieved November 1, 2016.
  3. 1 2 "David Eppstein's Online Curriculum Vitae" (PDF). Retrieved April 9, 2008.
  4. ↑ "UCI Chancellor's Professors". Archived from the original on November 15, 2002. Retrieved August 18, 2014.
  5. ↑ 17th International Symposium on Graph Drawing
  6. ↑ Eppstein, David. "About". 11011110. Retrieved 2017-08-11.
  7. ↑ Lindgren, Kristina (21 July 1992). "IRVINE : UCI Scientists Win Research Grants". Los Angeles Times. Retrieved 23 February 2014.
  8. ↑ ACM Fellows:David Eppstein, Association for Computing Machinery. December, 2011.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.