Yuri Matiyasevich
Yuri Matiyasevich
Steklov Institute of Mathematics at St.Petersburg
Verified email at pdmi.ras.ru
TitleCited byYear
Hilbert's tenth problem
YV Matiyasevich, JE Fenstad
MIT press, 1993
8201993
Enumerable sets are diophantine
YV Matiyasevich
Doklady Akademii Nauk SSSR 191 (2), 279-282, 1970
7881970
Diophantine representation of recursively enumerable predicates
YV Matijasevič
Studies in Logic and the Foundations of Mathematics 63, 171-177, 1971
114*1971
Decision problems for semi-Thue systems with a few rules
Y Matiyasevich, G Senizergues
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 523-531, 1996
971996
The Diophantineness of enumerable sets
YV Matiyasevich
Doklady Akademii Nauk 191 (2), 279-282, 1970
961970
Simple examples of unsolvable associative calculi
YV Matiyasevich
Doklady Akademii Nauk 173 (6), 1264-1266, 1967
851967
Decision problems for semi-Thue systems with a few rules
Y Matiyasevich, G Sénizergues
Theoretical Computer Science 330 (1), 145-169, 2005
752005
Hilbert’s tenth problem. Foundations of Computing Series
YV Matiyasevich
MIT Press, Cambridge, MA, 1993
451993
Hilbert's tenth problem: What was done and what is to be done
Y Matiyasevich
Contemporary mathematics 270, 1-48, 2000
432000
Simultaneous rigid E-unification and related algorithmic problems
A Degtyarev, Y Matiyasevich, A Voronkov
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 494-502, 1996
421996
Diophantine sets
YV Matiyasevich
Russian Mathematical Surveys 27 (5), 124, 1972
421972
Window-accumulated subsequence matching problem is linear
L Boasson, P Cegielski, I Guessarian, Y Matiyasevich
PODS, 327-336, 1999
391999
Diophantine representation of the set of prime numbers
YV Matiyasevich
Doklady Akademii Nauk 196 (4), 770-773, 1971
361971
Towards finite-fold Diophantine representations
YV Matiyasevich
Записки научных семинаров ПОМИ 377 (0), 78-90, 2010
312010
Window Subsequence Problem for Compressed Texts
P Cegielski, I Guessarian, Y Lifshits, Y Matiyasevich
Lecture notes in computer science 3697, 127-136, 2006
302006
Some decision problems for traces
Y Matiyasevich
International Symposium on Logical Foundations of Computer Science, 248-257, 1997
261997
Solving word equations modulo partial commutations
V Diekert, Y Matiyasevich, A Muscholl
Theoretical Computer Science 224 (1-2), 215-235, 1999
251999
Simultaneous rigid E-unification is not so simple
A Degtyarev, Y Matiyasevich, A Voronkov
UPMAIL Technical Report 104, Uppsala University, Computing Science Department, 1995
221995
A connection between systems of words-and-lengths equations and Hilbert's tenth problem
YV Matiyasevich
Zapiski Nauchnykh Seminarov POMI 8, 132-144, 1968
201968
Multiple serial episodes matching
P C gielski, I Guessarian, Y Matiyasevich
Information Processing Letters 98 (6), 211-218, 2006
19*2006
The system can't perform the operation now. Try again later.
Articles 1–20