1. Sequential analysis and controlled random processes (discrete time)

   • A. N. Shiryaev

   OriginalPaper Pages: 1 - 27

2. On an isomorphism of abstract automata. I

   • Yu. V. Kapitonova

   OriginalPaper Pages: 28 - 31

3. The chromatic class of a multigraph

   • V. G. Vizing

   OriginalPaper Pages: 32 - 41

4. The structure of one type of associative net

   • S. Ya. Zaslavskii

   OriginalPaper Pages: 42 - 45

5. The expansion of graphs and finite automata with respect to multiplication

   • A. N. Melikhov
   • Yu. A. Dvoryantsev

   OriginalPaper Pages: 46 - 54

6. A method for dynamic modeling of noninertial objects

   • B. A. Borkovskii

   OriginalPaper Pages: 55 - 59

7. Internal sorting of information with a limited memory

   • L. S. Lozinskii

   OriginalPaper Pages: 60 - 64

8. The computation of representations of the interlacing of finite groups

   • N. N. Aizenberg
   • A. A. Letichevskii

   OriginalPaper Pages: 65 - 73

9. Computing schemes for solution of problems in scheduling theory

   • V. V. Shkurba

   OriginalPaper Pages: 74 - 78

10. Algorithm for solution of the problem of optimum layout of circular patterns with restrictions on the distances between patterns

    • V. L. Rvachev
    • Yu. G. Stoyan

    OriginalPaper Pages: 79 - 85

11. Parametric network problems

    • Yu. M. Ermol'ev

    OriginalPaper Pages: 86 - 90

12. Dual method in extremum problems. I

    • B. N. Pshenichnyi

    OriginalPaper Pages: 91 - 99

13. On the problem of estimating the regression coefficients of random fields

    • P. S. Knopov

    OriginalPaper Pages: 100 - 106

14. Letter to the editor

    • L. N. Komzakova

    Letter Pages: 107 - 108

15. Editors' note

    EditorialNotes Pages: 108 - 108