Главная Промышленная автоматика.

71. Lueker, G. S. (1980). Some techniques for solving recurrences, Computing Surveys, 12:4, pp. 419-436.

72. Lum, v., and H. Ling (1970). Multi-attribute retrieval with combined indices, Comm. ACM 13:11, pp. 660-665.

73. Maurer, W. D., and T. G. Lewis (1975). Hash table methods, Computing Surveys 7:1, pp. 5-20.

74. McCarthy, J. et al. (1965). LISP 1.5 Programmers Manual. MIT Press, Cambridge, Mass.

75. Micali, S., and V. V. Vazirani (1980). An O(.0~\\E\) algorithm for finding

maximum matching in general graphs, Proc. IEEE Twenty-first Annual Symp. on Foundations of Computer Science, pp. 17-27.

76. Moenck, R., and A. B. Borodin (1972). Fast modular transforms via division, Proc. IEEE Thirteenth Annual Symp. on Switching and Automata Theory, pp. 90-96.

77. Morris, F. L. (1978). A time- and space-efficient garbage compaction algorithm, Comm. ACM21:8, pp. 662-665.

78. Morris, R. (1968). Scatter storage techniques. Comm. ACM 11:1, pp. 35-44.

79. Moyles, D. M., and G. L. Thompson (1969). Finding a minimum equivalent graph of a digraph, /. ACM 16:3, pp. 455-460.

80. NichoUs, J. E. (1975). The Structure and Design of Programming Languages, Addison-Wesley, Reading, Mass.

81. Nievergelt, J. (1974). Binary search trees and file organization, Computer Surveys 6:3, pp. 195-207.

82. Papadimitriou, C. H., and K. Steiglitz (1982). Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, N. J. (Русский перевод: Пападимитриу X., Стайглиц К. Комбинаторная оптимизация. Алгоритмы и сложность. - М., "Мир", 1985.)

83. Parker, D. S. Jn (1980). Conditions for optimality of the Huffman algorithm, SIAMJ. Computing 9:3, pp. 470-489.

84. Perl, Y., A. Itai, and H. Avni (1978). Interpolation search - a log log и search, Comm.ACMlXJ550-553.

85. Peterson, W. W. (1957). Addressing for random access storage, IBM J. Res. and Devel. 1:2, pp. 130-146.

86. Pratt, T. W. (1975). Programming Languages: Design and Implementation, Prentice-Hall, Englewood Cliffs, N. J. (Русский перевод: Пратт Т. Языки программирования. Разработка и реализация. - М., "Мир", 1979.)

87. Pratt, V. R. (1979). Shellsort and Sorting Networks, Garland, New York.

88. Prim, R. C. (1957). Shortest connection networks and some generalizations, Bell System Technical J. 36, pp. 1389-1401.

89. Reingold, E. M. (1972). On the optimality of some set algorithms, /. ACM 19:4, pp. 649-659.

90. Robson, J. M. (1971). An estimate of the store size necessary for dynamic storage allocation, J.ACM 18:3, pp. 416-423.

91. Robson, J. M. (1974). Bounds for some functions concerning dynamic storage allocation, /. АСМ2\:Ъ, pp. 491-499.

92. Robson, J. M. (1977). A bounded storage algorithm for copying cycUc structures, Comm. ACM20:6, pp. 431-433.

93. Sahni, S. (1974). Computationally related problems, SIAM J. Computing 3:3, pp. 262-279.



94. Sammet, J. E. (1968). Programming Languages: History and Fundamentals, Prentice-Hall, Englewood Cliffs, N. J.

95. Sclikolnick, M. (1975). Tlie optimal selection of secondary indices for files, Lnformation Systems 1, pp. 141-146.

96. Schoenhage, A., and V. Strassen (1971). Schnelle multiplikation grosser zahlen. Computing 7, pp. 281-292.

97. Scliorr, H., and W. M. Waite (1967). An efficient macliine-independent procedure for garbage collection in various list structures. Comm. ACM 10:8, pp. 501-506.

98. Scliwartz, J. T. (1973). On Programming: An Interrum Report on the SETL Project, Courant Inst., New York.

