Timothy Furtak

According to our database, Timothy Furtak authored at least 8 papers between 2005 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2013

Recursive Monte Carlo search for imperfect information games.

Timothy Furtak, Michael Buro

Proceedings of the 2013 IEEE Conference on Computational Inteligence in Games (CIG), 2013

2011

Using Payoff-Similarity to Speed Up Search.

Timothy Furtak, Michael Buro

Proceedings of the IJCAI 2011, 2011

2010

On the Complexity of Two-Player Attrition Games Played on Graphs.

Timothy Furtak, Michael Buro

Proceedings of the Sixth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2010

Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search.

Jeffrey Richard Long, Nathan R. Sturtevant, Michael Buro, Timothy Furtak

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Minimum Proof Graphs and Fastest-Cut-First Search Heuristics.

Timothy Furtak, Michael Buro

Proceedings of the IJCAI 2009, 2009

Improving State Evaluation, Inference, and Search in Trick-Based Card Games.

Michael Buro, Jeffrey Richard Long, Timothy Furtak, Nathan R. Sturtevant

Proceedings of the IJCAI 2009, 2009

2007

Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms.

Timothy Furtak, José Nelson Amaral, Robert Niewiadomski

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

2005

Generalized Amazons is PSPACE-Complete.

Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005