Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuri V. Matiyasevich
Person information
- unicode name: Ю́рий Влади́мирович Матиясе́вич
- affiliation: Steklov Institute of Mathematics, St. Petersburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Yuri V. Matiyasevich
:
Towards non-iterative calculation of the zeros of the Riemann zeta function. Inf. Comput. 296: 105130 (2024)- 2022
- [j28]Jonas Bayer, Marco David, Benedikt Stock, Abhik Pal, Yuri V. Matiyasevich, Dierk Schleicher:
Diophantine Equations and the DPRM Theorem. Arch. Formal Proofs 2022 (2022) - [c13]Yuri V. Matiyasevich:
On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function. CAI 2022: 15-25 - [i3]Jonas Bayer, Christoph Benzmüller, Kevin Buzzard, Marco David, Leslie Lamport, Yuri V. Matiyasevich, Lawrence C. Paulson, Dierk Schleicher, Benedikt Stock, Efim I. Zelmanov:
Mathematical Proof Between Generations. CoRR abs/2207.04779 (2022) - 2020
- [j27]Yuri V. Matijasevic:
The Riemann Hypothesis in computer science. Theor. Comput. Sci. 807: 257-265 (2020)
2010 – 2019
- 2018
- [j26]Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich, Mikhail V. Volkov:
Perface. Fundam. Informaticae 162(2-3): i (2018) - [j25]Yuri V. Matiyasevich:
Computational Rediscovery of Ramanujan's Tau Numbers. Integers 18A: A14 (2018) - 2017
- [j24]Vesa Halava, Yuri V. Matiyasevich, Reino Niskanen:
Small Semi-Thue System Universal with Respect to the Termination Problem. Fundam. Informaticae 154(1-4): 177-184 (2017) - 2016
- [j23]Juhani Karhumäki, Vladimir V. Mazalov, Yuri V. Matiyasevich:
Preface. Fundam. Informaticae 145(3): i-ii (2016) - [p1]Yuri V. Matiyasevich:
Martin Davis and Hilbert's Tenth Problem. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 35-54 - 2015
- [j22]Gleb Beliakov, Yuri V. Matiyasevich:
Approximation of Riemann's Zeta Function by Finite Dirichlet Series: A Multiprecision Numerical Approach. Exp. Math. 24(2): 150-161 (2015) - 2014
- [j21]Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich:
Preface. Fundam. Informaticae 132(1) (2014) - 2013
- [i2]Gleb Beliakov, Yuri V. Matiyasevich:
A Parallel Algorithm for Calculation of Large Determinants with High Accuracy for GPUs and MPI clusters. CoRR abs/1308.1536 (2013) - 2012
- [c12]Yuri V. Matiyasevich:
Enlarging the Scope of Applicability of Successful Techniques for Automated Reasoning in Mathematics. IJCAR 2012: 9 - 2010
- [j20]Sergei N. Artëmov, Yuri V. Matiyasevich, Grigori Mints, Anatol Slissenko:
Preface. Ann. Pure Appl. Log. 162(3): 173-174 (2010) - [j19]Yuri V. Matiyasevich:
One More Probabilistic Reformulation of the Four Colour Conjecture. Comb. Probab. Comput. 19(5-6): 829-834 (2010)
2000 – 2009
- 2009
- [j18]Yuri V. Matiyasevich:
Existential arithmetization of Diophantine equations. Ann. Pure Appl. Log. 157(2-3): 225-233 (2009) - [j17]Vesa Halava, Jarkko Kari, Yuri V. Matiyasevich:
On post correspondence problem for letter monotonic languages. Theor. Comput. Sci. 410(30-32): 2957-2960 (2009) - 2008
- [j16]Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich:
Tree inclusion problems. RAIRO Theor. Informatics Appl. 42(1): 5-20 (2008) - [j15]Yuri Vladimirovich Matiyasevich:
Matiyasevich theorem. Scholarpedia 3(7): 7095 (2008) - 2006
- [j14]Yuri V. Matiyasevich, Sergei N. Artëmov:
Preface. Ann. Pure Appl. Log. 141(3): 307 (2006) - [j13]Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich:
Multiple serial episodes matching. Inf. Process. Lett. 98(6): 211-218 (2006) - [c11]Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri V. Matiyasevich:
Window Subsequence Problems for Compressed Texts. CSR 2006: 127-136 - [i1]Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich:
Multiple serial episode matching. CoRR abs/cs/0603050 (2006) - 2005
- [j12]Yuri V. Matiyasevich, Géraud Sénizergues:
Decision problems for semi-Thue systems with a few rules. Theor. Comput. Sci. 330(1): 145-169 (2005) - [c10]Yuri V. Matiyasevich:
Hilbert's Tenth Problem and Paradigms of Computation. CiE 2005: 310-321 - 2004
- [j11]Yuri V. Matiyasevich:
Some probabilistic restatements of the Four Color Conjecture. J. Graph Theory 46(3): 167-179 (2004) - [j10]Yuri V. Matiyasevich:
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets. Math. Comput. Simul. 67(1-2): 125-133 (2004) - 2003
- [j9]Danièle Beauquier, Dimitri Grigoriev, Yuri V. Matiyasevich:
Biography of A.O. Slissenko. Theor. Comput. Sci. 303(1): 3-5 (2003) - 2001
- [j8]Yuri V. Matiyasevich:
Preface. Ann. Pure Appl. Log. 113(1-3): 1- (2001) - [j7]Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich:
Window-accumulated subsequence matching problem is linear. Ann. Pure Appl. Log. 113(1-3): 59-80 (2001) - [j6]Yuri V. Matiyasevich:
Some arithmetical restatements of the Four Color Conjecture. Theor. Comput. Sci. 257(1-2): 167-183 (2001)
1990 – 1999
- 1999
- [j5]Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl:
Solving Word Equations modulo Partial Commutations. Theor. Comput. Sci. 224(1-2): 215-235 (1999) - [c9]Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich:
Window-Accumulated Subsequence Matching Problem is Linear. PODS 1999: 327-336 - 1998
- [c8]Yuri V. Matiyasevich:
Universal Polynomials. MCU (1) 1998: 1-20 - 1997
- [c7]Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl:
Solving Trace Equations Using Lexicographical Normal Forms. ICALP 1997: 336-346 - [c6]Yuri V. Matiyasevich:
Some Decision Problems for Traces. LFCS 1997: 248-257 - 1996
- [j4]Yuri V. Matiyasevich, Anil Nerode:
Preface - Papers in honor of the Symposium on Logical Foundations of Computer Science "Logic at St. Petersburg". Ann. Pure Appl. Log. 78(1-3): 1 (1996) - [j3]Patrick Cégielski, Yuri V. Matiyasevich, Denis Richard:
Definability and Decidability Issues in Extensions of the Integers with the Divisibility Predicate. J. Symb. Log. 61(2): 515-540 (1996) - [c5]Anatoli Degtyarev, Yuri V. Matiyasevich, Andrei Voronkov:
Simultaneous E-Unification and Related Algorithmic Problems. LICS 1996: 494-502 - [c4]Yuri V. Matiyasevich, Géraud Sénizergues:
Decision Problems for Semi-Thue Systems with a Few Rules. LICS 1996: 523-531 - 1995
- [c3]Yuri V. Matiyasevich:
On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract). RTA 1995: 1 - 1994
- [j2]Yuri V. Matiyasevich:
A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations. Ann. Pure Appl. Log. 67(1-3): 325-348 (1994) - [e1]Anil Nerode, Yuri V. Matiyasevich:
Logical Foundations of Computer Science, Third International Symposium, LFCS'94, St. Petersburg, Russia, July 11-14, 1994, Proceedings. Lecture Notes in Computer Science 813, Springer 1994, ISBN 3-540-58140-5 [contents] - 1993
- [c2]Yuri V. Matiyasevich:
Word Problem for Thue Systems with a Few Relations. Term Rewriting 1993: 39-53 - [c1]Yuri V. Matiyasevich:
Interval Computations as Propagation of Constraints. NATO ASI CP 1993: 140-152
1980 – 1989
- 1984
- [j1]James P. Jones, Yuri V. Matijasevic:
Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets. J. Symb. Log. 49(3): 818-829 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-01 23:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
