Michael Buro

	2009
26		Michael Buro, Jeffrey R. Long, Timothy Furtak, Nathan R. Sturtevant: Improving State Evaluation, Inference, and Search in Trick-Based Card Games. IJCAI 2009: 1407-1413
25		Timothy Furtak, Michael Buro: Minimum Proof Graphs and Fastest-Cut-First Search Heuristics. IJCAI 2009: 492-498
	2007
24		Michael Buro, Alexander Kovarsky: Concurrent Action Execution with Shared Fluents. AAAI 2007: 950-955
23		M. Renee Jansen, Michael Buro: HPA* Enhancements. AIIDE 2007: 84-87
	2006
22		Douglas Demyen, Michael Buro: Efficient Triangulation-Based Pathfinding. AAAI 2006
21		Nathan R. Sturtevant, Michael Buro: Improving Collaborative Pathfinding Using Map Abstraction. AIIDE 2006: 80-85
	2005
20		Nathan R. Sturtevant, Michael Buro: Partial Pathfinding Using Map Abstraction and Refinement. AAAI 2005: 1392-1397
19		Michael Chung, Michael Buro, Jonathan Schaeffer: Monte Carlo Planning in RTS Games. CIG 2005
18		Alexander Kovarsky, Michael Buro: Heuristic Search Applied to Abstract Combat Games. Canadian Conference on AI 2005: 66-78
17		Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro: Generalized Amazons is PSPACE-Complete. IJCAI 2005: 132-137
16		Nathan R. Sturtevant, Vadim Bulitko, Michael Buro: Automatic State Abstraction for Pathfinding in Real-Time Video Games. SARA 2005: 362-364
15		Dave Gomboc, Michael Buro, T. Anthony Marsland: Tuning evaluation functions by maximizing concordance. Theor. Comput. Sci. 349(2): 202-229 (2005)
	2004
14		Thomas Hauk, Michael Buro, Jonathan Schaeffer: Rediscovering *-Minimax Search. Computers and Games 2004: 35-50
13		Thomas Hauk, Michael Buro, Jonathan Schaeffer: *-Minimax Performance in Backgammon. Computers and Games 2004: 51-66
	2003
12		Dave Gomboc, T. Anthony Marsland, Michael Buro: Evaluation Function Tuning via Ordinal Correlation. ACG 2003: 1-18
11		Albert Xin Jiang, Michael Buro: First Experimental Results of ProbCut Applied to Chess. ACG 2003: 19-32
10		Michael Buro: Solving the Oshi-Zumo Game. ACG 2003: 361-366
9		Michael Buro: Real-Time Strategy Games: A New AI Research Challenge. IJCAI 2003: 1534-1535
	2002
8		Michael Buro: ORTS: A Hack-Free RTS Game Environment. Computers and Games 2002: 280-291
7		Michael Buro: The evolution of strong othello programs. IWEC 2002: 81-88
6		Michael Buro: Improving heuristic mini-max search by supervised learning. Artif. Intell. 134(1-2): 85-99 (2002)
	2000
5		Michael Buro: Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs. Computers and Games 2000: 250-261
	1998
4		Michael Buro: From Simple Features to Sophisticated Evaluation Functions. Computers and Games 1998: 126-145
	1996
3		Michael Buro, Hans Kleine Büning: On Resolution with Short Clauses. Ann. Math. Artif. Intell. 18(2-4): 243-260 (1996)
	1995
2		Michael Buro: Statistical Feature Combination for the Evaluation of Game Positions. J. Artif. Intell. Res. (JAIR) 3: 373-382 (1995)
	1993
1		Michael Buro: On the Maximum Length of Huffman Codes. Inf. Process. Lett. 45(5): 219-223 (1993)

Coauthor Index

1	Vadim Bulitko	[16]
2	Hans Kleine Büning	[3]
3	Michael Chung	[19]
4	Douglas Demyen	[22]
5	Timothy Furtak	[17] [25] [26]
6	Dave Gomboc	[12] [15]
7	Thomas Hauk	[13] [14]
8	M. Renee Jansen	[23]
9	Albert Xin Jiang	[11]
10	Masashi Kiyomi	[17]
11	Alexander Kovarsky	[18] [24]
12	Jeffrey R. Long	[26]
13	T. Anthony Marsland	[12] [15]
14	Jonathan Schaeffer	[13] [14] [19]
15	Nathan R. Sturtevant	[16] [20] [21] [26]
16	Takeaki Uno	[17]

Colors in the list of coauthors