A PTIME-complete matching problem for SLP-compressed words
Information Processing Letters
One-Nonterminal Conjunctive Grammars over a Unary Alphabet
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
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
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
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
Querying and embedding compressed texts
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Fast equality test for straight-line compressed strings
Information Processing Letters
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Isomorphism of regular trees and words
Information and Computation
| Hi-index | 0.00 |