PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query automata over finite trees
Theoretical Computer Science
Towards Regular Languages over Infinite Alphabets
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
From Bidirectionality to Alternation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Extended Temporal Logic Revisited
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Extensions of Attribute Grammars for Structured Document Queries
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
A Web odyssey: from codd to XML
ACM SIGMOD Record
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Attribute grammars for unranked trees as a query language for structured documents
Journal of Computer and System Sciences
Complementing deterministic tree-walking automata
Information Processing Letters
Two-way finite automata with a write-once track
Journal of Automata, Languages and Combinatorics
A Rice-style theorem for parallel automata
Information and Computation
State complexity of unique rational operations
Theoretical Computer Science
Bounded-variable fragments of hybrid logics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Pebble weighted automata and transitive closure logics
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
Nested pebbles and transitive closure
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Complexity of pebble tree-walking automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Adding pebbles to weighted automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic (TOCL)
Vibes: A visual language for specifying behavioral requirements of algorithms
Journal of Visual Languages and Computing
| Hi-index | 0.00 |