Jump to content

David Eppstein: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
m Citations: [Pu151β]Formatted: pages, volume. You can use this bot yourself! Report bugs here.
No edit summary
(5 intermediate revisions by the same user not shown)
Line 18: Line 18:
| prizes = {{nobr|NSF Young Investigator award (1992 – 1999)}}<br>| footnotes =
| prizes = {{nobr|NSF Young Investigator award (1992 – 1999)}}<br>| footnotes =
}}
}}
'''David Arthur Eppstein''' (born 1963)<ref>http://11011110.livejournal.com/profile</ref> 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 theory|graph algorithms]], and [[recreational mathematics]].
'''David Arthur Eppstein''' (born 1963)<ref>http://11011110.livejournal.com/profile</ref> 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 theory|graph algorithms]], and [[recreational mathematics]]. It has been alleged David Eppstein has behaved unprofessionally and warranted complaint to [[University of California]] president [[Mark Yudof]][http://meami.org/eppstein-claim.pdf].


==Biography==
==Biography==
Line 59: Line 59:
[[Category:English immigrants to the United States]]
[[Category:English immigrants to the United States]]
[[Category:Graph theorists]]
[[Category:Graph theorists]]
[[Category:Discrimination law]]
[[Category:Naturalized citizens of the United States]]
[[Category:Naturalized citizens of the United States]]
[[Category:American people of New Zealand descent]]
[[Category:American people of New Zealand descent]]

Revision as of 12:08, 3 June 2010

David Eppstein
Born
David Arthur Eppstein

1963 (age 60–61)
CitizenshipUSA
Alma materStanford University (undergraduate)
Columbia University
Known forComputational geometry
Graph algorithms
Recreational mathematics
AwardsNSF Young Investigator award (1992 – 1999)
Scientific career
FieldsComputer science
InstitutionsComputer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine
Doctoral advisorZvi Galil

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. It has been alleged David Eppstein has behaved unprofessionally and warranted complaint to University of California president Mark Yudof[1].

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 postdoctorate 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

Eppstein's research is focused mostly in finite element meshing, minimum spanning trees, shortest paths, dynamic graph data structures, graph coloring, graph drawing, computational robust statistics and geometric optimisation.

Eppstein is a current Editorial Board member for the Journal of Graph Algorithms and Applications[3] and the Chicago Journal of Theoretical Computer Science.[4] He is a past editor of the journal ACM Transactions on Algorithms[5] and of the Journal of Algorithms[6] and of the SIAM Journal on Computing.[7] Eppstein has been a program committee member for the Annual ACM Symposium on Theory of Computing (STOC) in 2003[8], 2006[9], 2009[10] and several other years,

Selected publications

  • Eppstein, David (1999). "Finding the k shortest paths". SIAM Journal on Computing. 28 (2): 652–673. doi:10.1109/SFCS.1994.365697.
  • D. Eppstein, Z Galil, GF Italiano, A Nissenzweig (1997). "Sparsification—a technique for speeding up dynamic graph algorithms". Journal of the ACM. 44 (5): 669–696. doi:10.1145/265910.265914.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  • N. Amenta, M. Bern, D. Eppstein (1998). "The Crust and the β-Skeleton: Combinatorial Curve Reconstruction". Graphical Models and Image Processing. 60: 125. doi:10.1006/gmip.1998.0465.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  • M. Bern & D. Eppstein (1992). "Mesh generation and optimal triangulation" (PDF). Technical Report CSL-92-1. Xerox PARC. Republished in D.-Z. Du & F.K. Hwang, ed. (1992). Computing in Euclidean Geometry. World Scientific. pp. 23–90.

Books

  • D. Eppstein, J.-Cl. Falmagne, and S. Ovchinnikov (2008). Media Theory. Springer-Verlag. ISBN 978-3642090837.{{cite book}}: CS1 maint: multiple names: authors list (link)

Awards

Eppstein received the NSF Young Investigator award (1992–1999)[11], and has been accepted to the NSF graduate fellowship (1984–1987) and the National Merit scholarship (1981–1984).[2]

References

  1. ^ http://11011110.livejournal.com/profile
  2. ^ a b c "David Eppstein's Online Curriculum Vitae" (PDF). Retrieved 2008-04-09.
  3. ^ Journal of Graph Algorithms and Applications, main web-page. Accessed November 23, 2008.
  4. ^ Editorial Board, Chicago Journal of Theoretical Computer Science. Accessed November 23, 2008
  5. ^ ACM Transactions on Algorithms, , front matter, vol. 1, July 2005, no. 1
  6. ^ Editorial Board, Journal of Algorithms, vol. 45 (November 2002), Issue 2, p. C02.
  7. ^ David Eppstein biographical profile. National Science Foundation Graduate Research Fellowship Program. Accessed November 23, 2008
  8. ^ STOC 2003 Program Committee. Accessed January 9, 2010
  9. ^ STOC '06. Accessed January 9, 2010.
  10. ^ STOC 2009. Accessed January 9, 2010
  11. ^ NSF Young Investigator: Algorithms for Molecular Biology, Optimal Triangulation, Minimum Spanning Trees, and Geometric Optimization. National Science Foundation. Accessed January 9, 2010