Yuri V. Matiyasevich
According to our database^{1}, Yuri V. Matiyasevich
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at orcid.org

at isni.org
On csauthors.net:
Bibliography
2017
Small SemiThue System Universal with Respect to the Termination Problem.
Fundam. Inform., 2017
2016
Preface.
Fundam. Inform., 2016
2015
Approximation of Riemann's Zeta Function by Finite Dirichlet Series: A Multiprecision Numerical Approach.
Experimental Mathematics, 2015
2014
Preface.
Fundam. Inform., 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
One More Probabilistic Reformulation of the Four Colour Conjecture.
Combinatorics, Probability & Computing, 2010
Preface.
Ann. Pure Appl. Logic, 2010
2009
On post correspondence problem for letter monotonic languages.
Theor. Comput. Sci., 2009
Existential arithmetization of Diophantine equations.
Ann. Pure Appl. Logic, 2009
2008
Matiyasevich theorem.
Scholarpedia, 2008
Tree inclusion problems.
ITA, 2008
2006
Multiple serial episodes matching.
Inf. Process. Lett., 2006
Multiple serial episode matching
CoRR, 2006
Preface.
Ann. Pure Appl. Logic, 2006
Window Subsequence Problems for Compressed Texts.
Proceedings of the Computer Science, 2006
2005
Decision problems for semiThue systems with a few rules.
Theor. Comput. Sci., 2005
Hilbert's Tenth Problem and Paradigms of Computation.
Proceedings of the New Computational Paradigms, 2005
2004
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets.
Mathematics and Computers in Simulation, 2004
Some probabilistic restatements of the Four Color Conjecture.
Journal of Graph Theory, 2004
2003
Biography of A.O. Slissenko.
Theor. Comput. Sci., 2003
2001
Some arithmetical restatements of the Four Color Conjecture.
Theor. Comput. Sci., 2001
Preface.
Ann. Pure Appl. Logic, 2001
Windowaccumulated subsequence matching problem is linear.
Ann. Pure Appl. Logic, 2001
1999
Solving Word Equations modulo Partial Commutations.
Theor. Comput. Sci., 1999
WindowAccumulated Subsequence Matching Problem is Linear.
Proceedings of the Eighteenth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, May 31, 1999
1998
Universal Polynomials.
Proceedings of the International Colloquium Universal Machines and Computations, 1998
1997
Some Decision Problems for Traces.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997
Solving Trace Equations Using Lexicographical Normal Forms.
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. Logic, 1996
Decision Problems for SemiThue Systems with a Few Rules.
Proceedings of the Proceedings, 1996
Simultaneous EUnification and Related Algorithmic Problems.
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. Logic, 1994
1993
Interval Computations as Propagation of Constraints.
Proceedings of the Constraint Programming, 1993
Word Problem for Thue Systems with a Few Relations.
Proceedings of the Term Rewriting, 1993
1984
Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets.
J. Symb. Log., 1984