David Eppstein

From Chessprogramming wiki
Jump to: navigation, search

Home * People * David Eppstein

David Eppstein [1]

David A. Eppstein,
an American mathematician and computer scientist. He is professor in the Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine. He received a B.Sc. in mathematics from Stanford University in 1984, and M.Sc. and Ph.D. degrees in computer science from Columbia University in 1985 and 1989 respectively. His research interests covers algorithms and data structures, complexity theory, graph theory, such as minimum spanning tree, shortest path, and graph coloring as well as game theory and finite element methods. He teaches strategy and board game programming and tried his own hands on Fanorona [2], a traditional board game from Madagascar.

Selected Publications

[3] [4] [5]

1985 ...

1900 ...

1995 ...

2000 ...

2005 ...

2010 ...

2015 ...

Forum Posts

Re: Using too-shallow mate scores from the hash table by David Eppstein, CCC, July 06, 1998

Blog Posts

Analyzing Algorithm X in honor of Knuth's 70th birthday, by David Eppstein, January 2008
Chessboards and colorings, by David Eppstein, August 30, 2010

External Links

ICS.UCI.EDU

Lecture Notes

References

Up one level