W. Plandowski, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999, 495
Antoni Kościelski, Leszek Pacholski, “Makanin's algorithm is not primitive recursive”, Theoretical Computer Science, 191:1-2 (1998), 145
Friedrich Otto, Paliath Narendran, Daniel J. Dougherty, “Equational unification, word unification, and 2nd-order equational unification”, Theoretical Computer Science, 198:1-2 (1998), 1
Manfred Schmidt-Schauβ, “A decision algorithm for distributive unification”, Theoretical Computer Science, 208:1-2 (1998), 111
O. Kharlampovich, A. Myasnikov, “Irreducible Affine Varieties over a Free Group”, Journal of Algebra, 200:2 (1998), 517
Plandowski W., Rytter W., “Application of Lempel-Ziv Encodings to the Solution of Word Equations”, Automata, Languages and Programming, Lecture Notes in Computer Science, 1443, eds. Larsen K., Skyum S., Winskel G., Springer-Verlag Berlin, 1998, 731–742
M. Veanes, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), 1998, 264
Claudio Gutiérrez, Lecture Notes in Computer Science, 1380, LATIN'98: Theoretical Informatics, 1998, 358
C. Gutierrez, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 1998, 112
Jordi Levy, Lecture Notes in Computer Science, 1379, Rewriting Techniques and Applications, 1998, 47