ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
ACM Computing Surveys (CSUR)
Axiomatizing the logical core of XPath 2.0
ICDT'07 Proceedings of the 11th international conference on Database Theory
Tree automata make ordinal theory easy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
The complexity of model checking higher order fixpoint logic
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Analogs of fagin's theorem for small nondeterministic finite automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
The Complexity of Model Checking Multi-stack Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |