Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets. - James P. Jones; Yuri V. Matijasevic (J. Symb. Log., 1984)

Word Problem for Thue Systems with a Few Relations. - Yuri V. Matiyasevich (Term Rewriting, 1993)

Interval Computations as Propagation of Constraints. - Yuri V. Matiyasevich (NATO ASI CP, 1993)

A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations. - Yuri V. Matiyasevich (Ann. Pure Appl. Log., 1994)

On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract). - Yuri V. Matiyasevich (RTA, 1995)

Simultaneous E-Unification and Related Algorithmic Problems. - Anatoli Degtyarev; Yuri V. Matiyasevich; Andrei Voronkov (LICS, 1996)

Preface - Papers in honor of the Symposium on Logical Foundations of Computer Science "Logic at St. Petersburg". - Yuri V. Matiyasevich; Anil Nerode (Ann. Pure Appl. Log., 1996)

Definability and Decidability Issues in Extensions of the Integers with the Divisibility Predicate. - Patrick Cégielski; Yuri V. Matiyasevich; Denis Richard (J. Symb. Log., 1996)

Solving Trace Equations Using Lexicographical Normal Forms. - Volker Diekert; Yuri V. Matiyasevich; Anca Muscholl (ICALP, 1997)

Some Decision Problems for Traces. - Yuri V. Matiyasevich (LFCS, 1997)

Universal Polynomials. - Yuri V. Matiyasevich (MCU (1), 1998)

Solving Word Equations modulo Partial Commutations. - Volker Diekert; Yuri V. Matiyasevich; Anca Muscholl (Theor. Comput. Sci., 1999)

Window-accumulated subsequence matching problem is linear. - Luc Boasson; Patrick Cégielski; Irène Guessarian; Yuri V. Matiyasevich (Ann. Pure Appl. Log., 2001)

Preface. - Yuri V. Matiyasevich (Ann. Pure Appl. Log., 2001)

Some arithmetical restatements of the Four Color Conjecture. - Yuri V. Matiyasevich (Theor. Comput. Sci., 2001)

Biography of A.O. Slissenko. - Danièle Beauquier; Dimitri Grigoriev; Yuri V. Matiyasevich (Theor. Comput. Sci., 2003)

Some probabilistic restatements of the Four Color Conjecture. - Yuri V. Matiyasevich (J. Graph Theory, 2004)

Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets. - Yuri V. Matiyasevich (Math. Comput. Simul., 2004)

Hilbert's Tenth Problem and Paradigms of Computation. - Yuri V. Matiyasevich (CiE, 2005)

Decision problems for semi-Thue systems with a few rules. - Yuri V. Matiyasevich; Géraud Sénizergues (Theor. Comput. Sci., 2005)

Window Subsequence Problems for Compressed Texts. - Patrick Cégielski; Irène Guessarian; Yury Lifshits; Yuri V. Matiyasevich (CSR, 2006)

Preface. - Yuri V. Matiyasevich; Sergei N. Artëmov (Ann. Pure Appl. Log., 2006)

Multiple serial episode matching - Patrick Cégielski; Irène Guessarian; Yuri V. Matiyasevich (CoRR, 2006)

Multiple serial episodes matching. - Patrick Cégielski; Irène Guessarian; Yuri V. Matiyasevich (Inf. Process. Lett., 2006)

Tree inclusion problems. - Patrick Cégielski; Irène Guessarian; Yuri V. Matiyasevich (RAIRO Theor. Informatics Appl., 2008)

Matiyasevich theorem. - Yuri Vladimirovich Matiyasevich (Scholarpedia, 2008)

Existential arithmetization of Diophantine equations. - Yuri V. Matiyasevich (Ann. Pure Appl. Log., 2009)

On post correspondence problem for letter monotonic languages. - Vesa Halava; Jarkko Kari; Yuri V. Matiyasevich (Theor. Comput. Sci., 2009)

Preface. - Sergei N. Artëmov; Yuri V. Matiyasevich; Grigori Mints; Anatol Slissenko (Ann. Pure Appl. Log., 2010)

One More Probabilistic Reformulation of the Four Colour Conjecture. - Yuri V. Matiyasevich (Comb. Probab. Comput., 2010)

Enlarging the Scope of Applicability of Successful Techniques for Automated Reasoning in Mathematics. - Yuri V. Matiyasevich (IJCAR, 2012)

A Parallel Algorithm for Calculation of Large Determinants with High Accuracy for GPUs and MPI clusters. - Gleb Beliakov; Yuri V. Matiyasevich (CoRR, 2013)

Preface. - Vesa Halava; Juhani Karhumäki; Yuri V. Matiyasevich (Fundam. Informaticae, 2014)

Approximation of Riemann's Zeta Function by Finite Dirichlet Series: A Multiprecision Numerical Approach. - Gleb Beliakov; Yuri V. Matiyasevich (Exp. Math., 2015)

Martin Davis and Hilbert's Tenth Problem. - Yuri V. Matiyasevich (Martin Davis on Computability, Computational Logic, and Mathematical Foundations, 2016)

Preface. - Juhani Karhumäki; Vladimir V. Mazalov; Yuri V. Matiyasevich (Fundam. Informaticae, 2016)

Small Semi-Thue System Universal with Respect to the Termination Problem. - Vesa Halava; Yuri V. Matiyasevich; Reino Niskanen (Fundam. Informaticae, 2017)

Perface. - Vesa Halava; Juhani Karhumäki; Yuri V. Matiyasevich; Mikhail V. Volkov 001 (Fundam. Informaticae, 2018)

Computational Rediscovery of Ramanujan's Tau Numbers. - Yuri V. Matiyasevich (Integers, 2018)

The Riemann Hypothesis in computer science. - Yuri V. Matijasevic (Theor. Comput. Sci., 2020)

On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function. - Yuri V. Matiyasevich (CAI, 2022)

Diophantine Equations and the DPRM Theorem. - Jonas Bayer; Marco David; Benedikt Stock; Abhik Pal; Yuri V. Matiyasevich; Dierk Schleicher (Arch. Formal Proofs, 2022)

Mathematical Proof Between Generations. - Jonas Bayer; Christoph Benzmüller; Kevin Buzzard; Marco David; Leslie Lamport; Yuri V. Matiyasevich; Lawrence C. Paulson; Dierk Schleicher; Benedikt Stock; Efim I. Zelmanov (CoRR, 2022)

Towards non-iterative calculation of the zeros of the Riemann zeta function. - Yuri V. Matiyasevich (Inf. Comput., 2024)

Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy. - Liesbeth De Mol; Yuri V. Matiyasevich; Eugenio G. Omodeo; Alberto Policriti; Wilfried Sieg; Elaine J. Weyuker (CoRR, 2025)

Diophantine Equations over ℤ: Universal Bounds and Parallel Formalization. - Jonas Bayer; Marco David; Malte Hassler; Yuri V. Matiyasevich; Dierk Schleicher (CoRR, 2025)