Generalized Amazons is PSPACE-Complete. - Timothy Furtak; Masashi Kiyomi; Takeaki Uno; Michael Buro (IJCAI, 2005)

Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms. - Timothy Furtak; José Nelson Amaral; Robert Niewiadomski (SPAA, 2007)

Improving State Evaluation, Inference, and Search in Trick-Based Card Games. - Michael Buro; Jeffrey Richard Long; Timothy Furtak; Nathan R. Sturtevant (IJCAI, 2009)

Minimum Proof Graphs and Fastest-Cut-First Search Heuristics. - Timothy Furtak; Michael Buro (IJCAI, 2009)

Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search. - Jeffrey Richard Long; Nathan R. Sturtevant; Michael Buro; Timothy Furtak (AAAI, 2010)

On the Complexity of Two-Player Attrition Games Played on Graphs. - Timothy Furtak; Michael Buro (AIIDE, 2010)

Using Payoff-Similarity to Speed Up Search. - Timothy Furtak; Michael Buro (IJCAI, 2011)

Recursive Monte Carlo search for imperfect information games. - Timothy Furtak; Michael Buro (CIG, 2013)