|
Author Index, 2003, Volume 15
P. V. Roldugin
Construction of maximally non-Hamiltonian graphs
Diskr. Mat., 2003, Volume 15:2, 89–102
|
M. A. Alekhina
Synthesis and complexity of reliable schemes in the basis $\{\&,\vee,\bar{}\,\}$ with single-type constant faults at the inputs of elements
Diskr. Mat., 2003, Volume 15:1, 98–109
|
G. I. Arkhipov, V. F. Kolchin, Yu. I. Medvedev, S. M. Nikol'skii, M. P. Mineev, L. P. Postnikova, Yu. V. Prokhorov, V. N. Chubarikov
Konstantin Konstantinovich Mardzhanishvili (on the centenary of his birth)
Diskr. Mat., 2003, Volume 15:4, 3–6
|
A. V. Babash
On the properties of a special composition of automata
Diskr. Mat., 2003, Volume 15:3, 66–75
|
D. N. Babin
Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part
Diskr. Mat., 2003, Volume 15:1, 110–130
|
S. V. Balakin, see L. Ya. Savel'ev
Diskr. Mat., 2003, Volume 15:1, 50–76
|
E. S. Bychenkova
An order-optimal method for the synthesis of a search operator in a class of automaton circuits of a special form
Diskr. Mat., 2003, Volume 15:1, 131–156
|
O. V. Cheremisin
On the activity of cell circuits realising the system of all
conjunctions
Diskr. Mat., 2003, Volume 15:2, 113–122
|
E. V. Cherepanova
Limit distributions of the number of cycles of given length in a random permutation with a known number of cycles
Diskr. Mat., 2003, Volume 15:3, 128–144
|
M. A. Cherepnev
Public key distribution schemes based on a noncommutative group
Diskr. Mat., 2003, Volume 15:2, 47–51
|
D. Yu. Cherukhin
On the complexity of unitary transformations
Diskr. Mat., 2003, Volume 15:4, 113–118
|
V. P. Chistyakov, see M. I. Tikhomirova
Diskr. Mat., 2003, Volume 15:2, 149–159
|
V. N. Chubarikov, see G. I. Arkhipov
Diskr. Mat., 2003, Volume 15:4, 3–6
|
E. Girlikh, M. M. Kovalev, V. M. Kotov
A semi on-line algorithm for the partition problem
Diskr. Mat., 2003, Volume 15:4, 133–140
|
A. A. Grusho, E. E. Timonina
Estimation of the time required to organize a secret channel
Diskr. Mat., 2003, Volume 15:2, 40–46
|
M. A. Iordanskii
The structure and methods of generation of closed classes of graphs
Diskr. Mat., 2003, Volume 15:3, 105–116
|
N. I. Kazimirov
The occurrence of a gigantic component in a random permutation with a known number of cycles
Diskr. Mat., 2003, Volume 15:3, 145–159
|
N. M. Khodzhaev
On a problem of V. G. Sprindzhuk
Diskr. Mat., 2003, Volume 15:2, 63–82
|
B. V. Khromov, see L. Ya. Savel'ev
Diskr. Mat., 2003, Volume 15:1, 50–76
|
G. Kilibarda, V. B. Kudryavtsev, Š. M. Ušćumlić
Independent systems of automata in labyrinths
Diskr. Mat., 2003, Volume 15:2, 3–39
|
G. Kilibarda, V. B. Kudryavtsev, Š. M. Ušćumlić
Collectives of automata in labyrinths
Diskr. Mat., 2003, Volume 15:3, 3–39
|
A. E. Kirnasov
On glueing states of an automaton
Diskr. Mat., 2003, Volume 15:4, 66–83
|
A. V. Kolchin
On limit theorems for the generalised allocation scheme
Diskr. Mat., 2003, Volume 15:4, 148–157
|
V. F. Kolchin, see G. I. Arkhipov
Diskr. Mat., 2003, Volume 15:4, 3–6
|
V. A. Kolmykov
Inert matrices and matchings in partially oriented trees
Diskr. Mat., 2003, Volume 15:4, 119–125
|
V. M. Kotov, see E. Girlikh
Diskr. Mat., 2003, Volume 15:4, 133–140
|
M. M. Kovalev, see E. Girlikh
Diskr. Mat., 2003, Volume 15:4, 133–140
|
I. V. Kucherenko
On the number of invertible homogeneous structures
Diskr. Mat., 2003, Volume 15:2, 123–127
|
V. B. Kudryavtsev, see G. D. Kilibarda
Diskr. Mat., 2003, Volume 15:2, 3–39
|
V. B. Kudryavtsev, see G. D. Kilibarda
Diskr. Mat., 2003, Volume 15:3, 3–39
|
A. N. Kuznetsov, see A. A. Makhnev
Diskr. Mat., 2003, Volume 15:1, 77–97
|
A. A. Makhnev, A. A. Vedenev, A. N. Kuznetsov, V. V. Nosov
On good pairs in edge-regular graphs
Diskr. Mat., 2003, Volume 15:1, 77–97
|
S. S. Marchenkov
On the complexity of recurring sequences
Diskr. Mat., 2003, Volume 15:2, 52–62
|
S. S. Marchenkov
Boolean reducibility
Diskr. Mat., 2003, Volume 15:3, 40–53
|
D. V. Matyukhin
On the asymptotic complexity of computing discrete logarithms in the field $\operatorname{\mathit{GF}}(p)$
Diskr. Mat., 2003, Volume 15:1, 28–49
|
Yu. I. Medvedev, see G. I. Arkhipov
Diskr. Mat., 2003, Volume 15:4, 3–6
|
V. G. Mikhailov
Limit theorems for the number of points of a given set covered by a random linear subspace
Diskr. Mat., 2003, Volume 15:2, 128–137
|
V. G. Mikhailov, A. M. Shoitov
Structural equivalence of $s$-tuples in random discrete sequences
Diskr. Mat., 2003, Volume 15:4, 7–34
|
M. P. Mineev, see G. I. Arkhipov
Diskr. Mat., 2003, Volume 15:4, 3–6
|
A. V. Nagaev
Limit theorems and testing hypotheses on Markov chains
Diskr. Mat., 2003, Volume 15:4, 35–65
|
S. V. Nagaev, V. I. Vakhtel'
Limit theorems for probabilities of large deviations of a Galton-Watson process
Diskr. Mat., 2003, Volume 15:1, 3–27
|
S. M. Nikol'skii, see G. I. Arkhipov
Diskr. Mat., 2003, Volume 15:4, 3–6
|
V. V. Nosov, see A. A. Makhnev
Diskr. Mat., 2003, Volume 15:1, 77–97
|
A. S. Okhotin
On the complexity of the string generation problem
Diskr. Mat., 2003, Volume 15:4, 84–99
|
K. G. Omel'yanov, A. A. Sapozhenko
On the number and structure of sum-free sets in a segment of positive integers
Diskr. Mat., 2003, Volume 15:4, 141–147
|
P. A. Panteleev
On the distinguishability of states of automata
Diskr. Mat., 2003, Volume 15:3, 76–90
|
L. P. Postnikova, see G. I. Arkhipov
Diskr. Mat., 2003, Volume 15:4, 3–6
|
Yu. V. Prokhorov, see G. I. Arkhipov
Diskr. Mat., 2003, Volume 15:4, 3–6
|
A. A. Sapozhenko, see K. G. Omel'yanov
Diskr. Mat., 2003, Volume 15:4, 141–147
|
L. Ja. Savel'ev, S. V. Balakin, B. V. Khromov
Covering runs in binary Markov sequences
Diskr. Mat., 2003, Volume 15:1, 50–76
|
V. I. Senashov, V. P. Shunkov
Almost layer-finiteness of the periodic part of a group without involutions
Diskr. Mat., 2003, Volume 15:3, 91–104
|
K. K. Shchukin
On primitive subgroups of full affine groups of finite semi-fields
Diskr. Mat., 2003, Volume 15:4, 126–132
|
V. N. Shevchenko
Characteristic polynomials of multi-index transportation problems
Diskr. Mat., 2003, Volume 15:2, 83–88
|
I. C. Shkrebela
On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis
$\{x\to y,\bar x\}$
Diskr. Mat., 2003, Volume 15:4, 100–112
|
A. M. Shoitov, see V. G. Mikhailov
Diskr. Mat., 2003, Volume 15:4, 7–34
|
V. P. Shunkov, see V. I. Senashov
Diskr. Mat., 2003, Volume 15:3, 91–104
|
A. M. Stepanenkov
On the complexity of testing for the primality of a number by homogeneous structures
Diskr. Mat., 2003, Volume 15:3, 54–65
|
M. I. Tikhomirova, V. P. Chistyakov
On two chi-square-type statistics constructed from the frequencies of tuples of states of a multiple Markov chain
Diskr. Mat., 2003, Volume 15:2, 149–159
|
A. N. Timashev
Random partitions of sets with a known number of blocks
Diskr. Mat., 2003, Volume 15:2, 138–148
|
A. N. Timashev
On asymptotic expansions for the distribution of the number of cycles in a random permutation
Diskr. Mat., 2003, Volume 15:3, 117–127
|
A. V. Timofeenko
On generating triples of involutions of large sporadic groups
Diskr. Mat., 2003, Volume 15:2, 103–112
|
E. E. Timonina, see A. A. Grusho
Diskr. Mat., 2003, Volume 15:2, 40–46
|
Š. M. Ušćumlić, see G. D. Kilibarda
Diskr. Mat., 2003, Volume 15:2, 3–39
|
Š. M. Ušćumlić, see G. D. Kilibarda
Diskr. Mat., 2003, Volume 15:3, 3–39
|
A. A. Vedenev, see A. A. Makhnev
Diskr. Mat., 2003, Volume 15:1, 77–97
|
V. Wachtel, see S. V. Nagaev
Diskr. Mat., 2003, Volume 15:1, 3–27
|
|
|
Contact us: