25,161
edits
Changes
Created page with "'''Home * People * David Eppstein''' FILE:Eppstein in Limerick.jpg|border|right|thumb| David Eppstein <ref>David Eppstein in [https://en.wikipedia.org/wik..."
'''[[Main Page|Home]] * [[People]] * David Eppstein'''
[[FILE:Eppstein in Limerick.jpg|border|right|thumb| David Eppstein <ref>David Eppstein in [https://en.wikipedia.org/wiki/Limerick Limerick, Ireland], for the 13th [https://en.wikipedia.org/wiki/International_Symposium_on_Graph_Drawing International Symposium on Graph Drawing], September 15, 2005, Image by Elena Mumford, [https://en.wikipedia.org/wiki/David_Eppstein David Eppstein from Wikipedia], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
'''David A. Eppstein''',<br/>
an American mathematician and computer scientist.
He is professor in the Computer Science Department, [https://en.wikipedia.org/wiki/Donald_Bren_School_of_Information_and_Computer_Sciences Donald Bren School of Information and Computer Sciences], [https://en.wikipedia.org/wiki/University_of_California,_Irvine 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|algorithms]] and [[Data|data structures]], [https://en.wikipedia.org/wiki/Computational_complexity_theory complexity theory], [https://en.wikipedia.org/wiki/Graph_theory graph theory], such as [https://en.wikipedia.org/wiki/Minimum_spanning_tree minimum spanning tree], [https://en.wikipedia.org/wiki/Shortest_path_problem shortest path], and [https://en.wikipedia.org/wiki/Graph_coloring graph coloring] as well as [[Games|game theory]] and [https://en.wikipedia.org/wiki/Finite_element_method finite element methods].
He teaches [https://en.wikipedia.org/wiki/Strategy_game strategy] and [https://en.wikipedia.org/wiki/Board_game board game] [[Programming|programming]] and tried his own hands on [https://en.wikipedia.org/wiki/Fanorona Fanorona] <ref>[https://www.ics.uci.edu/%7Eeppstein/180a/projects/fanorona/ Fanorona] by David Eppstein</ref>,
a traditional board game from [https://en.wikipedia.org/wiki/Madagascar Madagascar].
=Selected Publications=
<ref>[https://www.ics.uci.edu/~eppstein/pubs/ David Eppstein - Publication]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/e/Eppstein:David dblp: David Eppstein]</ref>
==1985 ...==
* [[David Eppstein]] ('''1985'''). ''[https://www.semanticscholar.org/paper/A-Heuristic-Approach-to-Program-Inversion-Eppstein/3f259f7bab6ebce1071e1aafb808a8948907eed2 A Heuristic Approach to Program Inversion]''. [[Conferences#IJCAI1985|IJCAI 1985]]
* [[David Eppstein]], [[Mathematician#ZviGalil|Zvi Galil]], [[Mathematician#RGiancarlo|Raffaele Giancarlo]] ('''1988'''). ''[https://ieeexplore.ieee.org/document/21965 Speeding up Dynamic Programming]''. [https://dblp.uni-trier.de/db/conf/focs/focs88.html FOCS 1988]
* [[David Eppstein]], [[Mathematician#ZviGalil|Zvi Galil]] ('''1988'''). ''Parallel Algorithmic Techniques for Combinatorial Computation''. [https://dblp.uni-trier.de/db/conf/icalp/icalp89.html ICALP 1989], [https://www.ics.uci.edu/~eppstein/pubs/EppGal-ICALP-89.pdf pdf]
==1900 ...==
* [[David Eppstein]], [[Mathematician#ZviGalil|Zvi Galil]], [[Mathematician#RGiancarlo|Raffaele Giancarlo]], [[Mathematician#GFItaliano|Giuseppe F. Italiano]] ('''1990'''). ''Sparse Dynamic Programming''. [https://dblp.uni-trier.de/db/conf/soda/soda90.html SODA 1990], [http://www.cs.ust.hk/mjg_lib/bibs/DPSu/DPSu.Files/p513-eppstein.pdf pdf]
* [[David Eppstein]] ('''1990'''). ''Sequence Comparison with Mixed Convex and Concave Costs''. [https://www.journals.elsevier.com/journal-of-algorithms Journal of Algorithms], Vol. 11, No. 1, [https://www.ics.uci.edu/~eppstein/pubs/Epp-Algs-90.pdf pdf]
* [[David Eppstein]] ('''1992'''). ''[https://link.springer.com/article/10.1007/BF01994879 Finding the k Smallest Spanning Trees]''. [https://dblp.uni-trier.de/db/journals/bit/bit32.html BIT, Vol. 32]
* [[David Eppstein]] ('''1994'''). ''Finding the k Shortest Paths''. Tech. Report 94-26, [https://dblp.uni-trier.de/db/conf/focs/focs94.html 35th FOCS 1994], [https://www.ics.uci.edu/%7Eeppstein/pubs/Epp-TR-94-26.pdf TR-94-26.pdf]
==1995 ...==
* [[David Eppstein]] ('''1997'''). ''Dynamic Connectivity in Digital Images''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 62, No. 3, [https://www.ics.uci.edu/~eppstein/pubs/Epp-TR-96-13.pdf TR-96-13.pdf]
* [[David Eppstein]] ('''1998'''). ''Finding the k Shortest Paths''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 28, No. 2, [https://www.ics.uci.edu/~eppstein/pubs/Epp-SJC-98.pdf pdf]
* [[David Eppstein]] ('''1999'''). ''Setting Parameters by Example''. [https://arxiv.org/abs/cs/9907001 arXiv:cs/9907001]
==2000 ...==
* [[David Eppstein]] ('''2000'''). ''Searching for Spaceships''. [https://arxiv.org/abs/cs/0004003 arXiv:cs/0004003]
* [[Erik D. Demaine]], [[Martin L. Demaine]], [[David Eppstein]] ('''2000'''). ''Phutball Endgames are Hard''. [https://arxiv.org/abs/cs/0008025 arXiv:cs/0008025] <ref>[https://en.wikipedia.org/wiki/Phutball Phutball from Wikipedia]</ref>
* [https://dblp.uni-trier.de/pers/hd/m/Moore:Cristopher Cristopher Moore], [[David Eppstein]] ('''2000'''). ''One-Dimensional Peg Solitaire''. [https://arxiv.org/abs/math/0006067 arXiv:math/0006067] <ref>[https://en.wikipedia.org/wiki/Peg_solitaire Peg solitaire from Wikipedia]</ref>
* [https://dblp.uni-trier.de/pers/hd/m/Moore:Cristopher Cristopher Moore], [[David Eppstein]] ('''2000'''). ''One-Dimensional Peg Solitaire, and Duotaire''. [https://arxiv.org/abs/math/0008172 arXiv:math/0008172]
* [[David Eppstein]], [[Mathematician#SMMuthukrishnan|S. Muthukrishnan]] ('''2000'''). ''Internet Packet Filter Management and Rectangle Geometry''. [https://arxiv.org/abs/cs/0010018 arXiv:cs/0010018]
* [[David Eppstein]], [[Mathematician#JCFalmagne|Jean-Claude Falmagne]] ('''2002'''). ''Algorithms for Media''. [https://arxiv.org/abs/cs/0206033 arXiv:cs/0206033]
* [[David Eppstein]] ('''2004'''). ''Algorithms for Drawing Media''. [https://arxiv.org/abs/cs/0406020 arXiv:cs/0406020]
* [[David Eppstein]] ('''2004'''). ''Quasiconvex Programming''. [https://arxiv.org/abs/cs/0412046 arXiv:cs/0412046]
==2005 ...==
* [[David Eppstein]], [[Mathematician#MTGoodrich|Michael T. Goodrich]], [https://dblp.uni-trier.de/pers/hd/s/Sun:Jonathan_Z= Jonathan Z. Sun] ('''2005'''). ''The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data''. [https://arxiv.org/abs/cs/0507049 https://arxiv.org/abs/cs/050704]
* [[David Eppstein]] ('''2005'''). ''Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku''. [https://arxiv.org/abs/cs/0507053 arXiv:cs/0507053]
* [[David Eppstein]] ('''2008'''). ''Learning Sequences''. [https://arxiv.org/abs/0803.4030 arXiv:0803.4030]
* [[David Eppstein]], [[Mathematician#JCFalmagne|Jean-Claude Falmagne]], [https://dblp.uni-trier.de/pers/hd/o/Ovchinnikov:Sergei Sergei Ovchinnikov] ('''2008'''). ''[https://link.springer.com/book/10.1007%2F978-3-540-71697-6 Media Theory - interdisciplinary applied mathematics]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[David Eppstein]] ('''2009'''). ''Growth and Decay in Life-Like Cellular Automata''. [https://arxiv.org/abs/0911.2890 arXiv:0911.2890]
==2010 ...==
* [[Mathematician#MJBannister|Michael J. Bannister]], [[David Eppstein]] ('''2011'''). ''Randomized Speedup of the Bellman-Ford Algorithm''. [https://arxiv.org/abs/1111.5414 arXiv:1111.5414] <ref>[https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm Bellman–Ford algorithm from Wikipedia]</ref>
* [[David Eppstein]] ('''2012'''). ''Solving Single-digit Sudoku Subproblems''. [https://arxiv.org/abs/1202.5074 arXiv:1202.5074]
* [[David Eppstein]], [[Mathematician#MTGoodrich|Michael T. Goodrich]], [[Mathematician#MMitzenmacher|Michael Mitzenmacher]], [https://dblp.uni-trier.de/pers/hd/p/Pszona:Pawel Paweł Pszona] ('''2014'''). ''Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket''. [https://arxiv.org/abs/1404.0286 arXiv:1404.0286]
* [[Erik D. Demaine]], [[David Eppstein]], [https://dblp.uni-trier.de/pers/hd/h/Hesterberg:Adam Adam Hesterberg], [https://dblp.uni-trier.de/pers/hd/i/Ito:Hiro Hiro Ito], [[Mathematician#ALubiw|Anna Lubiw]], [https://dblp.uni-trier.de/pers/hd/u/Uehara:Ryuhei Ryuhei Uehara], [https://dblp.uni-trier.de/pers/hd/u/Uno:Yushi Yushi Uno] ('''2014'''). ''Folding a Paper Strip to Minimize Thickness''. [https://arxiv.org/abs/1411.6371 arXiv:1411.6371]
==2015 ...==
* [[David Eppstein]] ('''2016'''). ''Cuckoo Filter: Simplification and Analysis''. [https://arxiv.org/abs/1604.06067 arXiv:1604.06067] <ref>[https://en.wikipedia.org/wiki/Cuckoo_filter Cuckoo filter from Wikipedia]</ref>
* [[David Eppstein]], [[Mathematician#VVazirani|Vijay V. Vazirani]] ('''2018'''). ''NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs''. [https://arxiv.org/abs/1802.00084 arXiv:1802.00084] <ref>[https://en.wikipedia.org/wiki/NC_(complexity) NC (complexity) from Wikipedia]</ref>
* [[David Eppstein]] ('''2018'''). ''Faster Evaluation of Subtraction Games''. [https://arxiv.org/abs/1804.06515 arXiv:1804.06515]
* [[David Eppstein]] ('''2018'''). ''Making Change in 2048''. [https://arxiv.org/abs/1804.07396 arXiv:1804.07396]
* [[David Eppstein]] ('''2018'''). ''[https://www.ics.uci.edu/~eppstein/forbidden/ Forbidden Configurations in Discrete Geometry]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
* [[Erik D. Demaine]], [[David Eppstein]], [https://dblp.uni-trier.de/pers/hd/h/Hesterberg:Adam Adam Hesterberg], [https://dblp.uni-trier.de/pers/hd/j/Jain:Kshitij Kshitij Jain], [[Mathematician#ALubiw|Anna Lubiw]], [https://dblp.uni-trier.de/pers/hd/u/Uehara:Ryuhei Ryuhei Uehara], [https://dblp.uni-trier.de/pers/hd/u/Uno:Yushi Yushi Uno] ('''2019'''). ''Reconfiguring Undirected Paths''. [https://arxiv.org/abs/1905.00518 arXiv:1905.00518]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=12201 "Suspicious move" extension] by [[David Eppstein]], [[CCC]], November 20, 1997 » [[Extensions]]
* [https://www.stmintz.com/ccc/index.php?id=58 Using too-shallow mate scores from the hash table] by [[David Eppstein]], [[CCC]], July 05, 1998 » [[Transposition Table]]
: [https://www.stmintz.com/ccc/index.php?id=21814 Re: Using too-shallow mate scores from the hash table] by [[David Eppstein]], [[CCC]], July 06, 1998
* [https://www.stmintz.com/ccc/index.php?id=141876 Re: UCI (=universal chess interface)] by [[David Eppstein]], [[CCC]], November 29, 2000 » [[UCI]]
* [https://www.quora.com/Why-does-a-Wikipedia-administrator-David-Eppstein-aggressively-move-against-new-machine-learning-technologies Why does a Wikipedia administrator, David Eppstein, aggressively move against new machine learning technologies?] by David Bowie, [https://en.wikipedia.org/wiki/Quora Quora], July 2019
=Blog Posts=
* [https://11011110.github.io/blog/ 11011110], David Eppstein's blog
: [https://11011110.github.io/blog/2008/01/10/analyzing-algorithm-x.html Analyzing Algorithm X] in honor of [[Donald Knuth|Knuth's]] 70th birthday, by [[David Eppstein]], January 2008
: [https://11011110.github.io/blog/2010/08/30/chessboards-and-colorings.html Chessboards and colorings], by [[David Eppstein]], August 30, 2010
=External Links=
* [https://en.wikipedia.org/wiki/David_Eppstein David Eppstein from Wikipedia]
* [https://www.genealogy.math.ndsu.nodak.edu/id.php?id=120697 The Mathematics Genealogy Project - David Eppstein]
* [https://archive.vn/fano.ics.uci.edu Fano Experimental Web Server] (Archive)
==ICS.UCI.EDU==
* [https://www.ics.uci.edu/%7Eeppstein/ David Eppstein's homepage]
* [https://www.ics.uci.edu/~eppstein/cgt/hard.html Computational Complexity of Games and Puzzles] by David Eppstein » [[Games]]
* [https://www.ics.uci.edu/%7Eeppstein/projects/ David Eppstein's Research Projects]
* [https://www.ics.uci.edu/%7Eeppstein/pix/ David Eppstein's Photo Galleries]
==Lecture Notes==
* [https://www.ics.uci.edu/%7Eeppstein/180a/970408.html Lecture notes for April 8, 1997] [[Board Representation|Board Representations]]
* [https://www.ics.uci.edu/%7Eeppstein/180a/970422.html Lecture notes for April 22, 1997] [[Alpha-Beta|Alpha-Beta Search]]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Eppstein]]
[[Category:Researcher|Eppstein]]
[[FILE:Eppstein in Limerick.jpg|border|right|thumb| David Eppstein <ref>David Eppstein in [https://en.wikipedia.org/wiki/Limerick Limerick, Ireland], for the 13th [https://en.wikipedia.org/wiki/International_Symposium_on_Graph_Drawing International Symposium on Graph Drawing], September 15, 2005, Image by Elena Mumford, [https://en.wikipedia.org/wiki/David_Eppstein David Eppstein from Wikipedia], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
'''David A. Eppstein''',<br/>
an American mathematician and computer scientist.
He is professor in the Computer Science Department, [https://en.wikipedia.org/wiki/Donald_Bren_School_of_Information_and_Computer_Sciences Donald Bren School of Information and Computer Sciences], [https://en.wikipedia.org/wiki/University_of_California,_Irvine 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|algorithms]] and [[Data|data structures]], [https://en.wikipedia.org/wiki/Computational_complexity_theory complexity theory], [https://en.wikipedia.org/wiki/Graph_theory graph theory], such as [https://en.wikipedia.org/wiki/Minimum_spanning_tree minimum spanning tree], [https://en.wikipedia.org/wiki/Shortest_path_problem shortest path], and [https://en.wikipedia.org/wiki/Graph_coloring graph coloring] as well as [[Games|game theory]] and [https://en.wikipedia.org/wiki/Finite_element_method finite element methods].
He teaches [https://en.wikipedia.org/wiki/Strategy_game strategy] and [https://en.wikipedia.org/wiki/Board_game board game] [[Programming|programming]] and tried his own hands on [https://en.wikipedia.org/wiki/Fanorona Fanorona] <ref>[https://www.ics.uci.edu/%7Eeppstein/180a/projects/fanorona/ Fanorona] by David Eppstein</ref>,
a traditional board game from [https://en.wikipedia.org/wiki/Madagascar Madagascar].
=Selected Publications=
<ref>[https://www.ics.uci.edu/~eppstein/pubs/ David Eppstein - Publication]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/e/Eppstein:David dblp: David Eppstein]</ref>
==1985 ...==
* [[David Eppstein]] ('''1985'''). ''[https://www.semanticscholar.org/paper/A-Heuristic-Approach-to-Program-Inversion-Eppstein/3f259f7bab6ebce1071e1aafb808a8948907eed2 A Heuristic Approach to Program Inversion]''. [[Conferences#IJCAI1985|IJCAI 1985]]
* [[David Eppstein]], [[Mathematician#ZviGalil|Zvi Galil]], [[Mathematician#RGiancarlo|Raffaele Giancarlo]] ('''1988'''). ''[https://ieeexplore.ieee.org/document/21965 Speeding up Dynamic Programming]''. [https://dblp.uni-trier.de/db/conf/focs/focs88.html FOCS 1988]
* [[David Eppstein]], [[Mathematician#ZviGalil|Zvi Galil]] ('''1988'''). ''Parallel Algorithmic Techniques for Combinatorial Computation''. [https://dblp.uni-trier.de/db/conf/icalp/icalp89.html ICALP 1989], [https://www.ics.uci.edu/~eppstein/pubs/EppGal-ICALP-89.pdf pdf]
==1900 ...==
* [[David Eppstein]], [[Mathematician#ZviGalil|Zvi Galil]], [[Mathematician#RGiancarlo|Raffaele Giancarlo]], [[Mathematician#GFItaliano|Giuseppe F. Italiano]] ('''1990'''). ''Sparse Dynamic Programming''. [https://dblp.uni-trier.de/db/conf/soda/soda90.html SODA 1990], [http://www.cs.ust.hk/mjg_lib/bibs/DPSu/DPSu.Files/p513-eppstein.pdf pdf]
* [[David Eppstein]] ('''1990'''). ''Sequence Comparison with Mixed Convex and Concave Costs''. [https://www.journals.elsevier.com/journal-of-algorithms Journal of Algorithms], Vol. 11, No. 1, [https://www.ics.uci.edu/~eppstein/pubs/Epp-Algs-90.pdf pdf]
* [[David Eppstein]] ('''1992'''). ''[https://link.springer.com/article/10.1007/BF01994879 Finding the k Smallest Spanning Trees]''. [https://dblp.uni-trier.de/db/journals/bit/bit32.html BIT, Vol. 32]
* [[David Eppstein]] ('''1994'''). ''Finding the k Shortest Paths''. Tech. Report 94-26, [https://dblp.uni-trier.de/db/conf/focs/focs94.html 35th FOCS 1994], [https://www.ics.uci.edu/%7Eeppstein/pubs/Epp-TR-94-26.pdf TR-94-26.pdf]
==1995 ...==
* [[David Eppstein]] ('''1997'''). ''Dynamic Connectivity in Digital Images''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 62, No. 3, [https://www.ics.uci.edu/~eppstein/pubs/Epp-TR-96-13.pdf TR-96-13.pdf]
* [[David Eppstein]] ('''1998'''). ''Finding the k Shortest Paths''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 28, No. 2, [https://www.ics.uci.edu/~eppstein/pubs/Epp-SJC-98.pdf pdf]
* [[David Eppstein]] ('''1999'''). ''Setting Parameters by Example''. [https://arxiv.org/abs/cs/9907001 arXiv:cs/9907001]
==2000 ...==
* [[David Eppstein]] ('''2000'''). ''Searching for Spaceships''. [https://arxiv.org/abs/cs/0004003 arXiv:cs/0004003]
* [[Erik D. Demaine]], [[Martin L. Demaine]], [[David Eppstein]] ('''2000'''). ''Phutball Endgames are Hard''. [https://arxiv.org/abs/cs/0008025 arXiv:cs/0008025] <ref>[https://en.wikipedia.org/wiki/Phutball Phutball from Wikipedia]</ref>
* [https://dblp.uni-trier.de/pers/hd/m/Moore:Cristopher Cristopher Moore], [[David Eppstein]] ('''2000'''). ''One-Dimensional Peg Solitaire''. [https://arxiv.org/abs/math/0006067 arXiv:math/0006067] <ref>[https://en.wikipedia.org/wiki/Peg_solitaire Peg solitaire from Wikipedia]</ref>
* [https://dblp.uni-trier.de/pers/hd/m/Moore:Cristopher Cristopher Moore], [[David Eppstein]] ('''2000'''). ''One-Dimensional Peg Solitaire, and Duotaire''. [https://arxiv.org/abs/math/0008172 arXiv:math/0008172]
* [[David Eppstein]], [[Mathematician#SMMuthukrishnan|S. Muthukrishnan]] ('''2000'''). ''Internet Packet Filter Management and Rectangle Geometry''. [https://arxiv.org/abs/cs/0010018 arXiv:cs/0010018]
* [[David Eppstein]], [[Mathematician#JCFalmagne|Jean-Claude Falmagne]] ('''2002'''). ''Algorithms for Media''. [https://arxiv.org/abs/cs/0206033 arXiv:cs/0206033]
* [[David Eppstein]] ('''2004'''). ''Algorithms for Drawing Media''. [https://arxiv.org/abs/cs/0406020 arXiv:cs/0406020]
* [[David Eppstein]] ('''2004'''). ''Quasiconvex Programming''. [https://arxiv.org/abs/cs/0412046 arXiv:cs/0412046]
==2005 ...==
* [[David Eppstein]], [[Mathematician#MTGoodrich|Michael T. Goodrich]], [https://dblp.uni-trier.de/pers/hd/s/Sun:Jonathan_Z= Jonathan Z. Sun] ('''2005'''). ''The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data''. [https://arxiv.org/abs/cs/0507049 https://arxiv.org/abs/cs/050704]
* [[David Eppstein]] ('''2005'''). ''Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku''. [https://arxiv.org/abs/cs/0507053 arXiv:cs/0507053]
* [[David Eppstein]] ('''2008'''). ''Learning Sequences''. [https://arxiv.org/abs/0803.4030 arXiv:0803.4030]
* [[David Eppstein]], [[Mathematician#JCFalmagne|Jean-Claude Falmagne]], [https://dblp.uni-trier.de/pers/hd/o/Ovchinnikov:Sergei Sergei Ovchinnikov] ('''2008'''). ''[https://link.springer.com/book/10.1007%2F978-3-540-71697-6 Media Theory - interdisciplinary applied mathematics]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[David Eppstein]] ('''2009'''). ''Growth and Decay in Life-Like Cellular Automata''. [https://arxiv.org/abs/0911.2890 arXiv:0911.2890]
==2010 ...==
* [[Mathematician#MJBannister|Michael J. Bannister]], [[David Eppstein]] ('''2011'''). ''Randomized Speedup of the Bellman-Ford Algorithm''. [https://arxiv.org/abs/1111.5414 arXiv:1111.5414] <ref>[https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm Bellman–Ford algorithm from Wikipedia]</ref>
* [[David Eppstein]] ('''2012'''). ''Solving Single-digit Sudoku Subproblems''. [https://arxiv.org/abs/1202.5074 arXiv:1202.5074]
* [[David Eppstein]], [[Mathematician#MTGoodrich|Michael T. Goodrich]], [[Mathematician#MMitzenmacher|Michael Mitzenmacher]], [https://dblp.uni-trier.de/pers/hd/p/Pszona:Pawel Paweł Pszona] ('''2014'''). ''Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket''. [https://arxiv.org/abs/1404.0286 arXiv:1404.0286]
* [[Erik D. Demaine]], [[David Eppstein]], [https://dblp.uni-trier.de/pers/hd/h/Hesterberg:Adam Adam Hesterberg], [https://dblp.uni-trier.de/pers/hd/i/Ito:Hiro Hiro Ito], [[Mathematician#ALubiw|Anna Lubiw]], [https://dblp.uni-trier.de/pers/hd/u/Uehara:Ryuhei Ryuhei Uehara], [https://dblp.uni-trier.de/pers/hd/u/Uno:Yushi Yushi Uno] ('''2014'''). ''Folding a Paper Strip to Minimize Thickness''. [https://arxiv.org/abs/1411.6371 arXiv:1411.6371]
==2015 ...==
* [[David Eppstein]] ('''2016'''). ''Cuckoo Filter: Simplification and Analysis''. [https://arxiv.org/abs/1604.06067 arXiv:1604.06067] <ref>[https://en.wikipedia.org/wiki/Cuckoo_filter Cuckoo filter from Wikipedia]</ref>
* [[David Eppstein]], [[Mathematician#VVazirani|Vijay V. Vazirani]] ('''2018'''). ''NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs''. [https://arxiv.org/abs/1802.00084 arXiv:1802.00084] <ref>[https://en.wikipedia.org/wiki/NC_(complexity) NC (complexity) from Wikipedia]</ref>
* [[David Eppstein]] ('''2018'''). ''Faster Evaluation of Subtraction Games''. [https://arxiv.org/abs/1804.06515 arXiv:1804.06515]
* [[David Eppstein]] ('''2018'''). ''Making Change in 2048''. [https://arxiv.org/abs/1804.07396 arXiv:1804.07396]
* [[David Eppstein]] ('''2018'''). ''[https://www.ics.uci.edu/~eppstein/forbidden/ Forbidden Configurations in Discrete Geometry]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
* [[Erik D. Demaine]], [[David Eppstein]], [https://dblp.uni-trier.de/pers/hd/h/Hesterberg:Adam Adam Hesterberg], [https://dblp.uni-trier.de/pers/hd/j/Jain:Kshitij Kshitij Jain], [[Mathematician#ALubiw|Anna Lubiw]], [https://dblp.uni-trier.de/pers/hd/u/Uehara:Ryuhei Ryuhei Uehara], [https://dblp.uni-trier.de/pers/hd/u/Uno:Yushi Yushi Uno] ('''2019'''). ''Reconfiguring Undirected Paths''. [https://arxiv.org/abs/1905.00518 arXiv:1905.00518]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=12201 "Suspicious move" extension] by [[David Eppstein]], [[CCC]], November 20, 1997 » [[Extensions]]
* [https://www.stmintz.com/ccc/index.php?id=58 Using too-shallow mate scores from the hash table] by [[David Eppstein]], [[CCC]], July 05, 1998 » [[Transposition Table]]
: [https://www.stmintz.com/ccc/index.php?id=21814 Re: Using too-shallow mate scores from the hash table] by [[David Eppstein]], [[CCC]], July 06, 1998
* [https://www.stmintz.com/ccc/index.php?id=141876 Re: UCI (=universal chess interface)] by [[David Eppstein]], [[CCC]], November 29, 2000 » [[UCI]]
* [https://www.quora.com/Why-does-a-Wikipedia-administrator-David-Eppstein-aggressively-move-against-new-machine-learning-technologies Why does a Wikipedia administrator, David Eppstein, aggressively move against new machine learning technologies?] by David Bowie, [https://en.wikipedia.org/wiki/Quora Quora], July 2019
=Blog Posts=
* [https://11011110.github.io/blog/ 11011110], David Eppstein's blog
: [https://11011110.github.io/blog/2008/01/10/analyzing-algorithm-x.html Analyzing Algorithm X] in honor of [[Donald Knuth|Knuth's]] 70th birthday, by [[David Eppstein]], January 2008
: [https://11011110.github.io/blog/2010/08/30/chessboards-and-colorings.html Chessboards and colorings], by [[David Eppstein]], August 30, 2010
=External Links=
* [https://en.wikipedia.org/wiki/David_Eppstein David Eppstein from Wikipedia]
* [https://www.genealogy.math.ndsu.nodak.edu/id.php?id=120697 The Mathematics Genealogy Project - David Eppstein]
* [https://archive.vn/fano.ics.uci.edu Fano Experimental Web Server] (Archive)
==ICS.UCI.EDU==
* [https://www.ics.uci.edu/%7Eeppstein/ David Eppstein's homepage]
* [https://www.ics.uci.edu/~eppstein/cgt/hard.html Computational Complexity of Games and Puzzles] by David Eppstein » [[Games]]
* [https://www.ics.uci.edu/%7Eeppstein/projects/ David Eppstein's Research Projects]
* [https://www.ics.uci.edu/%7Eeppstein/pix/ David Eppstein's Photo Galleries]
==Lecture Notes==
* [https://www.ics.uci.edu/%7Eeppstein/180a/970408.html Lecture notes for April 8, 1997] [[Board Representation|Board Representations]]
* [https://www.ics.uci.edu/%7Eeppstein/180a/970422.html Lecture notes for April 22, 1997] [[Alpha-Beta|Alpha-Beta Search]]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Eppstein]]
[[Category:Researcher|Eppstein]]
