25,161
edits
Changes
no edit summary
=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> <ref>[https://scholar.google.com/citations?user=QSY7ufMAAAAJ&hl=en David Eppstein - Google Scholar Citations]</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]
* [[David Eppstein]] ('''1989'''). ''[https://www.semanticscholar.org/paper/Efficient-algorithms-for-sequence-analysis-with-and-Eppstein/9ac9030f63ecc04ada24ebfcd159da9d8817156f Efficient Algorithms for Sequence Analysis with Concave and Convex Gap Costs]''. Ph.D. thesis, [[Columbia University]], advisor [[Mathematician#ZviGalil|Zvi Galil]]
==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]], [[Mathematician#ZviGalil|Zvi Galil]], [[Mathematician#RGiancarlo|Raffaele Giancarlo]], [[Mathematician#GFItaliano|Giuseppe F. Italiano]] ('''1993'''). ''[https://link.springer.com/chapter/10.1007/978-1-4613-9323-8_17 Efficient Algorithms for Sequence Analysis]''. [https://link.springer.com/book/10.1007/978-1-4613-9323-8 Sequences II], [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], [https://www.ics.uci.edu/~eppstein/pubs/EppGalGia-IAWS-91.pdf pdf]
* [[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 ...==
* [https://www.ics.uci.edu/%7Eeppstein/projects/ David Eppstein's Research Projects]
* [https://www.ics.uci.edu/%7Eeppstein/pix/ David Eppstein's Photo Galleries]
* [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]]
* [https://www.ics.uci.edu/~eppstein/180a/index.html ICS 180, Winter 1999 - Strategy and board game programming]
=References=
