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