David Eppstein

From Wikipedia, the free encyclopedia
Jump to: navigation, search
David Eppstein

Born David Arthur Eppstein
1963 (age 46–47)
England
Residence Irvine, California
Citizenship USA
Fields Computer science
Institutions Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine
Alma mater Stanford University (undergraduate)
Columbia University
Doctoral advisor Zvi Galil
Known for Computational geometry
Graph algorithms
Recreational mathematics
Notable awards NSF Young Investigator award (1992 – 1999)

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.

Contents

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

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 optimisation.

Eppstein is a current Editorial Board member for the Journal of Graph Algorithms and Applications[3] and the Chicago Journal of Theoretical Computer Science.[4] He is a past editor of the journal ACM Transactions on Algorithms[5] and of the Journal of Algorithms[6] and of the SIAM Journal on Computing.[7] Eppstein has been a program committee member for the Annual ACM Symposium on Theory of Computing (STOC) in 2003[8], 2006[9], 2009[10] and several other years,

Selected publications

Books

  • D. Eppstein, J.-Cl. Falmagne, and S. Ovchinnikov (2008). Media Theory. Springer-Verlag. ISBN 978-3642090837. 

Awards

Eppstein received the NSF Young Investigator award (1992–1999)[11], and has been accepted to the NSF graduate fellowship (1984–1987) and the National Merit scholarship (1981–1984).[2]

References

  1. ^ http://11011110.livejournal.com/profile
  2. ^ a b c "David Eppstein's Online Curriculum Vitae". http://www.ics.uci.edu/~eppstein/vita.pdf. Retrieved 2008-04-09. 
  3. ^ Journal of Graph Algorithms and Applications, main web-page. Accessed November 23, 2008.
  4. ^ Editorial Board, Chicago Journal of Theoretical Computer Science. Accessed November 23, 2008
  5. ^ ACM Transactions on Algorithms, , front matter, vol. 1, July 2005, no. 1
  6. ^ Editorial Board, Journal of Algorithms, vol. 45 (November 2002), Issue 2, p. C02.
  7. ^ David Eppstein biographical profile. National Science Foundation Graduate Research Fellowship Program. Accessed November 23, 2008
  8. ^ STOC 2003 Program Committee. Accessed January 9, 2010
  9. ^ STOC '06. Accessed January 9, 2010.
  10. ^ STOC 2009. Accessed January 9, 2010
  11. ^ NSF Young Investigator: Algorithms for Molecular Biology, Optimal Triangulation, Minimum Spanning Trees, and Geometric Optimization. National Science Foundation. Accessed January 9, 2010

External links

Retrieved from "http://en.wikipedia.org/wiki/David_Eppstein"