279 citations to https://www.mathnet.ru/rus/sm2805
  1. Christian Choffrut, Juhani Karhumäki, Handbook of Formal Languages, 1997, 329  crossref
  2. Lila Kari, Grzegorz Rozenberg, Arto Salomaa, Handbook of Formal Languages, 1997, 253  crossref
  3. J. Goubault-Larrecq, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997, 410  crossref
  4. Joachim Niehren, Manfred Pinkal, Peter Ruhrberg, Lecture Notes in Computer Science, 1249, Automated Deduction—CADE-14, 1997, 34  crossref
  5. Koscielski A., Pacholski L., “Complexity of Makanin's Algorithm”, J. ACM, 43:4 (1996), 670–684  crossref  mathscinet  zmath  isi
  6. SchmidtSchauss M., “An Algorithm for Distributive Unification”, Rewriting Techniques and Applications, Lecture Notes in Computer Science, 1103, ed. Ganzinger H., Springer-Verlag Berlin, 1996, 287–301  crossref  mathscinet  isi
  7. Otten J., Kreitz C., “T-String Unification: Unifying Prefixes in Non-Classical Proof Methods”, Theorem Proving with Analytic Tableaux and Related Methods, Lecture Notes in Artificial Intelligence, 1071, eds. Miglioli P., Moscato U., Mundici D., Ornaghi M., Springer-Verlag Berlin, 1996, 244–260  mathscinet  zmath  isi
  8. A. Degtyarev, A. Voronkov, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1996, 503  crossref
  9. Heinz Faßbender, Sebastian Maneth, Lecture Notes in Computer Science, 1139, Algebraic and Logic Programming, 1996, 194  crossref
  10. A. Degtyarev, Y. Matiyasevich, A. Voronkov, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1996, 494  crossref
Предыдущая
1
18
19
20
21
22
23
24
28
Следующая