David Eppstein
From Wikipedia, the free encyclopedia
 |
|
| Born | England |
|---|---|
| Residence | USA |
| Nationality | US citizen |
| Field | computer scientist |
| Institution | Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine |
| Alma mater | Stanford University, Columbia University |
| Known for | He is best known for his work in computational geometry, graph algorithms, and recreational mathematics |
| Notable prizes | NSF Young Investigator award, 1992 – 1999; NSF graduate fellowship, 1984 – 1987; National Merit scholarship, 1981 – 1984. |
David Eppstein (born 1963) is a computer scientist at the Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine. He is best known for his work in computational geometry, graph algorithms, and recreational mathematics.
Contents |
[edit] Biography
Born in England, but now a US citizen, Eppstein received a B.S. in Mathematics with distinction from Stanford University in 1984, and later an M.S. (May 1985) and a Ph.D. in Computer Science from Columbia University (May 1989), 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.
[edit] Research interests
David Eppstein's research is focused mostly in finite element meshing, minimum spanning trees, shortest paths, dynamic graph data structures, graph colouring, graph drawing, computational robust statistics, and geometric optimisation.
His Erdős number is 2.
[edit] Awards and honours
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).
[edit] Hobbies
David Eppstein is a recreational mathematics enthusiast, participates in Wikipedia and Flickr, and maintains a blog at LiveJournal.
