P. P. Parkhomenko

Available identifiers

zbMath Open parkhomenko.p-pWikidataQ23656280 ScholiaQ23656280MaRDI QIDQ329215

List of research outcomes

Publication	Date of Publication	Type
Indicators, models and methods for analysis and estimation of structures of conceptually connected texts	2018-11-05	Paper
Algorithmizing design of a class of combinatorial block diagrams	2016-10-21	Paper
Multiple combinatorial block diagrams	2014-10-15	Paper
Placement of resources of a computing system on a general graph	2013-11-11	Paper
Questionnaires and organizational hierarchies	2011-01-03	Paper
Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs	2010-01-13	Paper
Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)	2009-06-30	Paper
On the solution of the traveling salesman problem once again	2007-06-14	Paper
Shaped lattice graphs as models of the multiprocessor computer systems	2005-08-08	Paper
Construction of maximum cycles in faulty binary hypercubes	2005-08-08	Paper
Classification of the Hamiltonian cycles in binary hypercubes	2005-06-17	Paper
Construction of Hamiltonian circuits in Cayley graphs modeling multiprocessing computer systems	2005-06-17	Paper
Transmission of messages in faulty hypercubes via operational subcubes	2004-10-18	Paper
Placing resource copies on graphs that model the structures of computer systems	1999-07-20	Paper
On systems diagnosis of vertex and edge hypercube structures of multiprocessor systems	1999-05-24	Paper
A compact form of assignment of all nonexcessive paths in a digraph	1996-06-12	Paper
Software diagnosis (review)	1980-01-01	Paper
Design of test sequences for discrete devices with memory	1979-01-01	Paper
Diagnosis of the technical state of discrete devices by the method of determining possible failures	1971-01-01	Paper
Theory of questionnaires (review)	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5616583	1970-01-01	Paper
A method for constructing test programs for devices with memory described by a finite-automaton model	1969-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4401889	1969-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5560672	1967-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5525474	1966-01-01	Paper
Synthesis of switching circuits with various functionally complete systems of logic circuits	1965-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5519899	1965-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5510342	1963-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4751651	1932-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: P. P. Parkhomenko