| Publication | Date of Publication | Type |
|---|
Refinement of the results of recognition of mathematical formulas using the Levenshtein distance
Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki | 2021-04-28 | Paper |
Logical analysis of emotions in text from natural language
Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki | 2020-06-22 | Paper |
Nikolai Nikolaevich Nepeivoda. To anniversary
Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki | 2020-06-22 | Paper |
Interactive realizations of logical formulas
Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki | 2017-06-06 | Paper |
Mathematical modeling of formula images for their recognition
Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki | 2014-12-01 | Paper |
Regular expressions in the mathematical text recognition problem
Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki | 2014-12-01 | Paper |
| Manifest of applied constructivism | 2011-03-09 | Paper |
A weak constructive second-order arithmetic with extraction of algorithms computable in polynomial time
Journal of Mathematical Sciences (New York) | 2008-08-18 | Paper |
A nonasymptotic lower time bound for a strictly bounded second-order arithmetic
Annals of Pure and Applied Logic | 2006-08-16 | Paper |
Combined hierarchies of finite random access machines
Journal of Mathematical Sciences (New York) | 2005-08-05 | Paper |
A strong induction scheme that leads to polynomially computable realizations
Theoretical Computer Science | 2004-10-27 | Paper |
The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete
Annals of Pure and Applied Logic | 2002-05-20 | Paper |
Intuitionistic formal theories with realizability in subrecursive classes
Annals of Pure and Applied Logic | 1998-09-14 | Paper |
| scientific article; zbMATH DE number 939514 (Why is no real title available?) | 1996-10-30 | Paper |
A theory for deductive synthesis of algorithms in the computing milieu
Programming and Computer Software | 1995-11-02 | Paper |
| scientific article; zbMATH DE number 618019 (Why is no real title available?) | 1994-08-09 | Paper |
Complexity lower bounds for machine computing models
Journal of Soviet Mathematics | 1985-01-01 | Paper |
A machine description and the hierarchy of initial Grzegorczyk classes
Journal of Soviet Mathematics | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3778749 (Why is no real title available?) | 1982-01-01 | Paper |
A maximal sequence of classes transformable by primitive recursion in a given class
Journal of Soviet Mathematics | 1981-01-01 | Paper |
Hierarchy of complexity of computation of partial functions with values 0 and 1
Mathematical Notes | 1981-01-01 | Paper |
Decidability of the universal theory of natural numbers with addition and divisibility
Journal of Soviet Mathematics | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3685459 (Why is no real title available?) | 1980-01-01 | Paper |
An iterative description of the class \(\mathcal E^1\) of Grzegorczyk's hierarchy
Journal of Soviet Mathematics | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3668574 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3841837 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3557764 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3537666 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3534478 (Why is no real title available?) | 1976-01-01 | Paper |
