Yuri Matiyasevich
#1,585
Most Influential Person Now
Soviet and Russian mathematician
Yuri Matiyasevich's AcademicInfluence.com Rankings
Yuri Matiyasevichmathematics Degrees
Mathematics
#140
World Rank
#338
Historical Rank
Number Theory
#22
World Rank
#39
Historical Rank
Measure Theory
#2226
World Rank
#2675
Historical Rank
Download Badge
Mathematics
Why Is Yuri Matiyasevich Influential?
(Suggest an Edit or Addition)According to Wikipedia, Yuri Vladimirovich Matiyasevich, is a Russian mathematician and computer scientist. He is best known for his negative solution of Hilbert's tenth problem , which was presented in his doctoral thesis at LOMI .
Yuri Matiyasevich's Published Works
Published Works
- Hilbert's tenth problem (1993) (334)
- Decision problems for semi-Thue systems with a few rules (1996) (143)
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets (1984) (60)
- Hilbert's 10th Problem (1993) (58)
- Simultaneous rigid E-unification and related algorithmic problems (1996) (31)
- Diophantine representation of enumerable predicates (1972) (28)
- Some Decision Problems for Traces (1997) (26)
- Window Subsequence Problems for Compressed Texts (2006) (25)
- Window-accumulated subsequence matching problem is linear (1999) (25)
- Some Algebraic Methods for Calculating the Number of Colorings of a Graph (2004) (21)
- Solving Word Equations modulo Partial Commutations (1999) (18)
- Approximation of Riemann’s Zeta Function by Finite Dirichlet Series: A Multiprecision Numerical Approach (2014) (17)
- A new formula for (1986) (16)
- A binomial representation of the 3x + 1 problem (1999) (15)
- Computation Paradigms in Light of Hilbert's Tenth Problem (2008) (15)
- A new proof of the theorem on exponential diophantine representation of enumerable sets (1980) (14)
- Word Problem for Thue Systems with a Few Relations (1993) (14)
- Some probabilistic restatements of the Four Color Conjecture (2004) (14)
- Real-time recognition of the inclusion relation (1972) (14)
- Hilbert's Tenth Problem and Paradigms of Computation (2005) (12)
- Solving Trace Equations Using Lexicographical Normal Forms (1997) (12)
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (2016) (11)
- A Parallel Algorithm for Calculation of Large Determinants with High Accuracy for GPUs and MPI clusters (2013) (11)
- Horizontal monotonicity of the modulus of the zeta function, $L$-functions, and related functions (2012) (11)
- Simultaneous Rigid E-Unification is not so Simple (1995) (11)
- Hidden Life of Riemann's Zeta Function 2. Electrons and Trains (2007) (10)
- Definability and decidability issues in extensions of the integers with the divisibility predicate (1996) (10)
- Arithmetical representations of enumerable sets with a small number of quantifiers (1976) (10)
- Yet another machine experiment in support of Riemann's conjecture (1982) (10)
- Riemann’s zeta function and finite Dirichlet series (2016) (9)
- The Connection between Hilbert’s Tenth Problem and Systems of Equations between Words and Lengths (1970) (9)
- Some arithmetical restatements of the Four Color Conjecture (2001) (9)
- Martin Davis and Hilbert's Tenth Problem (2016) (9)
- Multiple serial episodes matching (2006) (9)
- What can and cannot be done with Diophantine problems (2011) (8)
- Hilbert’s Tenth Problem: Diophantine Equations in the Twentieth Century (2006) (8)
- A Criterion for Vertex Colorability of a Graph Stated in Terms of Edge Orientations (2007) (8)
- Horizontal Monotonicity of the Modulus of the Riemann Zeta Function and Related Functions (2012) (8)
- A relationship between certain sums over trivial and nontrivial zeros of the Riemann zeta-function (1989) (8)
- A class of primality criteria formulated in terms of the divisibility of binomial coefficients (1981) (8)
- Zeroes of Riemann's zeta function on the critical line with 20000 decimal digits accuracy (2011) (7)
- Hidden Life of Riemann's Zeta Function 1. Arrow, Bow, and Targets (2007) (7)
- The Four Colour Theorem as a possible corollary of binomial summation (1998) (5)
- A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations (1994) (5)
- Matiyasevich theorem (2008) (5)
- Window Accumulated Subsequence Matching is linear (1999) (5)
- Computational Aspects of Hamburger’s Theorem (2019) (4)
- Alternatives to the Euler-Maclaurin formula for calculating infinite sums (2010) (4)
- New Conjectures about Zeroes of Riemann's Zeta Function (2012) (4)
- Two Reductions of Hilbert’s Tenth Problem (1970) (4)
- Metamathematical approach to proving theorems of discrete mathematics (1978) (3)
- Sergei Yur'evich Maslov (obituary) (1984) (3)
- A Few Factors from the Euler Product Are Sufficient for Calculating the Zeta Function with High Precision (2017) (3)
- Existential arithmetization of Diophantine equations (2009) (3)
- Yet another representation for reciprocals of the nontrivial zeros of the riemann zeta function (2015) (3)
- Nikolai Aleksandrovich Shanin (on his seventieth birthday) (1990) (3)
- A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers (1997) (3)
- Tree inclusion problems (2008) (2)
- On post correspondence problem for letter monotonic languages (2009) (2)
- One Probabilistic Equivalent of the Four Color Conjecture (2004) (2)
- What Divisibility Properties Do Generalized Harmonic Numbers Have (1992) (2)
- Plausible ways for calculating the Riemann zeta function via the Riemann–Siegel theta function (2020) (2)
- On a certain representation of the chromatic polynomial (2009) (2)
- Perface (2018) (2)
- Arithmetic Representations of Powers (1970) (2)
- Two universal 3-quantifier representations of recursively enumerable sets (2008) (2)
- Small Semi-Thue System Universal with Respect to the Termination Problem (2017) (2)
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (2004) (2)
- A sufficient condition for the convergence of monotone sequences (1972) (2)
- Computational Rediscovery of Ramanujan's Tau Numbers (2018) (2)
- Riemann’s hypothesis in terms of the eigenvalues of special Hankel matrices (2017) (1)
- Diophantine complexity (1991) (1)
- The Riemann Hypothesis in computer science (2020) (1)
- Congruences for Apéry numbers $\beta_{n}=\sum_{k=0}^{n}\binom{n}{k}^2\binom{n+k}{k}$ (2018) (1)
- Vladimir Andreevich Uspensky (27/11/1930–27/6/2018) (2019) (1)
- Riemann’s hypothesis in terms of the eigenvalues of special Hankel matrices (2017) (1)
- The application of the methods of the theory of logical derivation to graph theory (1972) (1)
- A binomial representation of the 3 x + 1 problem (1998) (1)
- Yet another representation for the sum of reciprocals of the nontrivial zeros of the Riemann zeta-function (2014) (1)
- Mathematical Proof Between Generations (2022) (1)
- Four color theorem from three points of view (2016) (1)
- Zeros of Dirichlet L-functions on the critical line with the accuracy of 40000 decimal places (2014) (1)
- Diophantine Equations and the DPRM Theorem (2022) (1)
- How to Color a Graph with (Computer) Algebra (2002) (1)
- Multiple serial episode matching (2006) (1)
- Yet another representation for reciprocals of the nontrivial zeros of the riemann zeta function (2015) (0)
- Interval Computations as Propagation of Constraints (1993) (0)
- Asymptotic Structure of Eigenvalues and Eigenvectors of Certain Triangular Hankel Matrices (2022) (0)
- Universal Polynomials (1998) (0)
- Continuous crop circles drawn by Riemann's zeta function (2021) (0)
- The Riemann Hypothesis As the Parity of Special Binomial Coefficients (2022) (0)
- Preface - Papers in honor of the Symposium on Logical Foundations of Computer Science "Logic at St. Petersburg" (1996) (0)
- On some Works of Avi Wigderson (1995) (0)
- A proof-scheme in discrete mathematics (1977) (0)
- Anatolii Vladimirovich Yakovlev (on the occasion of his 70th birthday) (2010) (0)
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (2015) (0)
- New Methods in Hilbert’s Tenth Problem (2009) (0)
- On the balance of d-bonacci word (2012) (0)
- DETERMINATION OF THE SOLVABILITY OF A DIOPHANTINE EQUATION Given a Diophantine (2014) (0)
- One More Probabilistic Reformulation of the Four Colour Conjecture (2010) (0)
- Biography of A.O. Slissenko (2003) (0)
- Calculation of Belyi Functions for Trees with Weighted Edges (2017) (0)
- Preface (2010) (0)
- Congruences for Apéry numbers βn =∑k=0nn k2n+k k (2020) (0)
- Continuous Crop Circles (2021) (0)
- Vasilii Mikhailovich Babich (2021) (0)
- Preface (2016) (0)
- Preface (2006) (0)
- Proceedings of the Conference “Embedded Graphs” (2017) (0)
- Logical Foundations of Computer Science (2013) (0)
- A Few Factors from the Euler Product Are Sufficient for Calculating the Zeta Function with High Precision (2017) (0)
- Preface (2014) (0)
- Calculation of Belyi Functions for Trees with Weighted Edges (2017) (0)
- Proceedings of the Fourth Russian Finnish Symposium on DiscreteMathematics : Organized in Turku on 16.-19.5.2017 (2017) (0)
- International mathematical congress devoted to the 300th anniversary of Leonhard Euler's birth (2007) (0)
- Viktor Abramovich Zalgaller (2021) (0)
- Preface (2001) (0)
- Nikolai Aleksandrovich Shanin (obituary) (2013) (0)
- On Diophantine equations over $\mathbb Z[i]$ with $52$ unknowns (2020) (0)
- On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract) (1995) (0)
- Enlarging the Scope of Applicability of Successful Techniques for Automated Reasoning in Mathematics (2012) (0)
- 3 Davis ’ s Conjecture : First Step to the Proof via Arithmetization (2005) (0)
- On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function (2022) (0)
- Yurii Leonidovich Ershov (on his 80th birthday) (2020) (0)
This paper list is powered by the following services:
Other Resources About Yuri Matiyasevich
What Schools Are Affiliated With Yuri Matiyasevich?
Yuri Matiyasevich is affiliated with the following schools: