| Deterministic Verification of Integer Matrix Multiplication in Quadratic Time. | 5 | 0.44 | 2014 |
| A list of arithmetical structures complete with respect to the first-order definability | 4 | 0.70 | 2001 |
| Real-time generation of primes by a one-dimensional cellular automaton with 9-states | 4 | 0.49 | 1998 |
| Theories of generalized Pascal triangles | 1 | 2.57 | 1997 |
| Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States | 5 | 0.52 | 1997 |
| Small universal register machines | 68 | 7.10 | 1996 |
| Irrational speeds of configurations growth in generalized Pascal triangles | 2 | 1.02 | 1993 |
| Definability of Arithmetic Operations from the Order and a Random Relation | 0 | 0.34 | 1993 |
| Semilinear Real-Time Systolic Trellis Automata | 0 | 0.34 | 1989 |
| Improvement Of Mycielski Inequality For Nonnatural Disjoint Covering Systems Of Z | 2 | 0.45 | 1987 |
| Two kinds of processors are sufficient and large operating alphabets are needed for regular trellis automata languages | 1 | 0.44 | 1984 |
| Codings of Nonnegative Integers | 0 | 0.34 | 1981 |
| Small Universal Minsky Machines | 0 | 0.34 | 1979 |
| Real-Time Computability of integer part of (abs(alpha) x) and integer part of xalpha | 0 | 0.34 | 1977 |
| Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at Most Seven (Eight) Instructions | 2 | 1.89 | 1977 |
| Non-Linear Speed-Up Theorem for Two Register Minsky Machines | 0 | 0.34 | 1975 |
| Model-interpretability into trees and applications | 2 | 0.89 | 1975 |
| Computational Complexity Based on Expectation of the Time of Computation on Minsky Machines | 2 | 2.65 | 1973 |
