Minimal and complete word unification
Journal of the ACM (JACM)
Complexity of Makanin's algorithm
Journal of the ACM (JACM)
The Expressibility of Languages and Relations by Word Equations
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Application of Lempel-Ziv Encodings to the Solution of Words Equations
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
The Security of Individual RSA Bits
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Satisfiability of equations in free groups is in PSPACE
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On Word Equations in One Variable
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
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 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
Stratified Context Unification Is in PSPACE
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
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
Decidability of bounded second order unification
Information and Computation
Satisfiability of word equations with constants is in PSPACE
Journal of the ACM (JACM)
The non-parametrizability of the word equation xyz=zvx: a short proof
Theoretical Computer Science - Mathematical foundations of computer science 2004
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
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
Theoretical Computer Science
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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 |