Yuri V. Matiyasevich
Orcid: 0000000170463746Affiliations:
 Steklov Institute of Mathematics, St. Petersburg, Russia
According to our database^{1},
Yuri V. Matiyasevich
authored at least 44 papers
between 1984 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org

on id.loc.gov

on dnb.info

on isni.org
On csauthors.net:
Bibliography
2024
Inf. Comput., January, 2024
2022
CoRR, 2022
Arch. Formal Proofs, 2022
Proceedings of the Algebraic Informatics  9th International Conference, 2022
2020
Theor. Comput. Sci., 2020
2018
Integers, 2018
Fundam. Informaticae, 2018
2017
Fundam. Informaticae, 2017
2016
Fundam. Informaticae, 2016
Proceedings of the Martin Davis on Computability, 2016
2015
Approximation of Riemann's Zeta Function by Finite Dirichlet Series: A Multiprecision Numerical Approach.
Exp. Math., 2015
2014
Fundam. Informaticae, 2014
2013
A Parallel Algorithm for Calculation of Large Determinants with High Accuracy for GPUs and MPI clusters.
CoRR, 2013
2012
Enlarging the Scope of Applicability of Successful Techniques for Automated Reasoning in Mathematics.
Proceedings of the Automated Reasoning  6th International Joint Conference, 2012
2010
Comb. Probab. Comput., 2010
Ann. Pure Appl. Log., 2010
2009
Theor. Comput. Sci., 2009
Ann. Pure Appl. Log., 2009
2008
Scholarpedia, 2008
RAIRO Theor. Informatics Appl., 2008
2006
Inf. Process. Lett., 2006
CoRR, 2006
Ann. Pure Appl. Log., 2006
Proceedings of the Computer Science, 2006
2005
Theor. Comput. Sci., 2005
Proceedings of the New Computational Paradigms, 2005
2004
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets.
Math. Comput. Simul., 2004
J. Graph Theory, 2004
2003
Theor. Comput. Sci., 2003
2001
Theor. Comput. Sci., 2001
Ann. Pure Appl. Log., 2001
Ann. Pure Appl. Log., 2001
1999
Theor. Comput. Sci., 1999
1998
Universal Polynomials.
Proceedings of the International Colloquium Universal Machines and Computations, 1998
1997
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997
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.
J. Symb. Log., 1996
Preface  Papers in honor of the Symposium on Logical Foundations of Computer Science "Logic at St. Petersburg".
Ann. Pure Appl. Log., 1996
Proceedings of the Proceedings, 1996
1995
On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract).
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995
1994
A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations.
Ann. Pure Appl. Log., 1994
1993
Proceedings of the Constraint Programming, 1993
Proceedings of the Term Rewriting, 1993
1984
Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets.
J. Symb. Log., 1984