The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yuri Matiyasevich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yuri Matiyasevich
    Word Problem for Thue Systems with a Few Relations. [Citation Graph (0, 0)][DBLP]
    Term Rewriting, 1993, pp:39-53 [Conf]
  2. Yuri Matiyasevich
    Hilbert's Tenth Problem and Paradigms of Computation. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:310-321 [Conf]
  3. Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri Matiyasevich
    Window Subsequence Problems for Compressed Texts. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:127-136 [Conf]
  4. Volker Diekert, Yuri Matiyasevich, Anca Muscholl
    Solving Trace Equations Using Lexicographical Normal Forms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:336-346 [Conf]
  5. Yuri Matiyasevich
    Some Decision Problems for Traces. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:248-257 [Conf]
  6. Anatoli Degtyarev, Yuri Matiyasevich, Andrei Voronkov
    Simultaneous E-Unification and Related Algorithmic Problems. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:494-502 [Conf]
  7. Yuri Matiyasevich, Géraud Sénizergues
    Decision Problems for Semi-Thue Systems with a Few Rules. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:523-531 [Conf]
  8. Yuri Matiyasevich
    Universal Polynomials. [Citation Graph (0, 0)][DBLP]
    MCU (1), 1998, pp:1-20 [Conf]
  9. Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich
    Window-Accumulated Subsequence Matching Problem is Linear. [Citation Graph (0, 16)][DBLP]
    PODS, 1999, pp:327-336 [Conf]
  10. Yuri Matiyasevich
    On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:1- [Conf]
  11. Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich
    Window-accumulated subsequence matching problem is linear. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:59-80 [Journal]
  12. Yuri Matiyasevich
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:1-0 [Journal]
  13. Yuri Matiyasevich
    A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:67, n:1-3, pp:325-348 [Journal]
  14. Yuri Matiyasevich, Anil Nerode
    Preface - Papers in honor of the Symposium on Logical Foundations of Computer Science ``Logic at St. Petersburg''. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:1- [Journal]
  15. Yuri Matiyasevich, Sergei N. Artëmov
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:307- [Journal]
  16. Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich
    Multiple serial episodes matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:6, pp:211-218 [Journal]
  17. Patrick Cégielski, Yuri Matiyasevich, Denis Richard
    Definability and Decidability Issues in Extensions of the Integers with the Divisibility Predicate. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:2, pp:515-540 [Journal]
  18. Danièle Beauquier, Dimitri Grigoriev, Yuri Matiyasevich
    Biography of A.O. Slissenko. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:3-5 [Journal]
  19. Volker Diekert, Yuri Matiyasevich, Anca Muscholl
    Solving Word Equations modulo Partial Commutations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:224, n:1-2, pp:215-235 [Journal]
  20. Yuri Matiyasevich
    Some arithmetical restatements of the Four Color Conjecture. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:257, n:1-2, pp:167-183 [Journal]
  21. Yuri Matiyasevich, Géraud Sénizergues
    Decision problems for semi-Thue systems with a few rules. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:145-169 [Journal]
  22. Yuri Matiyasevich
    Some probabilistic restatements of the Four Color Conjecture. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:3, pp:167-179 [Journal]
  23. Yuri Matiyasevich
    Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets. [Citation Graph (0, 0)][DBLP]
    Mathematics and Computers in Simulation, 2004, v:67, n:1-2, pp:125-133 [Journal]
  24. Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich
    Multiple serial episode matching [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  25. Existential arithmetization of Diophantine equations. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002