Yu. V. Matiyasevich, Mathematical Events of the Twentieth Century, 2006, 185
Elena Czeizler, “The non-parametrizability of the word equation : A short proof”, Theoretical Computer Science, 345:2-3 (2005), 296
Manfred Schmidt-Schauß, Klaus U. Schulz, “Decidability of bounded higher-order unification”, Journal of Symbolic Computation, 40:2 (2005), 905
Diekert V., Gutierrez C., Hagenah C., “The Existential Theory of Equations with Rational Constraints in Free Groups Is Pspace-Complete”, Inf. Comput., 202:2 (2005), 105–140
Jordi Levy, Joachim Niehren, Mateu Villaret, Lecture Notes in Computer Science, 3632, Automated Deduction – CADE-20, 2005, 149
Manfred Schmidt-Schauß, Lecture Notes in Computer Science, 2605, Mechanizing Mathematical Reasoning, 2005, 154
Manfred Schmidt-Schauß, “Decidability of bounded second order unification”, Information and Computation, 188:2 (2004), 143
Plandowski W., “Satisfiability of Word Equations with Constants Is in Pspace”, J. ACM, 51:3 (2004), 483–496
Rytter W., “Grammar Compression, Lz-Encodings, and String Algorithms with Implicit Input”, Automata , Languages and Programming, Proceedings, Lecture Notes in Computer Science, 3142, eds. Diaz J., Karhumaki J., Lepisto A., Sannella D., Springer-Verlag Berlin, 2004, 15–27
Zhang T., Sipma H., Manna Z., “Decision Procedures for Recursive Data Structures with Integer Constraints”, Automated Reasoning, Proceedings, Lecture Notes in Artificial Intelligence, 3097, eds. Basin D., Rusinowitch M., Springer-Verlag Berlin, 2004, 152–167