Yuri V. Matiyasevich

According to our database, Yuri V. Matiyasevich authored at least 44 papers between 1984 and 2024.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2024

Towards non-iterative calculation of the zeros of the Riemann zeta function.

Yuri V. Matiyasevich

Inf. Comput., January, 2024

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

Diophantine Equations and the DPRM Theorem.

Jonas Bayer, Marco David, Benedikt Stock, Abhik Pal, Yuri V. Matiyasevich, Dierk Schleicher

Arch. Formal Proofs, 2022

On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function.

Yuri V. Matiyasevich

Proceedings of the Algebraic Informatics - 9th International Conference, 2022

2020

The Riemann Hypothesis in computer science.

Yuri V. Matijasevic

Theor. Comput. Sci., 2020

2018

Computational Rediscovery of Ramanujan's Tau Numbers.

Yuri V. Matiyasevich

Integers, 2018

Perface.

Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich, Mikhail V. Volkov

Fundam. Informaticae, 2018

2017

Small Semi-Thue System Universal with Respect to the Termination Problem.

Vesa Halava, Yuri V. Matiyasevich, Reino Niskanen

Fundam. Informaticae, 2017

2016

Preface.

Juhani Karhumäki, Vladimir V. Mazalov, Yuri V. Matiyasevich

Fundam. Informaticae, 2016

Martin Davis and Hilbert's Tenth Problem.

Yuri V. Matiyasevich

Proceedings of the Martin Davis on Computability, 2016

2015

Approximation of Riemann's Zeta Function by Finite Dirichlet Series: A Multiprecision Numerical Approach.

Gleb Beliakov, Yuri V. Matiyasevich

Exp. Math., 2015

2014

Preface.

Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich

Fundam. Informaticae, 2014

2013

A Parallel Algorithm for Calculation of Large Determinants with High Accuracy for GPUs and MPI clusters.

Gleb Beliakov, Yuri V. Matiyasevich

CoRR, 2013

2012

Enlarging the Scope of Applicability of Successful Techniques for Automated Reasoning in Mathematics.

Yuri V. Matiyasevich

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2010

One More Probabilistic Reformulation of the Four Colour Conjecture.

Yuri V. Matiyasevich

Comb. Probab. Comput., 2010

Preface.

Sergei N. Artëmov, Yuri V. Matiyasevich, Grigori Mints, Anatol Slissenko

Ann. Pure Appl. Log., 2010

2009

On post correspondence problem for letter monotonic languages.

Vesa Halava, Jarkko Kari, Yuri V. Matiyasevich

Theor. Comput. Sci., 2009

Existential arithmetization of Diophantine equations.

Yuri V. Matiyasevich

Ann. Pure Appl. Log., 2009

2008

Matiyasevich theorem.

Yuri Vladimirovich Matiyasevich

Scholarpedia, 2008

Tree inclusion problems.

Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich

RAIRO Theor. Informatics Appl., 2008

2006

Multiple serial episodes matching.

Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich

Inf. Process. Lett., 2006

Multiple serial episode matching

Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich

CoRR, 2006

Preface.

Yuri V. Matiyasevich, Sergei N. Artëmov

Ann. Pure Appl. Log., 2006

Window Subsequence Problems for Compressed Texts.

Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri V. Matiyasevich

Proceedings of the Computer Science, 2006

2005

Decision problems for semi-Thue systems with a few rules.

Yuri V. Matiyasevich, Géraud Sénizergues

Theor. Comput. Sci., 2005

Hilbert's Tenth Problem and Paradigms of Computation.

Yuri V. Matiyasevich

Proceedings of the New Computational Paradigms, 2005

2004

Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets.

Yuri V. Matiyasevich

Math. Comput. Simul., 2004

Some probabilistic restatements of the Four Color Conjecture.

Yuri V. Matiyasevich

J. Graph Theory, 2004

2003

Biography of A.O. Slissenko.

Danièle Beauquier, Dimitri Grigoriev, Yuri V. Matiyasevich

Theor. Comput. Sci., 2003

2001

Some arithmetical restatements of the Four Color Conjecture.

Yuri V. Matiyasevich

Theor. Comput. Sci., 2001

Preface.

Yuri V. Matiyasevich

Ann. Pure Appl. Log., 2001

Window-accumulated subsequence matching problem is linear.

Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich

Ann. Pure Appl. Log., 2001

1999

Solving Word Equations modulo Partial Commutations.

Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl

Theor. Comput. Sci., 1999

1998

Universal Polynomials.

Yuri V. Matiyasevich

Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997

Some Decision Problems for Traces.

Yuri V. Matiyasevich

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Solving Trace Equations Using Lexicographical Normal Forms.

Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

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

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

Simultaneous E-Unification and Related Algorithmic Problems.

Anatoli Degtyarev, Yuri V. Matiyasevich, Andrei Voronkov

Proceedings of the Proceedings, 1996

1995

On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract).

Yuri V. Matiyasevich

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

1994

A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations.

Yuri V. Matiyasevich

Ann. Pure Appl. Log., 1994

1993

Interval Computations as Propagation of Constraints.

Yuri V. Matiyasevich

Proceedings of the Constraint Programming, 1993

Word Problem for Thue Systems with a Few Relations.

Yuri V. Matiyasevich

Proceedings of the Term Rewriting, 1993

1984

Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets.

James P. Jones, Yuri V. Matijasevic

J. Symb. Log., 1984