P4-trees and substitution decomposition
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
A note on the number of monadic quantifiers in monadic S11
Information Processing Letters
On a monadic NP vs monadic co-NP
Information and Computation
On winning strategies in Ehrenfeucht-Fraïssé games
Theoretical Computer Science
Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
The Monadic Quantifier Alternation Hierarchy over Grids and Pictures
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Descriptive and Computational Complexity
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
On the complexity of the containment problem for conjunctive queries with built-in predicates
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
String operations in query languages
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Theoretical Computer Science
A Toolkit for First Order Extensions of Monadic Games
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation - Special issue: LICS'97
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
Decidable relationships between consistency notions for constraint satisfaction problems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On the expressive power of graph logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |