The complexity of the exponential output size problem for top-down and bottom-up tree transducers
Information and Computation
Directional Type Checking for Logic Programs: Beyond Discriminative Types
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Typechecking Top-Down Uniform Unranked Tree Transducers
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Unification in a Description Logic with Transitive Closure of Roles
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Synchronized Tree Languages Revisited and New Applications
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Exponential Output Size of Top-Down Tree Transducers
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Set constraints with intersection
Information and Computation - Special issue: LICS'97
Ground reducibility is EXPTIME-complete
Information and Computation
The liberty structural specification language: a high-level modeling language for component reuse
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Constraint-set satisfiability for overloading
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Facilitating reuse in hardware models with enhanced type inference
Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Unification Modulo ACUI Plus Distributivity Axioms
Journal of Automated Reasoning
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science - Automata, languages and programming
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Information Processing Letters
Alternating two-way AC-tree automata
Information and Computation
Transducer-based analysis of cryptographic protocols
Information and Computation
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Language and Automata Theory and Applications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation
Information Processing Letters
Information Processing Letters
On the alternation-free horn µ-calculus
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Earliest query answering for deterministic nested word automata
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Queries on Xml streams with bounded delay and concurrency
Information and Computation
Rigid tree automata and applications
Information and Computation
Exact XML type checking in polynomial time
ICDT'07 Proceedings of the 11th international conference on Database Theory
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
Complexity of subtype satisfiability over posets
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
| Hi-index | 0.89 |