David Wolfe's Publications

Books

• Puzzlers' Tribute: A Feast for the Mind, with Tom Rodgers (editors), A K Peters, Natick, MA. 2001.

• Mathematical Go: Chilling Gets the Last Point, with Elwyn Berlekamp, A K Peters, Wellesley, MA, January 1994. Also in paperback as Mathematical Go Endgames: Nightmares For the Professional Go Player, Ishi Press International, San Jose, CA, December 1993. In Japanese as Igo no Sempo: Yose no Kenkyu, Translation by Yoshikawa Takeshiro, Toppan, Tokyo, Japan, November 1994.

Refereed papers

• ``When Multiplication Mixes Up Digits.'' Mathematics Magazine, Volume 80, Number 5, December 2007, pages 380-383. Also to appear in an upcoming Martin Gardner tribute book to be published by A K Peters, Wellesley, MA, 2008. Paper in pdf.

• ``Counting the number of games,'' with William Fraser. Theoretical Computer Science, special issue on Algorithmic Combinatorial Game Theory, Volume 313, Issue 3, February 2004, pages 527-532. Journal article available on-line. Earlier draft available in postscript or pdf.

• ``The structure of the distributive lattice of games born by day n,'' with William Fraser and Susan Hirshberg. Presented at the Algorithmic Combinatorial Game Theory Seminar, International Conference and Research Center for Computer Science, Schloss Dagstuhl, Germany, April 2002. INTEGERS: The Electronic Journal of Combinatorial Number Theory, Volume 5(2), A6, 2005. Paper in postscript or pdf. Presentation abstract with slides in postscript or pdf.

• ``Distinguishing gamblers from investors at the blackjack table.'' In Computers and Games: Third International Conference, CG 2002, Edmonton, Canada, July 2002. Springer-Verlag, pages 1-10 . Paper in postscript or pdf. Presentation abstract with slides in postscript or pdf; or a longer version of the talk in postscript or pdf.

• ``On the lattice structure of finite games,'' with Dan Calistrate and Marc Paulhus, More Games of No Chance, Cambridge University Press, 2002. Paper in postscript or pdf. Presentation abstract with slides in postscript or pdf.

• ``Go endgames are PSPACE-hard,'' More Games of No Chance, Cambridge University Press, 2002. Combinatorial Game Theory Research Workshop, Mathematical Sciences Research Institute, July, 2000. Paper in Postscript. Presentation abstract with slides in Postscript or PDF.

• ``String layout in redundant disk arrays,'' with Lee Newberg, Algorithmica, Vol. 12, 209-224, August/September 1994. U.C. Berkeley Report No. UCB/CSD 91/625, April, 1991. Presentation in postscript.

• ``The gamesman's toolkit,'' Games of No Chance: Combinatorial Games at MSRI, 1994, Cambridge University Press, 1996.

• ``Snakes in domineering games,'' Theoretical Computer Science, Vol. 119, No. 2, 323-329, October 25, 1993. Paper in postscript.

• ``The complexity of facets resolved,'' with Christos Papadimitriou, Journal of Computer and System Sciences, Vol. 37, No. 1, 2-13, August 1988. Proceedings of the 26th Symposium on Foundations of Computer Science, 74-78, 1985. Cornell Report No. TR85-702, September 1985.

Other communications

• ``Parity Party with Picture Proofs,'' with Erick Knight. Overhead slides in postscript or pdf.

• ``Underspecified Puzzles,'' with Susan Hirshberg. Erik Demaine, Martin Demaine, Barry Cipra, and Tom Rodgers editors, Tribute to a Mathemagician, A K Peters, Wellesley, MA, 2004.

• ``An Introduction to Clobber,'' with Michael Albert, J. P. Grossman, and Richard Nowakowski. INTEGERS: The Electronic Journal of Combinatorial Number Theory, Volume 5(2), A1, 2005. Available in postscript.

• ``Ordinal Partisan End Nim,'' with Adam Duffy and Garrett Kolpin. Paper to be submitted to Mathematical Monthly in postscript or PDF. Slides in postscript or PDF.

• ``Automatic detection of egg shell cracks,'' with Rachel Kuske, David Lyder, Jonathan Samuel and Chris Soteros. Proceedings of the Second PIMS Industrial Problem Solving Workshop, June 1998, pages 109-121. Paper in Postscript.

• ``Bounding delays in packet-routing networks,'' with Mor Harchol-Balter Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, NV, May 1995, pages 248-257. Postscript. Extended version Postscript. Mor Harchol-Balter's presentation in postscript.

• ``Undergraduate research opportunities in combinatorial games,'' Joint Mathematics Meetings, January, 1995. Journal of Undergraduate Mathematics and its Applications, Vol. 16, No. 1, 1995. Handout in postscript. Talk slides in postscript .

• ``In networks of queues, M/M/1 can outperform M/D/1,'' with Mor Harchol-Balter, U.C. Berkeley Report No. UCB/CSD-94-841, November 1994.

• ``Constant beats memoryless for service times in a Markovian queueing network,'' with Mor Harchol-Balter, U.C. Berkeley Report No. UCB/CSD-94-820, July 1994.

• ``Mathematical Go,'' Combinatorial Games Workshop, Mathematical Sciences Research Institute, July, 1994. Talk slides.

• ``Invading corridors of territory in Go,'' with Elwyn Berlekamp, 93rd Summer Meeting of the American Math Society, August 1990.