David Eppstein

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

<templatestyles src="Module:Hatnote/styles.css"></templatestyles>

For other uses, see David Epstein.
David Eppstein
140px
Born David Arthur Eppstein
1963 (age 60–61)
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 a Chancellor's Professor of computer science at University of California, Irvine.[2] He is known for his work in computational geometry, graph algorithms, and recreational mathematics ,which includes significant work improving algorithms to solve problems of NP-hardness like the traveling salesman problem.[3] Also on site "Eppstein's Geometry Junkyard", he open and collect unsolved problem in geometry from 1996.[4]

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

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

Awards

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

  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found. Republished in Lua error in package.lua at line 80: module 'strict' not found.

Books

  • Lua error in package.lua at line 80: module 'strict' not found.

References

  1. ↑ 11011110 - User Profile
  2. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  3. ↑ http://arxiv.org/pdf/cs/0304018v2.pdf Quasiconvex Analysis of Backtracking Algorithms
  4. ↑ https://www.google.co.jp/search?q=http%3A%2F%2Fwww.ics.uci.edu%2F~eppstein%2Fjunkyard%2F&safe=off&hl=ja&source=lnt&tbs=cdr%3A1%2Ccd_min%3A%2Ccd_max%3A1996%2F02%2F02&tbm=
  5. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  6. ↑ 17th International Symposium on Graph Drawing
  7. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  8. ↑ ACM Fellows:David Eppstein, Association for Computing Machinery. December, 2011.

External links

  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • David Eppstein at the Mathematics Genealogy Project.
  • Lua error in package.lua at line 80: module 'strict' not found.
Retrieved from "https://infogalactic.com/w/index.php?title=David_Eppstein&oldid=3830928"