M. Burgin

COMPLEXITY OF ALGORITHMS AND COMPUTATIONS

Selected Publications

  1. The Generalized Kolmogorov Complexity and Duality in Theory of Computations, Notices of the Academy of Sciences of the USSR, 1982, v. 264, N2, pp. 19-23 (translated from Russian, v.25, N3)

  2.  
  3. Complexity of Parallel Algorithms and Computations, Notices of the Academy of Sciences of the USSR, 1982, v. 265, N2, pp. 268-274 (translated from Russian, v. 26, N1)

  4.  
  5. Generalized Speed-up Theorem for Abstract Complexity Measures, Abstracts of the AMS, 1983, v.4, N1

  6.  
  7. Multiple computations and Kolmogorov complexity for such processes, Notices of the Academy of Sciences of the USSR, 1983, 269 N4 , pp. 793-797 (translated from Russian, v. 27, N2)

  8.  
  9. Complexity measures on systems of parallel algorithms, Programming, 1984, N1, pp. 17-28 (translated from Russian)

  10.  
  11. Methods of program quality evaluation, II International Conference "Software", Kalinin, 1987, pp. 40-42 (in Russian, in collaboration)

  12.  
  13. The Generalized Kolmogorov Complexity and other Dual Complexity Measures, Cybernetics, 1990, N4, pp. 21-29 (translated from Russian)

  14.  
  15. Dual complexity measures and expert system functioning, Problem solving in intellectual computer media, Kiev, 1991, pp. 118-126 (in Russian)

  16.  
  17. Complexity measures in the axiomatic theory of algorithms, Methods of design of applied intellectual program systems, Kiev, 1992, pp. 60-67 ( in Russian )

  18.  
  19. Program engineering and complexity of algorithms,   Engineering of programming tools, Kiev, 1993, pp. 16-17 (in Russian)

  20.  
  21. Duality in the theory of computations, Abstracts presented to the American Mathematical Society, 1981, 2, N4

  22.  
  23. Duality theorem for computable functions, Abstracts presented to the American Mathematical Society, 1981, 2, N5

  24.  
  25. Dual measures for abstract complexities, Abstracts presented to the American Mathematical Society, 1982, 3, N1

  26.  
  27. A correspondence between abstract complexity of computations and size measures of machines, Abstracts presented to the American Mathematical Society, 1982, 3, N4

  28.  
  29. Some properties of GK-complexities of computations, Abstracts presented to the American Mathematical Society, 1982, 3, N6

  30.  
  31. General measures for algorithms, Abstracts presented to the American Mathematical Society, 1983, v.4, N2

  32.  
  33. Recursive correlation for dual complexity measures, Applications of mathematical logic methods, Tallinn, 1983, pp. 126-127     (in Russian)

  34.  
  35. Program quality estimation Based on structural characteristics, International Conference "Software", Kalinin, 1984, pp. 79-81      (in Russian, in collaboration)

  36.  
  37. Quality of the Automated Control System Software, Perspectives of the Automated Control System Development, Kiev, 1984, pp. 58-66    (in Russian, in collaboration)

  38.  
  39. Computational Complexity Measures and Program Quality, Reliability and Quality of Software, Kiev, 1985, pp. 28-30      (in Russian)

  40.  
  41. Program Engineering and Complexity of Algorithms, Engineering of Programming Tools, Kiev, 1993     (in Russian)

  42.  
  43. Time complexity of the reflexive Turing machines, Abstracts presented to the American Mathematical Society, 1993, 14 N1

  44.  
  45. Quantitative estimations of the program quality,   Information retrieval systems and systems of data base management systems,    Kishinev, 1982, pp. 6-8      (in Russian, in collaboration)

  46.  
  47. Estimation of dynamic program characteristics,    Dialogical mode in planning, Kiev, 1982, pp. 91-96    (in Russian, in collaboration)

  48.  
  49. Multidimensional structural analysis of FORTRAN programs,   Control Systems and Machines, 1982, N1, pp. 38-39       (in Russian, in collaboration)