F. K. Aliev
Products of independent identically distributed random variables with values in a finite simple semigroup
Tr. Diskr. Mat., 1998, 2, 1–20
|
M. I. Anokhin
On the reducibility of the integer factorization problem to the Diffie–Hellman problem
Tr. Diskr. Mat., 2000, 3, 7–20
|
A. V. Babash
Forbidden patterns for automata and Boolean functions
Tr. Diskr. Mat., 2006, 9, 7–20
|
A. V. Babash
On experiments on the input word information recognition
Tr. Diskr. Mat., 2004, 8, 7–24
|
A. V. Babash
Free of error reproduction automata mappings of periodic sequences
Tr. Diskr. Mat., 2002, 5, 7–20
|
S. A. Bachurin, see G. V. Balakin
Tr. Diskr. Mat., 2002, 6, 7–13
|
G. V. Balakin
Systems of Boolean equations with corrupted right hand side and restrictions on the values of unknowns and corruptions
Tr. Diskr. Mat., 2008, 11:1, 5–17
|
G. V. Balakin
An introduction to the theory of random systems of equations
Tr. Diskr. Mat., 1997, 1, 1–18
|
G. V. Balakin
Systems of random Boolean equations with a random choice of unknowns in each equation
Tr. Diskr. Mat., 2000, 3, 21–28
|
G. V. Balakin
Systems of random equations over a finite field
Tr. Diskr. Mat., 1998, 2, 21–37
|
G. V. Balakin
Identification test for systems of linear equations with corrupted right hand side in nonhomogeneous case
Tr. Diskr. Mat., 2006, 9, 21–31
|
G. V. Balakin
Sequential criterion of extracting a system of linear equations with corruptions in a right hand side
Tr. Diskr. Mat., 2002, 5, 21–28
|
G. V. Balakin
On some criterion of extracting a system of linear equations with corruptions in a right side
Tr. Diskr. Mat., 2004, 8, 25–33
|
G. V. Balakin
Criteria for a selection of satisfiable system of equations with corruptions in a right hand side
Tr. Diskr. Mat., 2001, 4, 7–16
|
G. V. Balakin
Systems of equations with disturbance parameters
Tr. Diskr. Mat., 2007, 10, 7–17
|
G. V. Balakin, S. A. Bachurin
An estimate for parameters of sequential selection of unknowns
Tr. Diskr. Mat., 2002, 6, 7–13
|
G. V. Balakin
Algorithm of searching a minimal set which contains a true solution with a given probability
Tr. Diskr. Mat., 2003, 7, 7–21
|
A. P. Baranov, Yu. A. Baranov
Distribution of the power divergence statistics with increasing number of outcomes in a goodness-of-fit test
Tr. Diskr. Mat., 2004, 8, 34–51
|
Yu. A. Baranov, see A. P. Baranov
Tr. Diskr. Mat., 2004, 8, 34–51
|
V. A. Bashev
Group-theoretic characterization of nonautonomous linear shift registers
Tr. Diskr. Mat., 2004, 8, 52–68
|
P. F. Belyaev
On the joint distribution of frequencies of long $s$-chains in simple homogeneous Markov chains with a finite set of outcomes
Tr. Diskr. Mat., 1997, 1, 19–42
|
P. F. Belyaev
On the joint distribution of the extreme values of frequencies on embedded intervals of a Markov chain
Tr. Diskr. Mat., 1998, 2, 38–54
|
S. M. Buravlev, M. M. Glukhov, V. S. Gorbachev, A. M. Zubkov, S. N. Kozlov, V. F. Kolchin, A. I. Markov, Yu. I. Medvedev, Yu. V. Prokhorov, V. N. Sachkov, B. A. Sevast'yanov
In memory of Nikolai Nikolaevich Andreev
Tr. Diskr. Mat., 2007, 10, 5–6
|
A. V. Cheremushkin
Methods of affine and linear classification of binary functions
Tr. Diskr. Mat., 2001, 4, 273–314
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 2008, 11:1, 144–150
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 2003, 7, 201–212
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 2002, 6, 213–225
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 2002, 5, 241–246
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 2001, 4, 259–272
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 1997, 1, 265–278
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 2004, 8, 281–298
|
V. P. Chistyakov, M. I. Tikhomirova
Statistical tests based on $s$-tuples from some set
Tr. Diskr. Mat., 2000, 3, 295–302
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 1998, 2, 305–314
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 2007, 10, 319–325
|
V. P. Chistyakov, see M. I. Tikhomirova
Tr. Diskr. Mat., 2006, 9, 357–376
|
A. Ya. Dorofeev
Computation of logarithms in a finite simple field by the linear sieve method
Tr. Diskr. Mat., 2002, 5, 29–50
|
V. P. Elizarov
On the sequential algorithm for solution of system of linear equations over the residue ring
Tr. Diskr. Mat., 2008, 11:2, 31–42
|
V. P. Elizarov
Systems of linear equations over finite rings
Tr. Diskr. Mat., 2002, 6, 31–47
|
V. P. Elizarov
Simplification methods for systems of linear equations over modules. I
Tr. Diskr. Mat., 2003, 7, 56–74
|
V. P. Elizarov
Simplification methods for systems of linear equations over modules. II
Tr. Diskr. Mat., 2004, 8, 79–98
|
M. V. Fedyukin
On a subdirect product of substitution groups
Tr. Diskr. Mat., 2003, 7, 213–226
|
M. V. Fedyukin
On some classes of strongly bijective and completely strongly bijective transforms
Tr. Diskr. Mat., 2002, 6, 226–238
|
M. V. Fedyukin
On generation of substitution groups by random substitutions and coordinate permutations of vector space elements
Tr. Diskr. Mat., 2002, 5, 247–254
|
M. V. Fedyukin
On functions realizable by polynomials over universal algebras with pseudomodular operations
Tr. Diskr. Mat., 2004, 8, 299–311
|
M. M. Glukhov
On the solution complexity of systems of linear equations over finite commutative chain rings
Tr. Diskr. Mat., 2002, 6, 14–30
|
M. M. Glukhov
Injective mappings free of error reproduction
Tr. Diskr. Mat., 2001, 4, 17–32
|
M. M. Glukhov
Investigation of residue rings of biquadratic extensions of an integer number ring and public key schemes
Tr. Diskr. Mat., 2003, 7, 31–55
|
M. M. Glukhov
On 2-transitive products of regular permutation groups
Tr. Diskr. Mat., 2000, 3, 37–52
|
M. M. Glukhov
On numerical parameters associated with the definition of finite groups by systems of generating elements
Tr. Diskr. Mat., 1997, 1, 43–66
|
M. M. Glukhov
Construction of public key cryptosystems by means of residue rings of integer algebraic numbers
Tr. Diskr. Mat., 2007, 10, 47–72
|
M. M. Glukhov, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
V. S. Gorbachev, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
E. V. Gorbatov, see A. A. Nechaev
Tr. Diskr. Mat., 2006, 9, 164–189
|
Yu. N. Gorchinskii
On $\pi$-automorphisms of finite groups
Tr. Diskr. Mat., 2001, 4, 33–50
|
Yu. N. Gorchinskii
On the improved estimates of mean-square deviations of transition matrices for products of independent random variables on finite permutation groups
Tr. Diskr. Mat., 2000, 3, 53–72
|
Yu. N. Gorchinskii
Stochastic algebras
Tr. Diskr. Mat., 1998, 2, 55–87
|
Yu. N. Gorchinskii
On homomorphisms of multibase universal algebras in connection with cryptographic applications
Tr. Diskr. Mat., 1997, 1, 67–84
|
Yu. N. Gorchinskii
On the mean-square deviations of transition matrices on finite permutation groups of even order
Tr. Diskr. Mat., 2000, 3, 73–94
|
Yu. N. Gorchinskii, I. A. Kruglov, V. M. Kapitonov
Problems in the theory of distributions on finite groups
Tr. Diskr. Mat., 1997, 1, 85–112
|
Yu. N. Gorchinskii, V. M. Kapitonov
On mean-square deviations in the rows of matrices of transition probabilities on finite permutation groups
Tr. Diskr. Mat., 1998, 2, 88–100
|
V. A. Ivanov
Models of insertions into homogeneous random sequences
Tr. Diskr. Mat., 2008, 11:1, 18–34
|
V. A. Ivanov
Automaton transformations of random sequences
Tr. Diskr. Mat., 1998, 2, 151–168
|
V. A. Ivanov
Statistical estimation of the code noising efficiency
Tr. Diskr. Mat., 2002, 6, 48–63
|
V. A. Ivanov
On a system of random equations
Tr. Diskr. Mat., 2006, 9, 51–65
|
V. A. Ivanov
Asymptotic estimates for probability characterictics of selftuning time of mixing automata
Tr. Diskr. Mat., 2001, 4, 57–70
|
V. A. Ivanov
Asymptotic properties of testing hypotheses on a randomly transformed sample
Tr. Diskr. Mat., 2002, 5, 61–72
|
V. A. Ivanov
On the influence of outer noises on the finite automata performance
Tr. Diskr. Mat., 2000, 3, 95–110
|
V. A. Ivanov
On artificial noising of data transmission channels
Tr. Diskr. Mat., 2004, 8, 99–115
|
G. I. Ivchenko, Yu. I. Medvedev
Random incomplete substitutions
Tr. Diskr. Mat., 2008, 11:1, 35–46
|
G. I. Ivchenko, Yu. I. Medvedev
On the structure of random polynomials over finite fields
Tr. Diskr. Mat., 2000, 3, 111–138
|
G. I. Ivchenko, Yu. I. Medvedev
Statistics of a parametric model of random substitutions
Tr. Diskr. Mat., 2004, 8, 116–127
|
G. I. Ivchenko, Yu. I. Medvedev
On the asymptotic efficiency of separable statistics in a polynomial scheme
Tr. Diskr. Mat., 1997, 1, 121–138
|
G. I. Ivchenko, Yu. I. Medvedev
Mixtures of probability distributions, and random allocations
Tr. Diskr. Mat., 1998, 2, 169–182
|
G. I. Ivchenko, Yu. I. Medvedev
Investigation of changing urn schemes parameters
Tr. Diskr. Mat., 2002, 6, 64–81
|
G. I. Ivchenko, Yu. I. Medvedev
Statistical inference for random substitutions with incomplete data
Tr. Diskr. Mat., 2006, 9, 66–76
|
G. I. Ivchenko, Yu. I. Medvedev
Extremal characteristics of random polynomial over a finite field
Tr. Diskr. Mat., 2001, 4, 71–82
|
G. I. Ivchenko, Yu. I. Medvedev
On random permutations
Tr. Diskr. Mat., 2002, 5, 73–92
|
G. I. Ivchenko, Yu. I. Medvedev
Random combinatorial objects in a general parametric model
Tr. Diskr. Mat., 2007, 10, 73–86
|
G. I. Ivchenko, Yu. I. Medvedev
On a class of nonuniform permutations of a random order
Tr. Diskr. Mat., 2003, 7, 75–88
|
V. M. Kapitonov, see Yu. N. Gorchinskii
Tr. Diskr. Mat., 1997, 1, 85–112
|
V. M. Kapitonov, see Yu. N. Gorchinskii
Tr. Diskr. Mat., 1998, 2, 88–100
|
L. S. Kazarin, see V. M. Sidel'nikov
Tr. Diskr. Mat., 2008, 11:1, 109–118
|
L. S. Kazarin, V. M. Sidel'nikov
On an approach to the quantum codes design
Tr. Diskr. Mat., 2004, 8, 128–138
|
L. S. Kazarin, V. M. Sidel'nikov
An automorphism group of Suzuki $p$-group
Tr. Diskr. Mat., 2007, 10, 87–96
|
V. F. Kolchin
Satisfiability probability for systems of random equations
Tr. Diskr. Mat., 2000, 3, 139–146
|
V. F. Kolchin
On the threshold effect for systems of random equations
Tr. Diskr. Mat., 1998, 2, 183–190
|
V. F. Kolchin, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
V. F. Kolchin
A problem of classification by means of pair comparisons
Tr. Diskr. Mat., 2001, 4, 83–90
|
V. F. Kolchin
A structure of solutions and a reconstruction of the true solution for system of equations with corrupted right hand sides
Tr. Diskr. Mat., 2002, 5, 93–102
|
S. N. Kozlov, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
I. A. Kruglov
Asymptotic behavior of products of random variables with values in finite simple groups and distributions depending on a Markov chain
Tr. Diskr. Mat., 2008, 11:2, 51–62
|
I. A. Kruglov, see Yu. N. Gorchinskii
Tr. Diskr. Mat., 1997, 1, 85–112
|
V. L. Kurakin
Free shift registers. III
Tr. Diskr. Mat., 2008, 11:2, 63–85
|
V. L. Kurakin, see A. S. Kuz'min
Tr. Diskr. Mat., 2002, 5, 103–158
|
V. L. Kurakin
Free shift registers. II
Tr. Diskr. Mat., 2007, 10, 123–174
|
V. L. Kurakin, see A. S. Kuz'min
Tr. Diskr. Mat., 1997, 1, 139–202
|
V. L. Kurakin, see A. A. Nechaev
Tr. Diskr. Mat., 2000, 3, 155–194
|
V. L. Kurakin, see A. S. Kuz'min
Tr. Diskr. Mat., 1998, 2, 191–222
|
V. L. Kurakin
Free shift registers. I
Tr. Diskr. Mat., 2006, 9, 77–109
|
V. L. Kurakin
Binomial linear complexity of polylinear sequences
Tr. Diskr. Mat., 2002, 6, 82–138
|
V. L. Kurakin
Polylinear transforms of linear recurrent sequences over modules
Tr. Diskr. Mat., 2003, 7, 89–113
|
V. L. Kurakin, see A. S. Kuz'min
Tr. Diskr. Mat., 2001, 4, 91–128
|
A. S. Kuz'min, A. A. Nechaev, V. A. Shishkin
Parameters of (hyper-)bent functions over the field of $2^l$ elements
Tr. Diskr. Mat., 2008, 11:1, 47–59
|
A. S. Kuz'min, V. L. Kurakin, A. A. Nechaev
Almost uniform linear recurrent sequences over Galois rings and $QF$-modules of characteristic 4
Tr. Diskr. Mat., 2002, 5, 103–158
|
A. S. Kuz'min, V. L. Kurakin, A. A. Nechaev
Pseudorandom and polylinear sequences
Tr. Diskr. Mat., 1997, 1, 139–202
|
A. S. Kuz'min, see A. A. Nechaev
Tr. Diskr. Mat., 2000, 3, 155–194
|
A. S. Kuz'min, V. L. Kurakin, A. A. Nechaev
Properties of linear and polylinear recurrent sequences over Galois rings. I
Tr. Diskr. Mat., 1998, 2, 191–222
|
A. S. Kuz'min, V. L. Kurakin, A. A. Nechaev
Structural properties of linear recurrent sequences over Galois rings and quasi-Frobenius modules of charasteristic 4
Tr. Diskr. Mat., 2001, 4, 91–128
|
A. S. Kuz'min, A. A. Nechaev, V. A. Shishkin
Bent and hyper-bent functions over the finite field
Tr. Diskr. Mat., 2007, 10, 97–122
|
A. V. Lapshin
On a distributional characteristic of a difference of two random variables on a finite Abelian group
Tr. Diskr. Mat., 2003, 7, 114–125
|
A. V. Lapshin
Statistical estimation of addend distribution based on a series of observations of a sum of independent random variables on a finite Abelian group
Tr. Diskr. Mat., 2001, 4, 129–148
|
A. V. Lapshin
Estimation of a distributional parameter of random variable on a finite Abelian group by the sum of its realizations with elements of a random permutation
Tr. Diskr. Mat., 2004, 8, 139–147
|
Yu. I. Maksimov
Some results for the Markov chain lumping problem
Tr. Diskr. Mat., 2004, 8, 148–154
|
Yu. I. Maksimov
Linear random forms on vector spaces over a finite field
Tr. Diskr. Mat., 2001, 4, 149–160
|
Yu. I. Maksimov
Design and analysis of statistical tests for some schemes of random sequences over the field $\mathbf{GF}(q)$
Tr. Diskr. Mat., 2002, 5, 159–166
|
Yu. I. Maksimov
On Markov chains associated with binary shift registers with random elements
Tr. Diskr. Mat., 1997, 1, 203–220
|
Yu. I. Maksimov
The Bernoulli scheme with alternating insertions
Tr. Diskr. Mat., 1998, 2, 223–229
|
F. M. Malyshev
Generating sets of elements of recurrent sequences
Tr. Diskr. Mat., 2008, 11:2, 86–111
|
F. M. Malyshev
On a generating system of a symmetrical group
Tr. Diskr. Mat., 2006, 9, 110–120
|
F. M. Malyshev
Inheritance of some properties of generating families by a substitution group
Tr. Diskr. Mat., 2004, 8, 155–175
|
F. M. Malyshev
On a generating system of alternating groups on finite vector spaces
Tr. Diskr. Mat., 2007, 10, 175–181
|
A. I. Markov, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
D. V. Matyukhin
Effective version of the number field sieve for discrete logarithm in a field $\mathbf{GF}(p^k)$
Tr. Diskr. Mat., 2006, 9, 121–151
|
D. V. Matyukhin
On the “weak” keys of Diffie–Hellman problems in a field $F_{p^m}$
Tr. Diskr. Mat., 2007, 10, 182–187
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 2008, 11:1, 35–46
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 2000, 3, 111–138
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 2004, 8, 116–127
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 1997, 1, 121–138
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 1998, 2, 169–182
|
Yu. I. Medvedev, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 2002, 6, 64–81
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 2006, 9, 66–76
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 2001, 4, 71–82
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 2007, 10, 73–86
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 2002, 5, 73–92
|
Yu. I. Medvedev, see G. I. Ivchenko
Tr. Diskr. Mat., 2003, 7, 75–88
|
S. Yu. Mel'nikov
Polyhedra characterizing the statistical properties of finite automata
Tr. Diskr. Mat., 2003, 7, 126–137
|
D. A. Mikhailov
Solution of some classes of systems of polynomial equations over finite fields and rings
Tr. Diskr. Mat., 2008, 11:2, 125–146
|
V. G. Mikhailov
Reducing the problem on the limit behavior of the number of solutions for system of equations with random choice of unknowns to a problem on the allocation of particles
Tr. Diskr. Mat., 2008, 11:2, 112–124
|
V. G. Mikhailov, see A. M. Zubkov
Tr. Diskr. Mat., 1998, 2, 101–111
|
V. G. Mikhailov
Poissonian limit theorems for the number of $H$-connected tuples
Tr. Diskr. Mat., 2003, 7, 138–155
|
V. G. Mikhailov
Investigation of combinatorial-probabilistic model of a controlled shift registers automata
Tr. Diskr. Mat., 2002, 6, 139–149
|
V. G. Mikhailov
Inequalities for the mean number of $m$-tuples repetitions and for the mean number of unappeared $m$-tuples from a given class
Tr. Diskr. Mat., 2000, 3, 147–154
|
V. G. Mikhailov
On asymptotic properties of the number of runs of events
Tr. Diskr. Mat., 2006, 9, 152–163
|
V. G. Mikhailov
On a Poisson approximation in a problem of a union (intersection) of random sets
Tr. Diskr. Mat., 2001, 4, 161–168
|
V. G. Mikhailov
Investigation of the number of cyclic points in a controlled shift registers automaton
Tr. Diskr. Mat., 2002, 5, 167–172
|
V. G. Mikhailov, B. I. Selivanov
On some statistics in a scheme of particles allocation in cells of a two-dimensional table
Tr. Diskr. Mat., 2001, 4, 169–176
|
V. G. Mikhailov
On the features of asymptotic behaviour for the number of structurally similar tuples pairs
Tr. Diskr. Mat., 2004, 8, 176–186
|
V. G. Mikhailov
Some inequalities for the distribution function of the number of nonappearing $s$-chains
Tr. Diskr. Mat., 1997, 1, 221–226
|
V. G. Mikhailov
Investigation of a Markov scheme for the allocation of particles to cells
Tr. Diskr. Mat., 1998, 2, 230–236
|
A. A. Nechaev, see A. S. Kuz'min
Tr. Diskr. Mat., 2008, 11:1, 47–59
|
A. A. Nechaev, see A. S. Kuz'min
Tr. Diskr. Mat., 2002, 5, 103–158
|
A. A. Nechaev, see A. S. Kuz'min
Tr. Diskr. Mat., 1997, 1, 139–202
|
A. A. Nechaev
Multidimensional shift registers and multisequence complexity
Tr. Diskr. Mat., 2002, 6, 150–164
|
A. A. Nechaev, A. S. Kuz'min, V. L. Kurakin
Structural, analitical and statistical properties of linear and polylinear recurrent sequences
Tr. Diskr. Mat., 2000, 3, 155–194
|
A. A. Nechaev, E. V. Gorbatov
Finite quasifrobenius bimodules and polylinear shift registers
Tr. Diskr. Mat., 2006, 9, 164–189
|
A. A. Nechaev
Finite Frobenius bimodules in a linear codes theory
Tr. Diskr. Mat., 2004, 8, 187–215
|
A. A. Nechaev, see A. S. Kuz'min
Tr. Diskr. Mat., 1998, 2, 191–222
|
A. A. Nechaev, see A. S. Kuz'min
Tr. Diskr. Mat., 2001, 4, 91–128
|
A. A. Nechaev, see A. S. Kuz'min
Tr. Diskr. Mat., 2007, 10, 97–122
|
Yu. V. Nesterenko
Fermat quotients and $p$-adic logarithms
Tr. Diskr. Mat., 2002, 5, 173–188
|
N. V. Nikonov, see V. G. Nikonov
Tr. Diskr. Mat., 2008, 11:1, 60–85
|
V. G. Nikonov, N. V. Nikonov
Features of threshold representations of $k$-valued functions
Tr. Diskr. Mat., 2008, 11:1, 60–85
|
V. G. Nikonov
On the existence of minimal but not shortest disjunctive normal form
Tr. Diskr. Mat., 2007, 10, 188–201
|
N. D. Podufalov
On some characterizations of exponential functions on linear spaces
Tr. Diskr. Mat., 2004, 8, 216–239
|
B. A. Pogorelov, M. A. Pudovkina
Hamming submetrics and their isometry groups
Tr. Diskr. Mat., 2008, 11:2, 147–191
|
B. A. Pogorelov
Submetrics of the Hamming metric and the theorem of A. A. Markov
Tr. Diskr. Mat., 2006, 9, 190–219
|
B. A. Pogorelov, M. A. Pudovkina
Submetrics of a Hamming metric and trasforms which disseminate corruptions with a given multiplicity
Tr. Diskr. Mat., 2007, 10, 202–238
|
B. A. Pogorelov
Permutation groups. I. (A survey for the period 1981–1995)
Tr. Diskr. Mat., 1998, 2, 237–281
|
S. V. Polin
Hilbert modules categories over semirings and fuzzy mappins
Tr. Diskr. Mat., 2001, 4, 177–200
|
S. V. Polin
Design of the Pitman's most efficient decomposable statistics for testing hypotheses on a superposition of random mappings
Tr. Diskr. Mat., 2002, 5, 189–204
|
S. V. Polin
An application of topos theory to the investigation of cryptosystems
Tr. Diskr. Mat., 2006, 9, 220–252
|
S. V. Polin
Some algorithmic questions connected with the solution of the search problem without a clear criteria for checking the validity of a variant
Tr. Diskr. Mat., 2007, 10, 239–268
|
Yu. V. Prokhorov, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
M. A. Pudovkina, see B. A. Pogorelov
Tr. Diskr. Mat., 2008, 11:2, 147–191
|
M. A. Pudovkina, see B. A. Pogorelov
Tr. Diskr. Mat., 2007, 10, 202–238
|
M. I. Rozhkov
On the summation of Markov chains on a finite group
Tr. Diskr. Mat., 2000, 3, 195–214
|
V. N. Sachkov
Multiheredity and multireducing of transforms. Wreath cycle product of substitutions
Tr. Diskr. Mat., 2008, 11:1, 86–108
|
V. N. Sachkov
Preface
Tr. Diskr. Mat., 1997, 1, V
|
V. N. Sachkov
Deficiencies of finite group permutations
Tr. Diskr. Mat., 2003, 7, 156–175
|
V. N. Sachkov
Markov chains of iterative transformations systems
Tr. Diskr. Mat., 2002, 6, 165–183
|
V. N. Sachkov
Partitions with merging and discordant set partitions
Tr. Diskr. Mat., 2001, 4, 201–222
|
V. N. Sachkov
Random nonuniform coverings and functional equations
Tr. Diskr. Mat., 2002, 5, 205–218
|
V. N. Sachkov
Groups of permutations and semigroups of transforms with a given number of generating elements
Tr. Diskr. Mat., 2000, 3, 215–234
|
V. N. Sachkov
Probabilistic converters and regular multigraphs. I
Tr. Diskr. Mat., 1997, 1, 227–250
|
V. N. Sachkov
Probabilistic transformers and sums of elementary matrices. II
Tr. Diskr. Mat., 2004, 8, 240–252
|
V. N. Sachkov
Translators and translations of discrete functions
Tr. Diskr. Mat., 2006, 9, 253–268
|
V. N. Sachkov
Reduction operator and transforms with a hereditary property. II
Tr. Diskr. Mat., 2007, 10, 269–286
|
V. N. Sachkov
The reduction operator. I
Tr. Diskr. Mat., 1998, 2, 282–295
|
V. N. Sachkov, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
B. I. Selivanov, see V. G. Mikhailov
Tr. Diskr. Mat., 2001, 4, 169–176
|
B. A. Sevast'yanov
Structural characteristics of some nonuniform mappings of finite sets
Tr. Diskr. Mat., 2002, 6, 184–193
|
B. A. Sevast'yanov
Investigation of probabilistic dependency of automaton output on some input characteristics
Tr. Diskr. Mat., 2002, 5, 219–226
|
B. A. Sevast'yanov
Some problems connected with Boolean functions
Tr. Diskr. Mat., 2001, 4, 223–230
|
B. A. Sevast'yanov
Probability distribution of permanents of random matrices with independent elements from a field GF($p$)
Tr. Diskr. Mat., 2000, 3, 235–248
|
B. A. Sevast'yanov
On a connection between the structural characteristics of preimages and images of finite sets for some classes of transformations
Tr. Diskr. Mat., 1998, 2, 296–304
|
B. A. Sevast'yanov, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
A. V. Shapovalov
Threshold functions for the solvability of random systems of equations
Tr. Diskr. Mat., 2006, 9, 377–400
|
V. I. Sherstnev
Resolution of a uniform distribution on a finite Abelian group
Tr. Diskr. Mat., 2001, 4, 315–318
|
V. A. Shishkin, see A. S. Kuz'min
Tr. Diskr. Mat., 2008, 11:1, 47–59
|
V. A. Shishkin, see A. S. Kuz'min
Tr. Diskr. Mat., 2007, 10, 97–122
|
A. M. Shoitov
Asymptotic distributional properties of the number of pairs of metrically close and functionally connected tuples in a polynomial scheme
Tr. Diskr. Mat., 2008, 11:1, 151–165
|
A. M. Shoitov
On a feature of asymptotic distributions of the number of $H$-equivalent $n$-tuples sets in the nonequiprobable polynomial scheme
Tr. Diskr. Mat., 2003, 7, 227–238
|
A. M. Shoitov
Limit distributions of random variables characterizing the connection between tuples in a polynomial scheme by means of structural equivalence
Tr. Diskr. Mat., 2004, 8, 312–326
|
A. M. Shoitov
Normal approximation in a problem on equivalent tuples
Tr. Diskr. Mat., 2007, 10, 326–349
|
A. M. Shoitov
Permutationally equivalent repetitions of nonoverlapping tuples in the polynomial scheme
Tr. Diskr. Mat., 2006, 9, 401–414
|
V. M. Sidel'nikov, L. S. Kazarin
On a group algebra of a dihedral group and complexity of multiplication of second order matrices
Tr. Diskr. Mat., 2008, 11:1, 109–118
|
V. M. Sidel'nikov, see L. S. Kazarin
Tr. Diskr. Mat., 2004, 8, 128–138
|
V. M. Sidel'nikov
Quantum code with code distance 5
Tr. Diskr. Mat., 2003, 7, 176–190
|
V. M. Sidel'nikov
Generalized Hadamard matrices and their applications
Tr. Diskr. Mat., 2000, 3, 249–268
|
V. M. Sidel'nikov
Fast algorithms for constructing a set of labelings of discrete data files
Tr. Diskr. Mat., 1997, 1, 251–264
|
V. M. Sidel'nikov
McWilliams identity for associative schemes based on the automorphisms of finite groups
Tr. Diskr. Mat., 2006, 9, 269–307
|
V. M. Sidel'nikov, see L. S. Kazarin
Tr. Diskr. Mat., 2007, 10, 87–96
|
V. G. Smirnov
Polynomial representations of discrete functions
Tr. Diskr. Mat., 2008, 11:1, 119–137
|
V. G. Smirnov
Algorithms of solving the $k$-valued equation systems based on the construction of oriented graph of solutions
Tr. Diskr. Mat., 2002, 6, 194–212
|
V. G. Smirnov
Efficient algorithms for construction of general solution graph for systems of Boolean equations
Tr. Diskr. Mat., 2002, 5, 227–234
|
V. G. Smirnov
Construction methods of solutions graphs for systems of $k$-valued equations
Tr. Diskr. Mat., 2004, 8, 253–280
|
V. G. Smirnov
Some classes of Boolean equation systems permitting effective solution
Tr. Diskr. Mat., 2000, 3, 269–282
|
V. G. Smirnov
Methods of solution for systems of discrete equations based on the construction of the graph of solutions
Tr. Diskr. Mat., 2006, 9, 308–339
|
V. I. Solodovnikov
On a semigroup generated by automata mappings of a reversible automaton
Tr. Diskr. Mat., 2001, 4, 231–242
|
V. I. Solodovnikov
Homomorphisms of shift registers and linear automata
Tr. Diskr. Mat., 2007, 10, 287–300
|
V. E. Tarakanov
To the solution of the problem on the representation of discrete logarithm of a number as a sum of logarithms of small numbers by means of rational approximation
Tr. Diskr. Mat., 2008, 11:2, 192–206
|
V. E. Tarakanov
On the automorphism groups of generalized de Bruijn graphs
Tr. Diskr. Mat., 2002, 5, 235–240
|
V. E. Tarakanov
Divisibility properties of points on elliptic curves over finite field
Tr. Diskr. Mat., 2001, 4, 243–258
|
V. E. Tarakanov
On the set of values of a cubic polynomial over a simple finite field
Tr. Diskr. Mat., 2000, 3, 283–294
|
V. E. Tarakanov
On an approach to the solution of the discrete logarithm problem by means of rational approximations
Tr. Diskr. Mat., 2007, 10, 301–313
|
V. E. Tarakanov
Linear recurrent sequences on elliptic curves an their application in cryptography
Tr. Diskr. Mat., 2006, 9, 340–356
|
M. I. Tikhomirova
Joint limit distributions of the numbers of missing tuples of identical outcomes
Tr. Diskr. Mat., 2008, 11:1, 138–143
|
M. I. Tikhomirova, V. P. Chistyakov
Some statistics of $\chi^2$ type dependent on the frequencies of long tuples of outcomes in independent trials
Tr. Diskr. Mat., 2008, 11:1, 144–150
|
M. I. Tikhomirova
A limit distribution of a $\chi$-square statistics of frequences of equal outcomes runs in a polynomial scheme
Tr. Diskr. Mat., 2003, 7, 191–200
|
M. I. Tikhomirova, V. P. Chistyakov
Limit distributions of some statistics connected with recurrent events
Tr. Diskr. Mat., 2003, 7, 201–212
|
M. I. Tikhomirova, V. P. Chistyakov
Approximate computation of limit distributions of some statistics functionals
Tr. Diskr. Mat., 2002, 6, 213–225
|
M. I. Tikhomirova, V. P. Chistyakov
On some characteristic of two-stage procedure for multiple hypotheses selection
Tr. Diskr. Mat., 2002, 5, 241–246
|
M. I. Tikhomirova, V. P. Chistyakov
Normal approximation of multidimensional $\chi^2$ distribution
Tr. Diskr. Mat., 2001, 4, 259–272
|
M. I. Tikhomirova, V. P. Chistyakov
О статистических критериях отсутствующих $s$-грамм
Tr. Diskr. Mat., 1997, 1, 265–278
|
M. I. Tikhomirova, V. P. Chistyakov
Multidimensional $\chi^2$-statistics in disorder problems
Tr. Diskr. Mat., 2004, 8, 281–298
|
M. I. Tikhomirova, see V. P. Chistyakov
Tr. Diskr. Mat., 2000, 3, 295–302
|
M. I. Tikhomirova, V. P. Chistyakov
On $\chi^2$-type statistics constructed from the output of a finite automaton
Tr. Diskr. Mat., 1998, 2, 305–314
|
M. I. Tikhomirova
Sequential $\chi^2$-test based on statistics which are functionally dependent on the estimates of unknown parameters
Tr. Diskr. Mat., 2007, 10, 314–318
|
M. I. Tikhomirova, V. P. Chistyakov
On the homogeneity of samples testing based on the frequencies of tuples of outcomes in a sequence of trials with unknown probabilities of outcomes
Tr. Diskr. Mat., 2007, 10, 319–325
|
M. I. Tikhomirova, V. P. Chistyakov
Statistical tests for the identification of some types of dependencies between random sequences
Tr. Diskr. Mat., 2006, 9, 357–376
|
O. N. Vasilenko
New methods of computing the multipe of a point on an elliptic curve over finite field
Tr. Diskr. Mat., 2008, 11:2, 5–30
|
O. N. Vasilenko
On the computation of Weil and Tate pairings
Tr. Diskr. Mat., 2007, 10, 18–46
|
O. N. Vasilenko
On some properties of prime factorisations of integers
Tr. Diskr. Mat., 2003, 7, 22–30
|
O. N. Vasilenko
On the computation of the order of the elliptic curve group over finite field
Tr. Diskr. Mat., 2006, 9, 32–50
|
O. N. Vasilenko
Some identities for trigomometrical Gauss sums and their applications
Tr. Diskr. Mat., 2004, 8, 69–78
|
V. A. Vatutin
On the embeddability probability of a random hypergraph with coloured edges into a bipartite graph
Tr. Diskr. Mat., 2000, 3, 29–36
|
A. M. Zubkov
Probabilistic representations of some measures connected with factorizations
Tr. Diskr. Mat., 2008, 11:2, 43–50
|
A. M. Zubkov, V. G. Mikhailov
Estimation of the minimum number of outcomes with a given total probability
Tr. Diskr. Mat., 1998, 2, 101–111
|
A. M. Zubkov
Peculiarities of two-dimensional distributions of a sequence generated by a linear congruential generator
Tr. Diskr. Mat., 1997, 1, 113–120
|
A. M. Zubkov, see S. M. Buravlev
Tr. Diskr. Mat., 2007, 10, 5–6
|
A. M. Zubkov
Computational algorithms for distributions of sums of random variables
Tr. Diskr. Mat., 2002, 5, 51–60
|
A. M. Zubkov
Estimates for maximal sizes of zero submatrices of a random $(0,1)$-matrix
Tr. Diskr. Mat., 2001, 4, 51–56
|
A. Yu. Zubov
On the diameter of the group $S_N$ with respect to a system of generators consisting of a complete cycle and a transposition
Tr. Diskr. Mat., 1998, 2, 112–150
|
