Yuri Matiyasevich
Yuri Matiyasevich
Steklov Institute of Mathematics at St.Petersburg
Verified email at pdmi.ras.ru
Title
Cited by
Cited by
Year
Hilbert's tenth problem
IUV Matii︠a︡sevich, JV Matijasevič, █V MatiÔsevič, YV Matiyasevich, ...
MIT press, 1993
8411993
Enumerable sets are diophantine
YV Matiyasevich
Doklady Akademii Nauk SSSR 191 (2), 279-282, 1970
8061970
The Diophantineness of enumerable sets
YV Matiyasevich
Doklady Akademii Nauk 191 (2), 279-282, 1970
2231970
Diophantine representation of recursively enumerable predicates
YV Matijasevič
Studies in Logic and the Foundations of Mathematics 63, 171-177, 1971
119*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
1011996
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
772005
Multiple serial episodes matching
P C gielski, I Guessarian, Y Matiyasevich
Information Processing Letters 98 (6), 211-218, 2006
59*2006
Hilbert’s tenth problem. Foundations of Computing Series
YV Matiyasevich
MIT Press, Cambridge, MA, 1993
471993
Hilbert's tenth problem: what was done and what is to be done
Y Matiyasevich
Contemporary mathematics 270, 1-48, 2000
422000
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
Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium oná…, 1999
391999
Diophantine representation of the set of prime numbers
YV Matiyasevich
Doklady Akademii Nauk 196 (4), 770-773, 1971
371971
Towards finite-fold Diophantine representations
YV Matiyasevich
Записки научных семинаров ПОМИ 377 (0), 78-90, 2010
302010
Window Subsequence Problem for Compressed Texts
P Cegielski, I Guessarian, Y Lifshits, Y Matiyasevich
Lecture notes in computer science 3697, 127-136, 2006
292006
Some decision problems for traces
Y Matiyasevich
International Symposium on Logical Foundations of Computer Science, 248-257, 1997
271997
Solving word equations modulo partial commutations
V Diekert, Y Matiyasevich, A Muscholl
Theoretical Computer Science 224 (1-2), 215-235, 1999
241999
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 new formula for π
YV Matiyasevich, RK Guy
The American mathematical monthly 93 (8), 631-635, 1986
211986
The system can't perform the operation now. Try again later.
Articles 1–20