The closure of Monadic NP (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
On Complexity of Ehrenfeucht-Fraïssé Games
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Games on Strings with a Limited Order Relation
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
An algorithmic account of ehrenfeucht games on labeled successor structures
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 5.23 |