Pattern Matching and Membership for Hierarchical Message Sequence Charts
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Satisfiability of word equations with constants is in PSPACE
Journal of the ACM (JACM)
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
Prime normal form and equivalence of simple grammars
Theoretical Computer Science - Implementation and application of automata
Efficient memory representation of XML document trees
Information Systems
Logical Interpretation: Static Program Analysis Using Theorem Proving
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Theoretical Computer Science
Parameter Reduction in Grammar-Compressed Trees
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Compressed Word Problems in HNN-Extensions and Amalgamated Products
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
Test sets for large families of languages
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Complexity results on balanced context-free languages
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Computing procedure summaries for interprocedural analysis
ESOP'07 Proceedings of the 16th European conference on Programming
Computing longest common substring and all palindromes from compressed strings
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Equivalence of deterministic nested word to word transducers
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Compressed conjugacy and the word problem for outer automorphism groups of graph groups
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Properties of visibly pushdown transducers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
View update translation for XML
Proceedings of the 14th International Conference on Database Theory
Unification and matching on compressed terms
ACM Transactions on Computational Logic (TOCL)
Leaf languages and string compression
Information and Computation
Compressed membership in automata with compressed labels
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Isomorphism of regular trees and words
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Compressedword problems for inverse monoids
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Congruence closure of compressed terms in polynomial time
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Efficient memory representation of XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Functional programs as compressed data
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Querying and embedding compressed texts
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Fast equality test for straight-line compressed strings
Information Processing Letters
Well-nested context unification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Bounded second-order unification is NP-complete
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
XML validation for context-free grammars
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Prime normal form and equivalence of simple grammars
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Parameter reduction and automata evaluation for grammar-compressed trees
Journal of Computer and System Sciences
New algorithms for unification modulo one-sided distributivity and its variants
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Faster fully compressed pattern matching by recompression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Isomorphism of regular trees and words
Information and Computation
XML tree structure compression using RePair
Information Systems
| Hi-index | 0.01 |