99. Sliarir, M. (1981). A strong-connectivity algoritlim and its application in data flow analysis, Computers and Mathematics with Applications 7:1, pp. 67-72.

100.Shaw, M., W. A. Wulf, and R. L. London (1977). Abstraction and verification in ALPHARD: defining and specifying iteration and generators, Comm. ACM 20:8, pp.553-563.

101. Shell, D. L. (1959). A high-speed sorting procedure. Comm. ACM 2:1, pp. 30-32.

102. Shell, D. L. (1971). Optimizing the polyphase sort, Comm. ACM\А:П, pp. 713-719.

103. Singleton, R. C. (1969). Algorithm 347: an algorithm for sorting with minimal storage, Comm. ACM 12:3, pp. 185-187.

104. Strassen, V. (1969). Gaussian elimination is not optimal, Numerische Mathematilt 13, pp. 354-356.

105. Stroustrup, B. (1982). Classes: an abstract data type facility for the С language, SIGPLANNotices 17:1, pp. 354-356.

106. Suzuki, N. (1982). Analysis of pointer rotation. Comm. ACM 25:5, pp. 330-335.

107. Tarjan, R. E. (1972). Depth first search and linear graph algorithms, SIAM J. Computing 1:2, pp. 146-160.

108. Tarjan, R. E. (1975). On the efficiency of a good but not Unear set merging algorithm, /. ACM22:2, pp. 215-225.

109. Tarjan, R. E. (1981). Minimum spanning trees, неопубликованный меморандум, Bell Laboratories, Murray Hill, N. J.

110. Tarjan, R. E. (1983). Data Structures and Graph Algorithms, неопубликованная рукопись. Bell Laboratories, Murray Hill, N. J.

111.Ullman, J. D. (1974). Fast algorithms for the elimination of common subexpressions, Acta Lnformatica 2:3, pp. 191-213.

112. Ullman, J. D. (1982). Principles of Database Systems, Computer Science Press, Rockville, Md.

113.van Emde Boas, P., R. Kaas, and E. Zijlstra (1977). Design and implementation of an efficient priority queue structure, Math Syst. Theory, 10, pp. 99-127.

114. Warshall, S. (1962). A theorem on Boolean matrices, J.ACM9:\, pp. 11-12. 115.Weinberg, G. M. (1971). 77ге Psychology of Computer Programming, Van Nostrand, N. Y.

lie.Weiner, P. (1973). Linear pattern matching algorithms, Proc. LEEE Fourteenth Annual Symp. on Switching and Automata Theory, pp. 1-11.

117.Wexelblat, R. L. (ed.) (1981). History of Programming Languages, Academic Press, N. Y.

118. Wiederhold, G. (1982). Database Design, McGraw-Hill, New York.

119. Williams, J. W. J. (1964). Algorithm 232: Heapsort, Comm. ACM 1:6, pp. 347-348.



120. Wirth, N. (1973). Systematic Programming: An Introduction, Prentice-Hall, Englewood Cliffs, N. J. (Русский перевод: Вирт Н. Системное программирование: Введение. - М., "Мир", 1977.)

121. Wirth, N. (1976). Algorithms + Data Structures = Programs, Prentice-Hall, Englewood Cliffs, N. J. (Русский перевод: Вирт Н. Алгоритмы + структуры данных = программы. - М., "Мир", 1985.)

122.Wulf, W. А., М. Shaw, Р. Hilfinger, and L. Flon (1981). Fundamental Structures of Computer Science, Addison-Wesley, Reading, Mass.

123.Yao, A. C. (1975). An 0(£ log log F) algorithm for finding minimum spanning trees, Inf. Processing Letters 4:1, pp. 21-23.

124. Yao, A. C, and F. F. Yao (1976). The complexity of searching a random ordered table, Proc. IEEE Seventeenth Annual Symp. on Foundations of Computer Science, pp.173-177.

125. Yourdon, E., and L. L. Constantino (1975). Structured Design, Yourdon, New York.





0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 [120] 121 122 123

0.0041