David Eppstein (1963 - ) American computer programmer of English birth.
After earning a bachelor’s degree in mathematics from Stanford in 1984 and a Ph.D. in computer science from Columbia university in 1989, Eppstein went on to work at the Palo Alto Research Center and teach computing at the University of California-Irvine. In 1991, he coauthored with Frances Yao and others a paper on horizon theorems for lines and polygons in “Discrete and Computational Geometry: Papers from the DIMACS Special Year”, DIMACS Ser. Discrete Math. and Theoretical Computer Science 6; since Yao coauthored with Fan Chung Graham, Ronald Graham, Stanisław Ulam (http://planetmath.org/StanislawUlam) and Erdős “Minimal decompositions of two graphs into pairwise isomorphic subgraphs” in Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing in 1979, Eppstein has Erdős number (http://planetmath.org/ErdHosNumber) 2.
These days he edits Wikipedia articles on mathematical topics.
|Date of creation||2013-03-22 16:47:28|
|Last modified on||2013-03-22 16:47:28|
|Last modified by||PrimeFan (13766)|