279 citations to https://www.mathnet.ru/rus/sm2805
-
Katrin Erk, Informatik aktuell, Informatik 2000, 2000, 146
-
Katrin Erk, Joachim Niehren, Lecture Notes in Computer Science, 1833, Rewriting Techniques and Applications, 2000, 110
-
Gösta Grahne, Emmanuel Waller, Lecture Notes in Computer Science, 1949, Research Issues in Structured and Semistructured Database Programming, 2000, 61
-
Volker Diekert, Yuri Matiyasevich, Anca Muscholl, “Solving word equations modulo partial commutations”, Theoretical Computer Science, 224:1-2 (1999), 215
-
Noriko Sugimoto, Hiroki Ishizaka, “Generating languages by a derivation procedure for elementary formal systems”, Information Processing Letters, 69:4 (1999), 161
-
Gurevich Y., Voronkov A., “Monadic Simultaneous Rigid E-Unification”, Theor. Comput. Sci., 222:1-2 (1999), 133–152
-
Beauquier J., Berard B., Fribourg L., “A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems”, Distributed Computing, Lecture Notes in Computer Science, 1693, ed. Jayanti P., Springer-Verlag Berlin, 1999, 240–253
-
Rytter W., “Algorithms on Compressed Strings and Arrays”, Sofsem'99: Theory and Practice of Informatics, Lecture Notes in Computer Science, 1725, eds. Pavelka J., Tel G., Bartosek M., Springer-Verlag Berlin, 1999, 48–65
-
Robson J., Diekert V., “On Quadratic Word Equations”, Stacs'99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 1563, eds. Meinel C., Tison S., Springer-Verlag Berlin, 1999, 217–226
-
Manfred Schmidt-Schauß, Klaus U. Schulz, Lecture Notes in Computer Science, 1632, Automated Deduction — CADE-16, 1999, 67