Biography:David Eppstein
David Eppstein | |
|---|---|
 Eppstein in September 2005 at Limerick, Ireland, during the 13th International Symposium on Graph Drawing | |
| Born | David Arthur Eppstein 1963 (age 60–61)[1] Windsor, England |
| Citizenship | United States |
| Alma mater | |
| Scientific career | |
| Fields | |
| Institutions | University of California, Irvine[2] |
| Thesis | Efficient algorithms for sequence analysis with concave and convex gap costs (1989) |
| Doctoral advisor | Zvi Galil |
| Website | 11011110 |
David Arthur Eppstein (born 1963) is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine.[2][3] He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.[4]
Biography
Born in Windsor, England, in 1963, Eppstein 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.[5] He joined the UC Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005.[6] In 2014, he was named a Chancellor's Professor.[7] In October 2017, Eppstein was one of 396 members elected as fellows of the American Association for the Advancement of Science.[8]
Eppstein is also an amateur digital photographer as well as a Wikipedia editor and administrator with over 200,000 edits.[2][9][10]
Research interests
In computer science, Eppstein's research has included work on 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.[11]
Selected publications
- Eppstein, David (1998). "Finding the k Shortest Paths". SIAM Journal on Computing 28 (2): 652–673. doi:10.1137/S0097539795290477. https://www.ics.uci.edu/~eppstein/pubs/Epp-SJC-98.pdf.
- Eppstein, David (1994). "Finding the k shortest paths". Proceedings 35th Annual Symposium on Foundations of Computer Science. pp. 154–165. doi:10.1109/SFCS.1994.365697. ISBN 978-0-8186-6580-6. https://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-26.pdf.
- Eppstein, D.; Galil, Z.; Italiano, G. F.; Nissenzweig, A. (1997). "Sparsification—a technique for speeding up dynamic graph algorithms". Journal of the ACM 44 (5): 669–696. doi:10.1145/265910.265914.
- Amenta, N.; Bern, M.; Eppstein, D. (1998). "The Crust and the β-Skeleton: Combinatorial Curve Reconstruction". Graphical Models and Image Processing 60 (2): 125–135. doi:10.1006/gmip.1998.0465. http://www-ma2.upc.es/~geoc/abe-csccr-98.pdf.
- Bern, Marshall; Eppstein, David (1992). "Mesh generation and optimal triangulation". Technical Report CSL-92-1 (Xerox PARC): 1–78. https://www.eecs.berkeley.edu/~jrs/meshpapers/BernEppstein.pdf. Republished in Computing in Euclidean Geometry. Lecture Notes Series on Computing. 4. World Scientific. 1995. pp. 47–123. doi:10.1142/9789812831699_0003. ISBN 978-981-02-1876-8.
Books
- Eppstein, D.; Falmagne, J.-Cl.; Ovchinnikov, S. (2008). Media Theory: Interdisciplinary Applied Mathematics. Springer-Verlag. doi:10.1007/978-3-540-71697-6. ISBN 978-3-642-09083-7. https://archive.org/details/mediatheoryinter0000epps.
- Eppstein, D. (2018). Forbidden Configurations in Discrete Geometry. Cambridge University Press. doi:10.1017/9781108539180. ISBN 978-1-108-43913-8. https://www.cambridge.org/core/books/forbidden-configurations-in-discrete-geometry/0A90D6B522B1DFF59641F086F149EA45.
See also
- Eppstein's algorithm
References
- ↑ Eppstein, David. "11011110 – User Profile". livejournal.com. http://11011110.livejournal.com/profile.
- ↑ 2.0 2.1 2.2 Hines, Michael (September 1, 2001). "Picture-perfect prints are possible". Daily Press (Hampton, VA): p. G1, G7. https://www.newspapers.com/image/238407757. "Eppstein is a computer science professor at the University of California, Irvine, and member of the rec.photo.digital online bulletin board of amateur digital photographers."
- ↑ "Distinguished Professors – UCI". https://ap.uci.edu/titles-of-distinction/distinguished-professor/.
- ↑ "List of ACM Fellows". https://awards.acm.org/fellows/award-winners.
- ↑ "Contributors". IEEE Transactions on Information Theory 47 (6): 2667–2677. September 2000. doi:10.1109/TIT.2001.945287. https://ieeexplore.ieee.org/document/945287. Retrieved 2021-01-11.
- ↑ "David Eppstein's Online Curriculum Vitae". https://www.ics.uci.edu/~eppstein/vita.pdf.
- ↑ "UCI Chancellor's Professors". http://www.ap.uci.edu/distinctions/chancprof.html.
- ↑ American Association for the Advancement of Science (2017). "2017 AAAS Fellows approved by the AAAS Council". Science 358 (6366): 1011–1014. doi:10.1126/science.358.6366.1011. Bibcode: 2017Sci...358.1011..
- ↑ "Wikipedia:List of Wikipedians by number of edits" (in en), Wikipedia, 2023-02-10, https://en.wikipedia.org/w/index.php?title=Wikipedia:List_of_Wikipedians_by_number_of_edits&oldid=1138516223, retrieved 2023-02-16
- ↑ "User:David Eppstein" (in en), Wikipedia, 2023-01-20, https://en.wikipedia.org/w/index.php?title=User:David_Eppstein&oldid=1134789282, retrieved 2023-02-16
- ↑ "Graph Drawing 2009". http://facweb.cs.depaul.edu/gd2009/gd2009.asp.
External links
- David Eppstein's profile at the University of California, Irvine
- {{DBLP}} template missing ID and not present in Wikidata.
- {{Google Scholar id}} template missing ID and not present in Wikidata.
 |  |
