|
|
Publications in Math-Net.Ru
-
An almost exact linear algorithm for transformation of chain-cycle graphs with optimization of the sum of operation costs
Dokl. RAN. Math. Inf. Proc. Upr., 494 (2020), 26–29
-
A linear algorithm for restructuring a graph
Avtomat. i Telemekh., 2018, no. 12, 124–141
-
Algorithm of transformation of a graph into another one with minimal cost
Inform. Primen., 11:1 (2017), 79–89
-
Linear algorithm for minimal rearrangement of structures
Probl. Peredachi Inf., 53:1 (2017), 60–78
-
Algorithmic aspects of decomposition and equivalence of finite-valued transducers
Probl. Peredachi Inf., 51:3 (2015), 70–92
-
Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube
Probl. Peredachi Inf., 48:2 (2012), 113–120
-
The tree nearest on average to a given set of trees
Probl. Peredachi Inf., 47:3 (2011), 64–79
-
Estimation of the Number of Elements in a Covering of an Arbitrary
Randomness Test by Frequency Tests
Probl. Peredachi Inf., 43:1 (2007), 56–66
-
A Generalization of the Hilbert Basis Theorem
Mat. Zametki, 74:4 (2003), 508–516
-
Context-free deducibility of graphs that do not realize a planar
lattice
Dokl. Akad. Nauk SSSR, 316:2 (1991), 270–274
-
There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages
Mat. Zametki, 50:1 (1991), 34–40
© , 2024