Trudy po Diskretnoi Matematike
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Tr. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

2002, Volume 5  
| General information | Contents |


Trudy po Diskretnoi Matematike


Free of error reproduction automata mappings of periodic sequences
A. V. Babash 		7–20
Sequential criterion of extracting a system of linear equations with corruptions in a right hand side
G. V. Balakin 		21–28
Computation of logarithms in a finite simple field by the linear sieve method
A. Ya. Dorofeev 		29–50
Computational algorithms for distributions of sums of random variables
A. M. Zubkov 		51–60
Asymptotic properties of testing hypotheses on a randomly transformed sample
V. A. Ivanov 		61–72
On random permutations
G. I. Ivchenko, Yu. I. Medvedev 		73–92
A structure of solutions and a reconstruction of the true solution for system of equations with corrupted right hand sides
V. F. Kolchin 		93–102
Almost uniform linear recurrent sequences over Galois rings and $QF$-modules of characteristic 4
A. S. Kuz'min, V. L. Kurakin, A. A. Nechaev 		103–158
Design and analysis of statistical tests for some schemes of random sequences over the field $\mathbf{GF}(q)$
Yu. I. Maksimov 		159–166
Investigation of the number of cyclic points in a controlled shift registers automaton
V. G. Mikhailov 		167–172
Fermat quotients and $p$-adic logarithms
Yu. V. Nesterenko 		173–188
Design of the Pitman's most efficient decomposable statistics for testing hypotheses on a superposition of random mappings
S. V. Polin 		189–204
Random nonuniform coverings and functional equations
V. N. Sachkov 		205–218
Investigation of probabilistic dependency of automaton output on some input characteristics
B. A. Sevast'yanov 		219–226
Efficient algorithms for construction of general solution graph for systems of Boolean equations
V. G. Smirnov 		227–234
On the automorphism groups of generalized de Bruijn graphs
V. E. Tarakanov 		235–240
On some characteristic of two-stage procedure for multiple hypotheses selection
M. I. Tikhomirova, V. P. Chistyakov 		241–246
On generation of substitution groups by random substitutions and coordinate permutations of vector space elements
M. V. Fedyukin 		247–254
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026