Skip to main content

Advertisement

SpringerLink
Log in

A review of my scientific publications. Masters and coworkers

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The author reviews his publications doing justice to outstanding mathematicians who were his research supervisors and among which were B. V. Gnedenko, A. N. Kolmogorov, V. S. Mikhalevich, V. S. Korolyuk, and others.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. N. Kovalenko, “Determination of correlation functions of some processes connected with queuing problems,” Dop. AN URSR, No. 5, 480–481 (1958).

  2. I. N. Kovalenko, “On a class of optimal decision functions for a binomial family of distributions,” Teor. Veroyatn. Primen., 4, No. 1, 101–105 (1959).

    MATH  MathSciNet  Google Scholar 

  3. I. M. Kovalenko, “Bayesian decision functions for a hypergeometric set of distributions in choosing between two decisions,” Visn. Kyiv. Un-tu, Ser. Astronomiya, Matematika, ta Mekhanika, 2, No. 1, 159–162 (1959).

    Google Scholar 

  4. I. N. Kovalenko, “On the limit distribution of the value of the first jump,” Teor. Veroyatn. Primen., 5, No. 4, 469–472 (1960).

    MATH  MathSciNet  Google Scholar 

  5. I. N. Kovalenko, “Investigation of a multilinear queuing system with a bounded sojourn time,” Ukr. Mat. Zh., 12, No. 4, 471–476 (1960). (“From the letters received by the Editorial Board,” UMZh, 13, No. 2, 239 (1961)).

    Article  MATH  Google Scholar 

  6. I. N. Kovalenko, “On the reconstruction of the additive type of a distribution from a sequence of series of independent observations,” in: Proc. All-Union Symposium on Probability Theory and Mat. Statistics, Izd-vo AN ArmSSR, Yerevan (1960), pp. 148–159.

  7. I. N. Kovalenko, “Some queuing problems with constraints,” Teor. Veroyatn. Primen., 6, No. 2, 222–228 (1961).

    MathSciNet  Google Scholar 

  8. I. N. Kovalenko, “On the condition of independence of stationary distributions from the form of the distribution law of the service time,” Probl. Peredachi Inf., No. 11, Izd-vo AN SSSR, Moscow (1962), pp. 147–151.

  9. I. N. Kovalenko, “Sur la condition pour que, en régime stationnaire, la distribution soit indépendante des lois des durées de conversation,” Ann. Telecommunications, 17, 190–191 (1962).

    Google Scholar 

  10. I. N. Kovalenko, “A method in queuing theory,” in: Proc. All-Union Seminar on Probability Theory and Mat. Statistics, Gos. Izd-vo Polit. i Nauchn. Liter. LitSSR, Vilnius (1962), pp. 357–358.

  11. I. N. Kovalenko, “Guidelines for investigations in queuing theory,” in: Proc. All-Union Seminar on Probability Theory and Mat. Statistics, Gos. Izd-vo Polit. i Nauchn. Liter. LitSSR, Vilnius (1962), pp. 341–355.

  12. B. V. Gnedenko and I. N. Kovalenko, Lectures on Queuing Theory [in Russian], Nos. 1–3, KVIRTU, Kiev (1963).

  13. I. N. Kovalenko, “On the construction of Boolean functions of high complexity with the help of the Monte Carlo method,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 4, 77–80 (1964).

  14. I. N. Kovalenko, “Some questions of the theory of reliability of complex systems,” in: Cybernetics in the Service of Communism, 2, Energiya, Moscow (1964), pp. 194–205.

  15. I. N. Kovalenko, “Some analytical methods in queuing theory,” in: Cybernetics in the Service of Communism, 2, Energiya, Moscow (1964), pp. 325–338.

  16. P. I. Vasil’ev and I. N. Kovalenko, “Remark on stationary arrival processes,” Ukr. Mat. Zh., 16, No. 3, 374–375 (1964).

    Article  MATH  MathSciNet  Google Scholar 

  17. I. N. Kovalenko, “On some classes of complex systems. I,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 6, 3–7 (1964).

  18. I. N. Kovalenko, “On some classes of complex systems. II,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 1, 14–20 (1965).

  19. I. N. Kovalenko, “On some classes of complex systems. III,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 3, 3–11 (1965).

  20. I. N. Kovalenko, “Queuing Theory,” in: Itogi Nauki, Ser. Teor. Veroyatn., Mat. Stat. (1963), Inst. Nauchn. Inf. Akad. Nauk SSSR (1965), pp. 73–125.

  21. I. N. Kovalenko, “On a limit theorem for determinants in the class of Boolean functions,” Dokl. Akad. Nauk SSSR, 161, No. 3, 517–519 (1965).

    MathSciNet  Google Scholar 

  22. I. N. Kovalenko, “On recovering the characteristics of a system from observations of the outgoing flow,” Dokl. Akad. Nauk SSSR, 164, No. 5, 979–981 (1965).

    Google Scholar 

  23. I. N. Kovalenko, “On a class of limit distributions for sequences of series of sums of independent renewal processes,” Lit. Mat. Sb., 5, No. 4, 561–567 (1965).

    MATH  MathSciNet  Google Scholar 

  24. I. N. Kovalenko, “On a class of limit distributions for thinning arrival processes,” Lit. Mat. Sb., 5, No. 4, 569–573 (1965).

    MATH  MathSciNet  Google Scholar 

  25. I. N. Kovalenko, “A remark on the complexity of representing events in probabilistic and deterministic automata,” Cybernetics, No. 2, 35–36 (1965).

    MathSciNet  Google Scholar 

  26. I. N. Kovalenko, “Evaluation of the reliability of complex systems,” Voprosy Radioelektroniki, 12, No. 9, 50–68 (1965).

    Google Scholar 

  27. B. V. Gnedenko and I. N. Kovalenko, Introduction to Queuing Theory [in Russian], Nauka, Moscow (1966).

    Google Scholar 

  28. I. N. Kovalenko, “Statistical characterization of symmetric stable distribution laws,” Dokl. Akad. Nauk SSSR, 170, No. 1, 31–33 (1966).

    MathSciNet  Google Scholar 

  29. I. N. Kovalenko, “An asymptotic method for estimating the reliability of complex systems,” in: On Reliability of Complex Technical Systems, Sov. Radio, Moscow (1966), pp. 205–223.

  30. I. N. Kovalenko, “Some new lines of investigations in queuing theory,” in: J. Riordan, Probabilistic Queuing Systems, Svyaz’, Moscow (1966), pp. 3–20.

  31. B. V. Gnedenko, Yu. K. Belyaev, and I. N. Kovalenko, “Mathematical problems of queuing theory,” in: Itogi Nauki, Ser. Teor. Veroyatn., Mat. Stat., Teor. Kibern. (1964), VINITI Akad. Nauk SSSR, Moscow (1966), pp. 7–53.

  32. I. N. Kovalenko, “On the limit distribution of the number of solutions of a random system of linear equations in the class of Boolean functions,” Teor. Veroyatn. Primen. 12, No. 1, 51–61 (1967).

    MathSciNet  Google Scholar 

  33. I. N. Kovalenko, “Application of queuing theory to the analysis and synthesis of large-scale automatic control systems,” in: Modern Methods for the Design of Automatic Control Systems, Mashinostroenie, Moscow (1967), pp. 639–657.

  34. B. V. Gnedenko and I. N. Kovalenko, “Some problems of queuing theory,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 5, 88–100 (1967).

  35. B. V. Gnedenko and I. N. Kovalenko, Introduction to Queuing Theory, Isr. Program for Sci. Transl., Jerusalem (1968).

  36. I. N. Kovalenko, “A problem of optimal information processing in a queuing system,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 5, 75–79 (1968).

  37. N. P. Buslenko and I. N. Kovalenko, “Mathematical description of elements of complex systems,” Dokl. Akad. Nauk SSSR, 187, No. 10, 1222–1224 (1969).

    MathSciNet  Google Scholar 

  38. I. N. Kovalenko, V. A. Ivnitskii, and N. I. Sukhanova, “Some practical methods for formation of multidimensional random numbers uniformly distributed within a polytope,” in: Proc. of the Seminar “Complex Systems and Simulation,” 1, Cybernetics Institute of NAS of Ukraine, Kiev (1969), pp. 3–14.

  39. I. N. Kovalenko and O. M. Yurkevich, “New results in the theory of queuing systems with constraints,” Teor. Veroyatn. Mat. Stat., No. 2, 98–103 (1970).

  40. I. N. Kovalenko, “Queuing theory,” in: Itogi Nauki, Ser. Teor. Veroyatn., Mat. Stat., Teor. Kibern. (1970), VINITI Akad. Nauk SSSR, Moscow (1971), pp. 5–109.

  41. I. N. Kovalenko, “About a queuing system with the service rate dependent on the number of requests in the system and periodic channel disconnection,” Probl. Peredachi Inf., 7, No. 2, 106–111 (1971).

    MATH  MathSciNet  Google Scholar 

  42. I. N. Kovalenko, “Calculating the probability of uniqueness of the solution of a system of random nonlinear Boolean equations,” Cybernetics, No. 3, 401–405 (1971).

  43. I. N. Kovalenko, “Theory of random graphs,” Cybernetics, No. 4, 575–579 (1971).

  44. I. N. Kovalenko and O. M. Yurkevich, “Some questions of optimal request servicing in systems with bounded waiting time,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 1, 26–35 (1971).

  45. E. Yu. Barzilovich, V. A. Kashtanov, and I. N. Kovalenko, “On minimax criteria in reliability problems,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 3, 87–98 (1971).

  46. B. V. Gnedenko and I. N. Kovalenko, “Application of queuing theory to problems of large-scale systems,” in: Sci. and Pract. Problems of Large-Scale Systems, Nauka, Moscow (1971), pp. 105–122.

  47. I. N. Kovalenko, “On the distribution of the linear rank of a random matrix,” Teor. Veroyatn. Primen., 17, No. 2, 354–359 (1972).

    MathSciNet  Google Scholar 

  48. I. N. Kovalenko, “The structure of a random oriented graph,” Teor. Veroyatn. Mat. Stat., No. 6, 83–91 (1972).

  49. I. N. Kovalenko and V. D. Shpak, “Probabilistic characteristics of complex systems with hierarchical control,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 6, 30–34 (1972).

    Google Scholar 

  50. I. N. Kovalenko and O. M. Yurkevich, “A queuing system with simultaneously arriving impatient customers,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. l, 52–56 (1972).

  51. N. P. Buslenko, V. V. Kalashnikov, and I. N. Kovalenko, Lectures on the Theory of Complex Systems [in Russian], Sov. Radio, Moscow (1973).

    Google Scholar 

  52. I. N. Kovalenko and A. A. Filippova, Probability Theory and Mathematical Statistics: A Textbook [in Russian], Vyssh. Shkola, Moscow (1973).

    Google Scholar 

  53. I. N. Kovalenko, G. K. Moskatov, and E. Yu. Barzilovich, “Semi-Markov models in problems of the design of aircraft control systems,” Mashinostroenie, Moscow (1973).

    Google Scholar 

  54. I. N. Kovalenko, “Deviation of the reliability of a standby system with a general repair-time distribution from the reliability of a system with exponential repair-time,” Cybernetics, No. 5, 759–765 (1973).

  55. I. M. Kovalenko, “Algorithm for asymptotic analysis of the sojourn time of a Markov chain in a set of states,” Dop. AN URSR, Ser. A, No. 6, 497–500 (1973).

  56. I. N. Kovalenko, “On a problem of optimal control over a renewal process,” in: Controlled Random Processes and Systems, Cybernetics Institute of NAS of Ukraine, Kiev (1973), pp. 176–187.

  57. B.W. Gnedenko and I. N. Kovalenko, Einfuhrung in die Bedienungstheorie, Akademie-Verlag, Berlin (1974).

    Google Scholar 

  58. I. N. Kovalenko, “Algorithmization of solution of problems of queuing theory and reliability theory,” in: Algorithmic Methods in Reliability Theory, Cybernetics Insitute of AS of Ukraine, Kiev (1974), pp. 3–13.

  59. I. N. Kovalenko and E. M. Musaev, “Reliability of complex systems subjected to periodic perturbations,” Cybernetics, No. 3, 477–482 (1974).

  60. I. N. Kovalenko and L. S. Stoikova, “On the productivity of a system and the problem-solving time in the presence of random failures and periodic memorization of the results,” Cybernetics, No. 5, 820–823 (1974).

  61. I. N. Kovalenko, Investigations of Complex Systems Reliability [in Russian], Naukova Dumka, Kiev (1975).

    Google Scholar 

  62. I. N. Kovalenko, “ Invariance theorems for random Boolean matrices,” Cybernetics, No. 5, 818–834 (1975).

  63. I. N. Kovalenko, “Some lines of investigations in queuing theory,” in: Mathematization of Knowledge and Scientific and Technological Advance, Naukova Dumka, Kiev (1975), pp. 66–78.

  64. I. N. Kovalenko and A. A. Levitskaya, “Limit behavior of the number of solutions of a system of random linear equations over a finite field and a finite ring,” Dokl. Akad. Nauk SSSR, 221, No. 4, 778–781 (1975).

    MathSciNet  Google Scholar 

  65. I. N. Kovalenko and A. A. Levitskaya, “Limit behavior of the number of solutions of a system of random linear equations over a finite field and a finite ring,” Teor. Veroyatn. Mat. Stat., No. 13, 70–83 (1975).

    Google Scholar 

  66. I. N. Kovalenko, “Analyticostatistical method for calculating the characteristics of highly reliable systems,” Cybernetics, No. 6, 895–907 (1976).

  67. I. M. Kovalenko, “On the probability of consistency of one class of random logical equations,” Dop. NAN Ukrainy, Ser. A, No. 8, 681–685 (1976).

  68. I. N. Kovalenko and F. S. Payanov, “Control optimization in variable-regime systems,” Cybernetics, No. 2, 299–302 (1976).

  69. I. N. Kovalenko, “Exact estimates for characteristics of an enlarged process: A class of random processes invariant with respect to state enlargement,” in: B. V. Gnedenko, Yu. I. Gromak, and Ye. V. Chepurin (eds.), Queuing Theory, Proc. IIIth All-Union Seminar Meeting on Queuing Theory, Izd-vo Mosk. Un-ta, Moscow (1976), pp. 115–118.

  70. I. N. Kovalenko, “Limit theorems for reliability theory,” Cybernetics, No. 6, 902–914 (1977).

  71. I. N. Kovalenko and N. N. Leonenko, “Calculating the reliability of branching structures,” in: Methods of Operations Research and Reliability Theory in Analyzing Systems, Cybernetics Institute of AS of UkrSSR, Kiev (1977), pp. 3–8.

  72. I. N. Kovalenko and O. V. Sarmanov, A Brief Course in the Theory of Random Processes [in Russian], Vyshcha Shkola, Kiev (1978).

    Google Scholar 

  73. I. N. Kovalenko, Analysis of Rare Events in Estimating the Efficiency and Reliability of Systems [in Russian], Sov. Radio, Moscow (1980).

    MATH  Google Scholar 

  74. I. N. Kovalenko, “Calculation of characteristics of highly reliable systems by the analytical-statistical method,” Elektronnoe Modelirovanie, 2, No. 4, 5–8 (1980).

    Google Scholar 

  75. I. N. Kovalenko, “Asymptotic state enlargement for random processes,” Cybernetics, No. 6, 876–885 (1980).

  76. I. N. Kovalenko and N. Yu. Kuznetsov, “Constructing an embedded renewal process for essentially multidimensional queuing processes and its application to deriving limit theorems,” Prepr. No. 80–12, Cybernetics Institute of AS of Ukraine, Kiev (1980).

  77. Yu. A. Mitropolskii, V. S. Korolyuk, V. S. Mikhalevich, and I. N. Kovalenko, “Works of A. V. Skorokhod on the theory of random processes,” Ukr. Mat. Zh., 32, No. 4, 523–527 (1980).

    MathSciNet  Google Scholar 

  78. I. N. Kovalenko and N.Yu. Kuznetsov, “Renewal process and rare events limit theorems for essentially multidimensional queuing processes,” Math. Operationsforsch. und Statist., 12, No. 2, 211–224 (1981).

    MATH  MathSciNet  Google Scholar 

  79. I. N. Kovalenko, “On the boundedness of the average sojourn time of a request in a queuing system with a bounded queue,” in: Proc. of the Seminar “Probl. of Stability of Stochastic Models,” VNIISI, Moscow (1981), pp. 66–70.

  80. I. N. Kovalenko, “Remarks on the construction of an embedded renewal process for essentially multidimensional processes of queuing theory,” in: Proc. of the Seminar “Queuing theory,” VNIISI, Moscow (1981), pp. 95–101.

  81. I. N. Kovalenko, Calculation of Probabilistic Characteristics of Systems [in Russian], Tekhnika, Kiev (1982).

    MATH  Google Scholar 

  82. I. N. Kovalenko and A. A. Filippova, Probability Theory and Mathematical Statistics: A Textbook [in Russian], 2nd Edition, Vyssh. Shkola, Moscow (1973).

    Google Scholar 

  83. G. I. Ivchenko, V. A. Kashtanov, and I. N. Kovalenko, Queuing Theory [in Russian], Vysh. Shkola, Moscow (1982).

    Google Scholar 

  84. I. N. Kovalenko, N. Yu. Kuznetsov, and V. M. Shurenkov, Random Processes: A Handbook [in Russian], Naukova Dumka, Kiev (1983).

    Google Scholar 

  85. E. Yu. Barzilovich, Yu. K. Belyaev, V. A. Kashtanov, I. N. Kovalenko, A. D. Solov’ev, and I. A. Ushakov, Topics of Mathematical Reliability Theory [in Russian], Radio i Svyaz’, Moscow (1983).

    Google Scholar 

  86. I. N. Kowalenko, “Bedienungssysteme mit Zeitbeschrankungen,” in: B.W. Gnedenko and D. König (eds.), Handbuch der Bedienungstheorie, Formeln und andere Ergebnisse, Akad. Verlag, Berlin (1984), pp. 256–273.

    Google Scholar 

  87. I. N. Kovalenko and N. Yu. Kuznetsov, “Asymptotic insensitivity of queuing systems,” in: P. Franken, D. König, U. Arndt, and V. Schmidt, Queues and Point Processes, Naukova Dumka, Kiev (1984), pp. 250–270.

  88. I. N. Kovalenko, A. A. Levitskaya, and V. N. Savchuk, Selected Problems of Probabilistic Combinatorics [in Russian], Naukova Dumka, Kiev (1986).

    Google Scholar 

  89. I. N. Kovalenko, “Calculating corrections to characteristics of queuing systems,” in: Proc. of the Seminar “Problems of Stability of Stochastic Models,” VNIISI, Moscow (1986), pp. 45–48.

  90. I. N. Kovalenko, “On A. D. Solov’ev’s problem from the reliability theory of restorable systems,” Cybernetics, No. 4, 111–112 (1986).

  91. I. N. Kovalenko and N. Yu. Kuznetsov, “The principle of monotone refusals and its application to the calculation of reliability characteristics of structurally complex systems,” in: Stochastic Models of Systems, Military Academy of Air Defense of Ground Forces, Kiev (1986), pp. 25–45.

  92. I. N. Kovalenko and L. S. Stoikova, “On some extremal problems of reliability theory,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 6, 19–23 (1986).

    Google Scholar 

  93. B. V. Gnedenko and I. N. Kovalenko, Introduction to Queuing Theory [in Russian], Nauka, Moscow (1987).

    Google Scholar 

  94. I. N. Kovalenko, V. G. Krivutsa, and N. Yu. Kuznetsov, “Test of the practical application of statistical modeling methods in reliability theory,” Cybernetics, No. 5, 707–715 (1987).

  95. I. N. Kovalenko, N. Yu. Kuznetsov, and V. G. Krivutsa, “A method of statistical simulation (the Monte Carlo method),” in: Reliability and Efficiency in Engineering, 2, Mashinostroenie, Moscow (1987), pp. 208–250.

  96. I. N. Kovalenko and N. Yu. Kuznetsov, Methods of Calculation of Highly Reliable Systems [in Russian], Radio i Svayz’, Moscow (1988).

    Google Scholar 

  97. I. N. Kovalenko, “On an algorithm of subexponential complexity for decoding strongly corrupted linear codes,” Dokl. AN UkrSSR, Ser. A, No. 10, 16–17 (1988).

  98. I. M. Kovalenko and V. P. Gorbulin, “Methodological problems of reliability and safety of modern technical systems,” Visn. Akad. Nauk URSR, No. 11, 19–24 (1988).

  99. I. N. Kovalenko, N. Yu. Kuznetsov, and A. N. Nakonechnyi, “Optimization of reliability characteristics of systems on the basis of quantitative estimates of continuity and fast simulation methods,” in: Proc. of the Seminar “Problems of Stability of Stochastic Models,” VNIISI, Moscow (1988), pp. 79–84.

  100. I. N. Kovalenko, Probabilistic Calculation and Optimization [in Russian], Naukova Dumka, Kiev (1989).

    MATH  Google Scholar 

  101. Gnedenko B.V. and I. N. Kovalenko, Introduction to Queuing Theory, Birkhauser, Boston (1989).

  102. I. N. Kowalenko, N. J. Kuzniecow, and W. M. Szurienkow, Procesy stochastyczne: Poradnik, Panstw. Wydaw. Nauk., Warszawa (1989).

  103. I. N. Kovalenko and A. N. Nakonechnyi, Approximate Calculation and Optimization of Reliability [in Russian], Naukova Dumka, Kiev (1989).

    MATH  Google Scholar 

  104. I. N. Kovalenko and N. Yu. Kuznetsov, “Methods for fast simulation of characteristics of highly reliable systems,” in: Statistics and Control of Random Processes, Nauka, Moscow (1989), pp. 77–86.

  105. I. N. Kovalenko and B. V. Gnedenko, Probability Theory [in Russian], Vyshcha Shkola, Kiev (1990).

    Google Scholar 

  106. I. N. Kovalenko and A. N. Nakonechny, “On an approach to the tabulation of distribution functions of additive functionals of a Wiener process,” Dop. NAN Ukrainy, Ser. A, No. 6, 28–31 (1992).

  107. I. N. Kovalenko and A. A. Levitskaya, “Probabilistic properties of systems of random linear equations over finite algebraic structures,” Cybernetics and Systems Analysis, No. 3, 385–390 (1993).

  108. I. N. Kovalenko and A. A. Levitskaya, “Stochastic properties of systems of random linear equations over finite algebraic structures,” in: V. F Kolchin, V. Ya. Kozlov, Yu. L. Pavlov, and Yu. K. Prokhorov (eds.), Probabilistic Methods of Discrete Mathematics, TVP, Moscow (1993), pp. 64–70.

  109. I. N. Kovalenko and A. N. Nakonechnyi, “Approximation of distribution functions of additive functional of Wiener process by a segment of Chebyshev series,” Cybernetics and Systems Analysis, No. 4, 613–617 (1993).

  110. A. Birolini, A. I. Kochubinsky, and I. N. Kovalenko, “Some bounds and numerical results on renewal and alternating renewal processes,” Dop. NAN Ukrainy, Ser. A, No. 10, 25–31 (1993).

  111. I. N. Kovalenko and A. A. Levitskaya, “Invariance theory for nonlinear systems of equations over the field GF(2),” in: Proc. Symp. “Problems of Optimization of Computations,” Kyiv (1993), pp. 78–90.

  112. I. N. Kovalenko, “Rare events in queuing systems: A survey,” Queuing Systems, 16, No. 1, 1–49 (1994).

    Article  MATH  MathSciNet  Google Scholar 

  113. I. N. Kovalenko, “A nonregenerative model of a redundant repairable system: Bounds for the unavailability and asymptotic insensitivity to lifetime distribution,” J. Appl. Math. Stochast. Anal., 9, No. 1, 1–49 (1994).

    MathSciNet  Google Scholar 

  114. I. N. Kovalenko and J. B. Atkinson, “On the calculation of steady-state loss probabilities in the GI/G/2/0 queue,” J. Appl. Math. Stochast. Anal., 9, No. 3, 397–410 (1994).

    Article  MathSciNet  Google Scholar 

  115. I. N. Kovalenko, “Approximation of queues via small parameter method,” Advances in Queuing,” in: J. H. Dshalalow (ed.), CRC Press, Boca Raton (1995), pp. 481–506.

    Google Scholar 

  116. C. Cooper and I. M. Kovalenko, “Upper bound for the number of complete mappings,” Teor. Imovirn. Mat. Stat., No. 53, 69–75 (1995).

  117. I. N. Kovalenko, N. Yu. Kuznetsov, and V. M. Shurenkov, Models of Random Processes: A Handbook for Mathematicians and Engineers, CRC Press, New York (1996).

    MATH  Google Scholar 

  118. I. N. Kovalenko, “A non-regenerative model of a redundant repairable system: Bounds for the unavailability and asymptotical insensitivity to the lifetime distribution,” J. Appl. Math. Stochast. Anal., 9, No. 2, 97–105 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  119. I. N. Kovalenko, “Upper bound on the number of complete maps,” Cybernetics and Systems Analysis, No. 1, 65–68 (1996).

    Article  MathSciNet  Google Scholar 

  120. I. N. Kovalenko, “Reliability analysis via corrections,” Reliability and Maintenance of Complex Systems, Proc. of the NATO ASI on Current Issues and Challenges in the Reliability and Maintenance of Complex Systems, NATO ASI Ser., Ser. F, Comput. Syst. Sci., 154, Springer, Berlin (1996), pp. 97–106.

  121. I. N. Kovalenko, “On bounds for the pointwise availability of a repairable component,” Fundam. Prikl. Mat., 2, No. 4, 1101–1105 (1996).

    MATH  MathSciNet  Google Scholar 

  122. I. N. Kovalenko, A. N. Nakonechnyi, and A. B. Romanov, “Chebyshev approximation of the distribution function of nonnegative random quantities,” Cybernetics and Systems Analysis, No. 2, 211–218 (1996).

    Article  MathSciNet  Google Scholar 

  123. I. N. Kovalenko, “In memoriam: Boris Vladimirovich Gnedenko (January 1, 1912–December 27, 1995),” J. Appl. Math. Stochast. Anal., 9, No. 1, 95–96 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  124. I. N. Kovalenko and V. N. Savchuk, “Some statistical algorithms for decoding heavily corrupted linear codes,” in: Proc. Intern. Sci.-Pract. Conf. “Information Security in Computer Systems and Communication,” Kyiv (1996), p. 39.

  125. I. N. Kovalenko, N. Yu. Kuznetsov, and Ph. A. Pegg, Mathematical Theory of Reliability of Time Dependent Systems with Practical Applications, Wiley, Chichester (1997).

    MATH  Google Scholar 

  126. I. N. Kovalenko, “Ergodic and light-traffic properties of a complex repairable system,” Math. Methods Oper. Res., 45, No. 3, 387–409 (1997).

    Article  MATH  MathSciNet  Google Scholar 

  127. I. N. Kovalenko, “Proof of David Kendall’s conjecture concerning the shape of large random polygons,” Cybernetics and Systems Analysis, No. 4, 461–467 (1997).

  128. I. N. Kovalenko, “A survey of works of B. V. Gnedenko in mathematical statistics and queuing and reliability theories,” Teor. Imovirn. Mat. Statist., No. 56, 10–19 (1997).

  129. I. N. Kovalenko, “On certain random polygons of large areas,” J. Appl. Math. Stochast. Anal., 11, No. 3, 369–376 (1998).

    Article  MATH  MathSciNet  Google Scholar 

  130. I. M. Kovalenko, “On Burtin’s lemma from the theory of random mappings and on the probability of non-coincidence of keys,” U Sviti Mat. 4, No.3, 13–16 (1998).

    MATH  MathSciNet  Google Scholar 

  131. I. N. Kovalenko, A. Birolini, N.Yu. Kuznetsov, and M. Schoenbucher, “Reducing the phase space of a stochastic process in system reliability analysis,” Cybernetics and Systems Analysis, No. 4, 588–595 (1998).

  132. I. N. Kovalenko, “An extension of a conjecture of D. G. Kendall concerning shapes of large random polygons to Poisson Voronoi cells,” in: P. Engel and H. Syta (eds.), Vorono¿’s Impact of Modern Science, Book I, Inst. of Mathematics, Kyiv (1998), pp. 266–274.

  133. I. N. Kovalenko, “A simplified proof of a conjecture of D. G. Kendall concerning shapes of random polygons,” J. Appl. Math. Stochast. Anal. 12, No. 4, 301–310 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  134. I. N. Kovalenko and N. Yu. Kuznetsov, “Analysis of the deviation of the nonstationary availability factor of a restorable system from its stationary value,” Cybernetics and Systems Analysis, No. 2, 240–252 (1999).

  135. I. N. Kovalenko and M. N. Savchuk, “Some methods of decoding corrupted linear codes,” Reyestr., Zberig., i Obrobka Danykh, 1, No. 2, 62–68 (1999).

    Google Scholar 

  136. I. N. Kovalenko and M. N. Savchuk, “On a statistical algorithm to decode heavily corrupted linear codes,” Applied Probability and Stochastic Processes, Kluwer, Berkeley (1999), pp. 73–82.

  137. J. B. Atkinson, I. N. Kovalenko, “On the practical insensitivity of the availability of some redundant repairable systems to the lifetime distribution in light traffic,” Probabilistic Analysis of Rare Events: Theory and Problems of Safety, Insurance and Ruin, Riga Aviation Univ., Riga (1999), pp. 83–91.

  138. C. Cooper, R. Gilchrist, I. N. Kovalenko, and D. Novakovic, “Estimation of the number of “good” permutations with applications to cryptography,” Cybernetics and Systems Analysis, No. 5, 10–16 (1999).

  139. I. N. Kovalenko, “Some limit theorems concerning random polygons of large areas,” in: Proc. 3rd Ukr.-Scand. Conf. in Probability Theory and Mathematical Statistics, Kyiv (1999), p. 70.

  140. I. N. Kovalenko and M. N. Savchuk, “About some methods of decoding corrupted linear codes,” in: Proc. 3rd Ukr.-Scand. Conf. in Probability Theory and Mathematical Statistics, Kyiv (1999), p. 71.

  141. I. N. Kovalenko, “Estimation of the intensity of the flow of non-monotone refusals in the queuing system (≤λ)/G/m, Ukr. Mat. Zh., 52, No. 9, 1219–1225 (2000).

    MATH  MathSciNet  Google Scholar 

  142. R. Gilchrist and I. N. Kovalenko, “On estimation of the probability of absence of collisions of some random mappings,” Cybernetics and Systems Analysis, No. 1, 102–107 (2000).

  143. E. V. Koba and I. N. Kovalenko, “On a two-sided bound for the distribution of orbit cycles of a customer in a retrial queuing system,” Dop. NAN Ukrainy, No. 9, 109–112 (2000).

  144. I. N. Kovalenko, “Light traffic analysis of complex system reliability: Non-regenerative model,” DeuxiÙme Conf. Intern. sur les Méthodes Mathématiques en Fiabilité. Méthodologie, 2, Pratique et Inférence, Bordeaux (2000), 634–637.

  145. J. B. Atkinson and I. N. Kovalenko, “A numerical investigation of the insensitivity of the unavailability of some redundant, repairable systems to the form of the lifetime distribution,” Deuxiéme Conf. Intern. sur les Méthodes Mathématiques en Fiabilité. Méthodologie, 1, Pratique et Inférence, Bordeaux (2000), pp.119–122.

  146. I. M. Kovalenko, V. S. Korolyuk, M. I. Portenko, A. M. Samoilenko, G. M. Sita, and M. I. Yadrenko, “Anatolii Volodymyrovych Skorokhod (on his 70th birthday),” Ukr. Mat. Zh., 52, No. 9, 1155–1157 (2000).

    MATH  MathSciNet  Google Scholar 

  147. I. N. Kovalenko, “The loss probability in an M/G/m queuing system with T-retrials in light traffic,” Dop. NAN Ukrainy, Ser. A, No. 5, 77–80 (2002).

  148. I. N. Kovalenko and J. B. Atkinson, “Conditions for the light traffic insensitivity of the loss probability in a GI/G/m/0 queuing system,” Cybernetics and Systems Analysis, No. 6, 846–854 (2002).

  149. I. N. Kovalenko and E. V. Koba, “Three types of a retrial queuing system resembling some peculiarities of planes landing process,” Probl. Upravlen. Inf., No. 2, 78–82 (2002).

  150. I. N. Kovalenko, “The loss probability in an M/G/M retrial queuing system with T-returns of calls in light traffic,” Intern. Gnedenko Conf., Kyiv (2002), p. 52.

  151. D. Baum and I. N. Kovalenko, “On graph models for communicating mobiles in access areas,” Intern. Gnedenko Conf., Kyiv (2002), p. 38.

  152. D. Baum and I. N. Kovalenko, “Graph models for communication of mobile users in access areas,” Cybernetics and Systems Analysis, No. 5, 716–727 (2003).

  153. I. N. Kovalenko, J. B. Atkinson, and K. V. Mykhalevych, “Three cases of light traffic insensitivity of the loss probability in a GI/G/m/0 loss system to the shape of the service time distribution,” Queuing Systems, 45, No. 3, 245–271 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  154. I. N. Kovalenko and A. I. Kochubinsky, “Asymmetric cryptographic algorithms,” Cybernetics and Systems Analysis, No. 4, 549–554 (2003).

  155. D. Baum and I. N. Kovalenko, “An estimate for loss probability in a MAP/G/m/0 queuing system in light traffic,” Teor. Imovirn. Mat. Stat., No. 71, 15–21 (2004).

    Google Scholar 

  156. D. Baum and I. N. Kovalenko, “Averaging properties of a Cox/G/m/0 loss system,” Random Oper. and Stoch. Equ., 12, No.3, 225–234 (2004).

    Article  MATH  MathSciNet  Google Scholar 

  157. O. V. Koba and I. M. Kovalenko, “The ergodicity condition for a M/G/1 retrial queuing system with a non-lattice distribution of a cycle on an orbit,” Dop. NAN Ukrainy, Ser. A, No. 8, 70–77 (2004).

  158. B. V. Gnedenko and I. N. Kovalenko, Introduction to Queuing Theory [in Russian], KomKniga, Moscow (2005).

    Google Scholar 

  159. J. B. Atkinson, I. N. Kovalenko, N. Yu. Kuznetsov, and K. V. Mikhalevich, “Heuristic Methods for the Analysis of a Queuing System Describing Emergency Medical Service Deployed along a Highway,” Cybernetics and Systems Analysis, No. 3, 379–391 (2006).

  160. I. N. Kovalenko, “After a lapse of fifty years,” in: D. B. Gnedenko (ed.), Boris Vladimirovich Gnedenko in Reminiscences of His Disciples and Colleagues, KomKniga, Moscow (2006), pp. 59–67.

  161. V. S. Korolyuk, I. N. Kovalenko, M. I. Yadrenko, and D. B. Gnedenko, “A brief essay on the life and creative activities of B. V. Gnedenko,” KomKniga, Moscow (2006), pp. 9–17.

  162. B. V. Gnedenko and I. N. Kovalenko, Introduction to Queuing Theory [in Russian], LKI, Moscow (2007).

    Google Scholar 

  163. E. V. Koba and I. N. Kovalenko, “Ergodicity condition for a system with queuing and servicing of objects with a complicated structure,” Cybernetics and Systems Analysis, No. 5, 625–628 (2007).

  164. I. N. Kovalenko and A. N. Butochnov, “Estimation of reliability of highly reliable systems with allowance for spare parts, tools, and accessories,” Reyestr., Zberig., i Obrobka Danykh, 9, No. 3, 117–128 (2007).

    Google Scholar 

  165. I. N. Kovalenko, “Light-traffic analysis of some queuing models with losses,” in: P.S. Knopov and P.M. Pardalos (eds.), Simulation and Optimization Methods in Risk and Reliability Theory, Nova Sci. Publ., New York (2008).

  166. I. N. Kovalenko and E. V. Koba, “On the classification of retrial queuing systems,” Cybernetics and Systems Analysis, No. 3, 420–425 (2010).

  167. I. N. Kovalenko, “A review of my scientific publications. Masters and coworkers,” Cybernetics and Systems Analysis, No. 3, 339–362 (2010).

  168. J. B. Atkinson and I. N. Kovalenko, “Some light-traffic and heavy-traffic results for the GI G n / / / 0 queue using the GM Heuristic,” Cybernetics and Systems Analysis, No. 3, 426–435 (2010).

  169. I. N. Kovalenko, “Investigation of highly reliable systems in B. V. Gnedenko’s school of probability,” Avtomat. Telemekh., No. 7 (2010).

Download references

Author information

Authors and Affiliations

  1. Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine

    I. N. Kovalenko

Authors
  1. I. N. Kovalenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. N. Kovalenko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 3–27, May–June 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kovalenko, I.N. A review of my scientific publications. Masters and coworkers. Cybern Syst Anal 46, 339–362 (2010). https://doi.org/10.1007/s10559-010-9211-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9211-4

Keywords

Search

Navigation