Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
Theoretical Computer Science
The Complexity of Graph Ramsey Games
CG '00 Revised Papers from the Second International Conference on Computers and Games
On the fairness and complexity of generalized k-in-a-row games
Theoretical Computer Science
Computational Complexity of Cast Puzzles
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Satin: A high-level and efficient grid programming model
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Automated verification of state sequence invariants in general game playing
Artificial Intelligence
An algorithmic analysis of the Honey-Bee game
Theoretical Computer Science
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Computational complexity of string puzzles
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
On the complexity of trick-taking card games
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 5.24 |