David Eppstein
David Eppstein (* 1963 ) is an American computer scientist and mathematician.
Eppstein graduated from Stanford University with a bachelor's degree in 1984 and received his doctorate in 1989 from Columbia University under Zvi Galil (Efficient Algorithms for Sequence Analysis with Concave and Convex Gap Costs). As a post-doctoral student he was at the Xerox PARC Research Center and from 1990 Assistant Professor and 1998 Professor at the University of California, Irvine in the Faculty of Computer Science. In 2017 he was elected a Fellow of the American Association for the Advancement of Science .
He deals with geometry (computational geometry, including meshing ), graph algorithms, computer graphics, geographic information systems and computer-aided statistics.
He also published on Zonotopes , the Apollonian problem, and conversational math .
Fonts
- with J.-Cl. Falmagne, S. Ovchinnikov: Media Theory: Interdisciplinary Applied Mathematics, Springer Verlag 2008
- with R. Beigel: 3-coloring in time , J. Algorithms, Volume 54, 2005, pp. 168-204.
- with S. Muthukrishnan: Internet packet filter management and rectangle geometry , 12th ACM-SIAM Symp. Discrete Algorithms, 2001, pp. 827-835.
- Finding the k shortest paths , SIAM J. Comput., Vol. 28, 1999, pp. 652-673.
- with N. Amenta, M. Bern: The Crust and the beta-skeleton: combinatorial curve reconstruction , Graphical Models and Image Processing, Volume 60, 1998, pp. 125-135.
- with Z. Galil, GF Italiano, A. Nissenzweig: Sparsification: a technique for speeding up dynamic graph algorithms , J. ACM, Volume 44, 1997, 669-696.
- with M. Bern, J. Gilbert: Provably good mesh generation , J. Comp. Sys. Sci., Vol. 48, 1994, pp. 384-409.
Web links
Individual evidence
- ^ David Eppstein in the Mathematics Genealogy Project (English) .
| personal data | |
|---|---|
| SURNAME | Eppstein, David |
| BRIEF DESCRIPTION | American mathematician and computer scientist |
| DATE OF BIRTH | 1963 |