Satisfiability of word equations with constants is in NEXPTIME
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Satisfiability of equations in free groups is in PSPACE
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Recognizing string graphs in NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On Word Equations in One Variable
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Algorithms for Normal Curves and Surfaces
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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
Equations in free semigroups with involution and their relation to equations in free groups
Theoretical Computer Science - Latin American theoretical informatics
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Recognizing string graphs in NP
Journal of Computer and System Sciences - STOC 2002
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
An efficient algorithm for solving word equations
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
A remark about quadratic trace equations
DLT'02 Proceedings of the 6th international conference on Developments in language theory
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A word equation solver based on Levensthein distance
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
A symbolic intruder model for hash-collision attacks
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Systems of equations satisfied in all commutative finite semigroups
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Well-nested context unification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Tracing compressed curves in triangulated surfaces
Proceedings of the twenty-eighth annual symposium on Computational geometry
One-Variable word equations in linear time
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |