|
|
Publications in Math-Net.Ru |
Citations |
|
2018 |
1. |
I. S. Pavlovskii, P. P. Parkhomenko, “Indicators, models and methods for analysis and estimation of structures of conceptually connected texts”, Avtomat. i Telemekh., 2018, no. 9, 106–121 ; Autom. Remote Control, 79:9 (2018), 1630–1642 |
|
2016 |
2. |
P. P. Parkhomenko, “Algorithmizing design of a class of combinatorial block diagrams”, Avtomat. i Telemekh., 2016, no. 7, 113–122 ; Autom. Remote Control, 77:7 (2016), 1216–1224 |
6
|
|
2013 |
3. |
P. P. Parkhomenko, M. F. Karavai, “Multiple combinatorial block diagrams”, Avtomat. i Telemekh., 2013, no. 6, 121–132 ; Autom. Remote Control, 74:6 (2013), 995–1003 |
5
|
|
2010 |
4. |
P. P. Parkhomenko, “Questionnaires and organizational hierarchies”, Avtomat. i Telemekh., 2010, no. 6, 163–174 ; Autom. Remote Control, 71:6 (2010), 1124–1134 |
11
|
|
2009 |
5. |
P. P. Parkhomenko, “Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs”, Avtomat. i Telemekh., 2009, no. 5, 180–189 ; Autom. Remote Control, 70:5 (2009), 907–915 |
1
|
6. |
M. F. Karavai, P. P. Parkhomenko, V. S. Podlazov, “Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)”, Avtomat. i Telemekh., 2009, no. 2, 153–170 ; Autom. Remote Control, 70:2 (2009), 312–327 |
39
|
7. |
P. P. Parkhomenko, A. A. Ambartzumyan, Yu. S. Legovich, “Main results of investigations and development on technical means and automation systems”, Probl. Upr., 2009, no. 3.1, 36–55 |
1
|
|
2006 |
8. |
P. P. Parkhomenko, “On the solution of the traveling salesman problem once again”, Avtomat. i Telemekh., 2006, no. 12, 190–204 ; Autom. Remote Control, 67:12 (2006), 2036–2050 |
|
2005 |
9. |
P. P. Parkhomenko, “Construction of maximum cycles in faulty binary hypercubes”, Avtomat. i Telemekh., 2005, no. 4, 141–155 ; Autom. Remote Control, 66:4 (2005), 633–645 |
4
|
10. |
P. P. Parkhomenko, “Shaped lattice graphs as models of the multiprocessor computer systems”, Avtomat. i Telemekh., 2005, no. 3, 169–180 ; Autom. Remote Control, 66:3 (2005), 492–502 |
3
|
|
2002 |
11. |
P. P. Parkhomenko, “Construction of Hamiltonian Circuits in Cayley Graphs Modeling Multiprocessing Computer Systems”, Avtomat. i Telemekh., 2002, no. 10, 137–153 ; Autom. Remote Control, 63:10 (2002), 1652–1667 |
2
|
|
2001 |
12. |
P. P. Parkhomenko, “Classification of the Hamiltonian Cycles in Binary Hypercubes”, Avtomat. i Telemekh., 2001, no. 6, 136–150 ; Autom. Remote Control, 62:6 (2001), 978–991 |
7
|
|
2000 |
13. |
P. P. Parkhomenko, “Message transmission in defective hypercubes using defect-free subcubes”, Avtomat. i Telemekh., 2000, no. 10, 171–182 ; Autom. Remote Control, 61:10 (2000), 1741–1751 |
|
1999 |
14. |
P. P. Parkhomenko, “Placement of resources of a computing system on a general graph”, Avtomat. i Telemekh., 1999, no. 6, 158–167 |
15. |
P. P. Parkhomenko, “Checking multiprocessor computer systems for serviceability by analyzing their syndrome graphs”, Avtomat. i Telemekh., 1999, no. 5, 126–134 ; Autom. Remote Control, 60:5 (1999), 707–713 |
14
|
|
1997 |
16. |
P. P. Parkhomenko, “Allocation of Resource Copies on Graphs that Simulate Structures of Computer Systems”, Avtomat. i Telemekh., 1997, no. 5, 181–194 ; Autom. Remote Control, 58:5 (1997), 860–870 |
|
1996 |
17. |
P. P. Parkhomenko, “On the System Diagnostics of Vertex and Edge Hypercube Structures of Multiprocessor Systems”, Avtomat. i Telemekh., 1996, no. 11, 165–174 ; Autom. Remote Control, 57:11 (1996), 1668–1675 |
6
|
|
1994 |
18. |
P. P. Parkhomenko, “Organization of self-diagnosis of discrete multicomponent systems having a bipartite quasicomplete graph structure”, Avtomat. i Telemekh., 1994, no. 5, 109–121 ; Autom. Remote Control, 55:5 (1994), 907–915 |
|
1980 |
19. |
P. P. Parkhomenko, P. A. Pravil'shchikov, “Software diagnosis (survey)”, Avtomat. i Telemekh., 1980, no. 1, 103–121 ; Autom. Remote Control, 41:1 (1980), 82–96 |
|
1979 |
20. |
V. V. Karibskii, P. P. Parkhomenko, G. E. Seytova, “On design of a test sequence for discrete-time units having memory”, Avtomat. i Telemekh., 1979, no. 5, 167–177 ; Autom. Remote Control, 40:5 (1979), 764–772 |
|
1969 |
21. |
P. P. Parkhomenko, “Optimum questionnaires with questions of unequal value”, Dokl. Akad. Nauk SSSR, 184:1 (1969), 51–54 |
|
1965 |
22. |
V. V. Karibskii, P. P. Parkhomenko, E. S. Sogomonyan, “Some problems of checking the performance and locating failures in finite automata”, Dokl. Akad. Nauk SSSR, 161:1 (1965), 59–62 |
|
|
|
1994 |
23. |
P. P. Parkhomenko, A. W. Tkachenko, “Interstate Seminar “Reliability, Fault-Tolerance, and Performance of Information Systems””, Avtomat. i Telemekh., 1994, no. 6, 188–189 |
|
1988 |
24. |
G. P. Aksenova, P. P. Parkhomenko, “Sixth All-Union conference on technical diagnostics”, Avtomat. i Telemekh., 1988, no. 12, 168–172 |
|
1984 |
25. |
G. G. Paramonova, P. P. Parkhomenko, “Fifth all-union conference on technical diagnostics”, Avtomat. i Telemekh., 1984, no. 2, 168–173 |
|
1980 |
26. |
I. P. Litikov, P. P. Parkhomenko, “Fourth All-union conference on technological diagnostics”, Avtomat. i Telemekh., 1980, no. 12, 174–178 |
|
Organisations |
|
|
|
|