David Eppstein: Difference between revisions
m Reverted edits by Theanimalstyle86 (talk) to last version by Moonriddengirl |
No edit summary |
||
| Line 1: | Line 1: | ||
{{db-reason| it is a Vanity Page, written by and for the subject at hand. The party is not of notable status and does not merit inclusion in wikipedia. Needless clutter}} |
|||
{{dablink|For the mathematician known for work in [[low-dimensional topology]] and [[automatic group]]s, see [[D.B.A. Epstein]]}} |
{{dablink|For the mathematician known for work in [[low-dimensional topology]] and [[automatic group]]s, see [[D.B.A. Epstein]]}} |
||
Revision as of 23:09, 15 August 2008
This article may meet Wikipedia's criteria for speedy deletion because: it is a Vanity Page, written by and for the subject at hand. The party is not of notable status and does not merit inclusion in wikipedia. Needless clutter. For valid criteria, see CSD.
If this article does not meet the criteria for speedy deletion, or you intend to fix it, please remove this notice, but do not remove this notice from pages that you have created yourself. If you created this page and you disagree with the given reason for deletion, you can click the button below and leave a message explaining why you believe it should not be deleted. You can also visit the talk page to check if you have received a response to your message. Note that this article may be deleted at any time if it unquestionably meets the speedy deletion criteria, or if an explanation posted to the talk page is found to be insufficient.
Note to administrators: this article has content on its talk page which should be checked before deletion. Administrators: check links, talk, history (last), and logs before deletion. Consider checking Google.This page was last edited by Theanimalstyle86 (contribs | logs) at 23:09, 15 August 2008 (UTC) (15 years ago) |
David Arthur Eppstein | |
|---|---|
| Born | 1963 |
| Nationality | US citizen |
| Alma mater | Stanford University, Columbia University |
| Known for | Computational geometry Graph algorithms Recreational mathematics |
| Awards | NSF Young Investigator award, 1992 – 1999; NSF graduate fellowship, 1984 – 1987; National Merit scholarship, 1981 – 1984. |
| Scientific career | |
| Fields | computer scientist |
| Institutions | Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine |
| Doctoral advisor | Zvi Galil |
David Arthur Eppstein (born 1963) is a professor of computer science at Donald Bren School of Information and Computer Sciences, University of California, Irvine. His work is in computational geometry, graph algorithms, and recreational mathematics.
Biography
Born in England, he was originally a British subject from New Zealand but is now a United States citizen. Eppstein received a B.S. in Mathematics with distinction 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 postdoctorate at Xerox's Palo Alto Research Center.[1] He joined the UC Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005.[1] Eppstein is married and has two children. He describes his status and ancestry on his website, explaining the "Eppstein" name, especially its atypical spelling, as well as referencing others who bear the name. He is one of the few "California/New Zealand Eppsteins." [2] His avocation is amateur photography.[3]
Research interests
According to Eppstein's CV, [1] his 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.
Eppstein maintains and edits the content of his own web site called the Geometry Junkyard. It mainly provides annotated lists of hyperlinks to other web sites on a range of geometry topics from circles, spheres, and spirals to tilings, polyhedra, and origami.[4]
Selected publications
- D. Eppstein, Finding the k shortest paths, SIAM J. Comput. 28 (1999), no. 2, 652--673
- D. Eppstein, Z Galil, GF Italiano, A Nissenzweig, Sparsification—a technique for speeding up dynamic graph algorithms, J. ACM 44 (1997), no. 5, 669--696.
- N. Amenta, M. Bern, D. Eppstein, The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction Graphical Models and Image Processing, 1998
- M. Bern and D. Eppstein, Mesh generation and optimal triangulation, Tech. Rep. CSL-92-1, Xerox PARC, 1992. Computing in Euclidean Geometry, D.-Z. Du and F.K. Hwang, eds., World Scientific, 1992, pp. 23-90.
Awards
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).[1]
References
- ^ a b c d "David Eppstein's Online Curriculum Vitae" (PDF). Retrieved 2008-04-09.
- ^ "Eppstein on his Name and Relatives". Retrieved 2008-04-23.
- ^ "Eppstein on the Web". Retrieved 2008-04-23.
- ^ Ivars Peterson (1998-05-09). "Return of the Mathematical Tourist". Science News Online. Science Service.
{{cite news}}: Check date values in:|date=(help)
External links
- 1963 births
- American computer scientists
- Americans of British descent
- Cellular automatists
- Columbia University alumni
- Expatriates in the United States
- Graph theorists
- Living people
- Naturalized citizens of the United States
- New Zealand-Americans
- People from Irvine, California
- Researchers in geometric algorithms
- Stanford University alumni
- University of California, Irvine faculty