Hilbert's tenth problem IUV Matii︠a︡sevich MIT press, 1993 | 993 | 1993 |

Enumerable sets are diophantine YV Matiyasevich Doklady Akademii Nauk SSSR 191 (2), 279-282, 1970 | 974* | 1970 |

The Diophantineness of enumerable sets YV Matiyasevich Doklady Akademii Nauk 191 (2), 279-282, 1970 | 309 | 1970 |

Decision problems for semi-Thue systems with a few rules Y Matiyasevich, G Sénizergues Theoretical Computer Science 330 (1), 145-169, 2005 | 184 | 2005 |

Diophantine representation of enumerable predicates JV Matijasevič Mathematics of the USSR-Izvestiya 5 (1), 1, 1971 | 155* | 1971 |

Simple examples of unsolvable associative calculi YV Matiyasevich Doklady Akademii Nauk 173 (6), 1264-1266, 1967 | 102 | 1967 |

Hilbert’s tenth problem. Foundations of Computing Series YV Matiyasevich MIT Press, Cambridge, MA, 1993 | 69 | 1993 |

Multiple serial episodes matching P C gielski, I Guessarian, Y Matiyasevich Information Processing Letters 98 (6), 211-218, 2006 | 62* | 2006 |

Hilbert's tenth problem: what was done and what is to be done Y Matiyasevich Contemporary mathematics 270, 1-48, 2000 | 61 | 2000 |

Diophantine sets YV Matiyasevich Russian Mathematical Surveys 27 (5), 124, 1972 | 49 | 1972 |

Press YV Matiyasevich, MIT Hilbert’s Tenth Problem Cambridge, MA, 1993 | 48 | 1993 |

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 | 47 | 1996 |

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 | 45 | 1999 |

Diophantine representation of the set of prime numbers YV Matiyasevich Doklady Akademii Nauk 196 (4), 770-773, 1971 | 44 | 1971 |

Towards finite-fold Diophantine representations YV Matiyasevich Записки научных семинаров ПОМИ 377 (0), 78-90, 2010 | 41 | 2010 |

A new formula for π YV Matiyasevich, RK Guy The American mathematical monthly 93 (8), 631-635, 1986 | 35 | 1986 |

Window Subsequence Problem for Compressed Texts P Cegielski, I Guessarian, Y Lifshits, Y Matiyasevich Lecture notes in computer science 3697, 127-136, 2006 | 34 | 2006 |

Some decision problems for traces Y Matiyasevich International Symposium on Logical Foundations of Computer Science, 248-257, 1997 | 32 | 1997 |

A connection between systems of words-and-lengths equations and Hilbert's tenth problem YV Matiyasevich Zapiski Nauchnykh Seminarov POMI 8, 132-144, 1968 | 30 | 1968 |

Approximation of Riemann’s zeta function by finite Dirichlet series: a multiprecision numerical approach G Beliakov, Y Matiyasevich Experimental Mathematics 24 (2), 150-161, 2015 | 26 | 2015 |