1. Coding and counting spanning trees in Kleitman-Golden graphs

   • L. M. Koganov

   OriginalPaper Pages: 311 - 319

2. A method of constructing minimal failure cuts

   • D. A. Alekseev

   OriginalPaper Pages: 320 - 323

3. Algorithms for minimization of finite acyclic automata and pattern matching in terms

   • S. L. Krivoi

   OriginalPaper Pages: 324 - 331

4. Sufficient conditions of equivalence of three-tape automata

   • V. I. Borisenko

   OriginalPaper Pages: 332 - 339

5. Reliability of solutions obtained by the finite element method

   • I. N. Molchanov

   OriginalPaper Pages: 339 - 349

6. LSI channel routing algorithms

   • S. E. Markosyan
   • G. S. Gasparyan

   OriginalPaper Pages: 349 - 353

7. Disnel: An application package for solving discrete and nonlinear optimization problems

   • V. S. Mikhalevich
   • I. V. Sergienko
   • G. A. Potapchuk

   OriginalPaper Pages: 354 - 366

8. Method for minimizing the total energy of quantum-mechanical systems

   • B. N. Lyashenko

   OriginalPaper Pages: 367 - 376

9. Optimal distribution of a scarce integer resource on a network of arbitrary topology

   • A. I. Ptushkin
   • I. V. Lysenko

   OriginalPaper Pages: 376 - 389

10. Stable symmetric secant methods with restart

    • O. P. Burdakov

    OriginalPaper Pages: 390 - 396

11. Estimation of variable regression parameters as a two-criterion problem

    • A. S. Korkhin

    OriginalPaper Pages: 397 - 407

12. Statistical tests based on training samples

    • I. G. Bairamov
    • Yu. I. Petunin

    OriginalPaper Pages: 408 - 413

13. Fast algorithms for estimating the correlation functions of large signals

    • K. A. Abdikalikov
    • V. K. Zadiraka
    • S. S. Mel'nikova

    OriginalPaper Pages: 414 - 419

14. New exactly solvable examples for controlled discrete-time Markov chains

    • A. B. Piunovskii
    • V. M. Khametov

    OriginalPaper Pages: 420 - 433

15. Design of experiments to detect nonnegligible variables in a linear model

    • A. M. Slin'ko

    OriginalPaper Pages: 433 - 442

16. Analytical method for determining the characteristics of stochastic networks with different classes of messages

    • A. I. Gerasimov

    OriginalPaper Pages: 442 - 449

17. Analytical-statistical estimates for some reliability and efficiency measures of semi-Markov systems

    • V. D. Shpak

    OriginalPaper Pages: 450 - 456

18. Knowledge-based technology for solving complex systems of interrelated problems

    • V. I. Gritsenko
    • V. A. Bogemskii
    • T. M. Kucherenko

    OriginalPaper Pages: 457 - 462

19. A bound on the length of a random derivation-search tree in general multi-premise calculi

    • Yu. N. Kur'erov

    OriginalPaper Pages: 462 - 466

20. A universal logic element over the complex field

    • I. N. Aizenberg

    OriginalPaper Pages: 467 - 473