David Eppstein

David Eppstein
David Eppstein

Born David Arthur Eppstein
1963 (age 47–48)
England
Residence Irvine, California
Citizenship United States USA
Fields Computer science
Institutions University of California, Irvine
Alma mater Stanford University
Columbia University
Doctoral advisor Zvi Galil
Known for Computational geometry
Graph algorithms
Recreational mathematics

David Arthur Eppstein (born 1963)[1] is an American computer scientist and mathematician. He is professor of computer science at University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics.

Contents

Biography

Born in England of New Zealander parents, Eppstein is a United States citizen. He 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.[2] He joined the UC Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005.[2]

Research interests

In computer science, Eppstein's research is focused mostly in computational geometry: 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 is a current Editorial Board member for the Chicago Journal of Theoretical Computer Science.[3] He has been an associate editor of the journal ACM Transactions on Algorithms[4], on the Editorial Boards of the Journal of Algorithms[5] and the SIAM Journal on Computing[6], and a guest editor on the Journal of Graph Algorithms and Applications[7]. Eppstein served as the conference program chair or co-chair for the ACM Symposium on Computational Geometry 2001, the ACM-SIAM Symposium on Discrete Algorithms 2002, and the International Symposium on Graph Drawing 2009[8].

Selected publications

Books

  • D. Eppstein, J.-Cl. Falmagne, and S. Ovchinnikov (2008). Media Theory. Springer-Verlag. ISBN 978-3642090837. 

Awards

Eppstein received the NSF Young Investigator Award (1992–1999),[9] and has also been awarded an NSF Graduate Fellowship (1984–1987).[2]

References

  1. ^ http://11011110.livejournal.com/profile
  2. ^ a b c "David Eppstein's Online Curriculum Vitae". http://www.ics.uci.edu/~eppstein/vita.pdf. Retrieved April 9, 2008. 
  3. ^ Editorial Board, Chicago Journal of Theoretical Computer Science. Accessed November 23, 2008
  4. ^ ACM Transactions on Algorithms, , front matter, vol. 1, July 2005, no. 1
  5. ^ Editorial Board, Journal of Algorithms, vol. 45 (November 2002), Issue 2, p. C02.
  6. ^ David Eppstein biographical profile. National Science Foundation Graduate Research Fellowship Program. Accessed November 23, 2008
  7. ^ Journal of Graph Algorithms and Applications, main web-page. Accessed November 23, 2008.
  8. ^ 17th International Symposium on Graph Drawing
  9. ^ NSF Young Investigator: Algorithms for Molecular Biology, Optimal Triangulation, Minimum Spanning Trees, and Geometric Optimization. National Science Foundation. Accessed January 9, 2010

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • David Epstein — may refer to: David Epstein (journalist), writer at Sports Illustrated David B. A. Epstein (born 1937), British mathematician David G. Epstein, professor at the University of Richmond School of Law and bankruptcy expert See also: David Eppstein… …   Wikipedia

  • David Epstein — David Bernard Alper Epstein (* 1937) ist ein britischer Mathematiker, der sich mit Geometrie und Gruppentheorie beschäftigt. David Epstein 2009 an der Universität Warwick Epstein promovierte 1960 an der Cambridge University bei Erik Christopher… …   Deutsch Wikipedia

  • David B. A. Epstein — Not to be confused with David Eppstein. David Epstein at the Warwick Mathematics Institute in December 2009. David Bernard Alper Epstein FRS (b. 1937[1]) is a mathematician known for his work in hyperbolic geometry, 3 manifolds, and …   Wikipedia

  • Zonohedron — A zonohedron is a convex polyhedron where every face is a polygon with point symmetry or, equivalently, symmetry under rotations through 180°. Any zonohedron may equivalently be described as the Minkowski sum of a set of line segments in three… …   Wikipedia

  • Egyptian fraction — An Egyptian fraction is the sum of distinct unit fractions, such as frac{1}{2}+ frac{1}{3}+ frac{1}{16}. That is, each fraction in the expression has a numerator equal to 1 and a denominator that is a positive integer, and all the denominators… …   Wikipedia

  • Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence …   Wikipédia en Français

  • Synchronizing word — This drawing represents a DFA with eight states and two input symbols, red and blue. The word blue red red blue red red blue red red is a synchronizing word that sends all states to the yellow state; the word blue blue red blue blue red blue blue …   Wikipedia

  • Spanning tree (mathematics) — In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G . Informally, a spanning tree of G is a selection of edges of G… …   Wikipedia

  • Tiling by regular polygons — Plane tilings by regular polygons have been widely used since antiquity. The first systematic mathematical treatment was that of Kepler in Harmonices Mundi . Regular tilings Following Grünbaum and Shephard (section 1.3), a tiling is said to be… …   Wikipedia

  • Uniform tilings in hyperbolic plane — There are an infinite number of uniform tilings on the hyperbolic plane based on the ( p q r ) where p + q + r > 9 hyperbolic regular tilings.Four families of uniform tilings and duals are shown below (using the Poincaré disk model for the… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”