View-based query processing for regular path queries with inverse
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Typechecking Top-Down Uniform Unranked Tree Transducers
ICDT '03 Proceedings of the 9th International Conference on Database Theory
From Bidirectionality to Alternation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
View-Based Query Answering and Query Containment over Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
View-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science
Complementing two-way finite automata
Information and Computation
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On Regular Temporal Logics with Past,
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Alternation elimination for automata over nested words
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Removing bidirectionality from nondeterministic finite automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Complexity of pebble tree-walking automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
From Two-Way to One-Way Finite State Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.89 |