RUS  ENG
Full version
PEOPLE

Parkhomenko Pavel Pavlovich

Publications in Math-Net.Ru

  1. Indicators, models and methods for analysis and estimation of structures of conceptually connected texts

    Avtomat. i Telemekh., 2018, no. 9,  106–121
  2. Algorithmizing design of a class of combinatorial block diagrams

    Avtomat. i Telemekh., 2016, no. 7,  113–122
  3. Multiple combinatorial block diagrams

    Avtomat. i Telemekh., 2013, no. 6,  121–132
  4. Questionnaires and organizational hierarchies

    Avtomat. i Telemekh., 2010, no. 6,  163–174
  5. Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs

    Avtomat. i Telemekh., 2009, no. 5,  180–189
  6. Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)

    Avtomat. i Telemekh., 2009, no. 2,  153–170
  7. Main results of investigations and development on technical means and automation systems

    Probl. Upr., 2009, no. 3.1,  36–55
  8. On the solution of the traveling salesman problem once again

    Avtomat. i Telemekh., 2006, no. 12,  190–204
  9. Construction of maximum cycles in faulty binary hypercubes

    Avtomat. i Telemekh., 2005, no. 4,  141–155
  10. Shaped lattice graphs as models of the multiprocessor computer systems

    Avtomat. i Telemekh., 2005, no. 3,  169–180
  11. Construction of Hamiltonian Circuits in Cayley Graphs Modeling Multiprocessing Computer Systems

    Avtomat. i Telemekh., 2002, no. 10,  137–153
  12. Classification of the Hamiltonian Cycles in Binary Hypercubes

    Avtomat. i Telemekh., 2001, no. 6,  136–150
  13. Message transmission in defective hypercubes using defect-free subcubes

    Avtomat. i Telemekh., 2000, no. 10,  171–182
  14. Placement of resources of a computing system on a general graph

    Avtomat. i Telemekh., 1999, no. 6,  158–167
  15. Checking multiprocessor computer systems for serviceability by analyzing their syndrome graphs

    Avtomat. i Telemekh., 1999, no. 5,  126–134
  16. Allocation of Resource Copies on Graphs that Simulate Structures of Computer Systems

    Avtomat. i Telemekh., 1997, no. 5,  181–194
  17. On the System Diagnostics of Vertex and Edge Hypercube Structures of Multiprocessor Systems

    Avtomat. i Telemekh., 1996, no. 11,  165–174
  18. Organization of self-diagnosis of discrete multicomponent systems having a bipartite quasicomplete graph structure

    Avtomat. i Telemekh., 1994, no. 5,  109–121
  19. Software diagnosis (survey)

    Avtomat. i Telemekh., 1980, no. 1,  103–121
  20. On design of a test sequence for discrete-time units having memory

    Avtomat. i Telemekh., 1979, no. 5,  167–177
  21. Optimum questionnaires with questions of unequal value

    Dokl. Akad. Nauk SSSR, 184:1 (1969),  51–54
  22. Some problems of checking the performance and locating failures in finite automata

    Dokl. Akad. Nauk SSSR, 161:1 (1965),  59–62

  23. Interstate Seminar “Reliability, Fault-Tolerance, and Performance of Information Systems”

    Avtomat. i Telemekh., 1994, no. 6,  188–189
  24. Sixth All-Union conference on technical diagnostics

    Avtomat. i Telemekh., 1988, no. 12,  168–172
  25. Fifth all-union conference on technical diagnostics

    Avtomat. i Telemekh., 1984, no. 2,  168–173
  26. Fourth All-union conference on technological diagnostics

    Avtomat. i Telemekh., 1980, no. 12,  174–178


© Steklov Math. Inst. of RAS, 2024