Структуры данных и алгоритмы (1021739), страница 100
Текст из файла (страница 100)
Early expreiencewith MESA, Comm. ACM 20:8, pp. 540-552.43. Gotlieb, C. C., and L. R. Gotlieb (1978). Data Types and Data Structures, PrenticeHall, Englewood Cliffs, N. J.44. Greene, D. H., and D. E. Knuth (1983). Mathematics for the Analysis of Algorithms,Birkhauser, Boston, Mass. (Русский перевод: Грин Д., Кнут Д., Математическиеметоды анализа алгоритмов. — М., "Мир", 1987.)45. Gudes, E., and S.
Tsur (1980). Experiments with B-tree reorganization, ACMSIGMOD Symposium on Management of Data, pp. 200-206.46. Hall, M. (1948). Distinct representatives of subsets, Bull. AMS 54, pp. 922-926.47. Harary, F. (1969). Graph Theory, Addison-Wesley, Reading, Mass. (Русский перевод: Харари Ф., Теория графов. — М., "Мир", 1973.)370СПИСОК ЛИТЕРАТУРЫ48. Hirschberg, D.
S. (1973). A class of dynamic memory allocation algorithms, Comm.ACM 16:10, pp. 615-618.49. Hoare, C. A. R. (1962). Quicksort, Computer J. 5:1, pp. 10-15.50. Hoare, C. A. R., O.-J. Dahl, and E. W. Dijkstra (1972). Structured Programming,Academic Press, N. Y. (Русский перевод: Дал У., Дейкстра 9., Хоор К. Структурное программирование. — М., "Мир", 1975.)51. Hopcroft, J. E., and R. М. Кагр (1973). An n5/2 algorithm for maximum matchingsin bipartite graphs, SIAM J. Computing 2:4, pp.
225-231.52. Hopcroft, J. E., and R. E. Tarjan (1973). Efficient algorithms for graphmanipulation, Comm. ACM 16:6, pp. 372-378.53. Hopcroft, J. E., and J. D. Ullman (1973). Set merging algorithms, SIAM J.Computing 2:4, pp. 294-303.54. Huffman, D. A. (1952). A method for the construction of minimum-redundancycodes, Proc. IRE 40, pp. 1098-1101.55.
Hunt, J. W., and T. G. Szymanski (1977). A fast algorithm for computing longestcommon subsequences, Comm. ACM 20:5, pp. 350-353.56. Iverson, K. (1962). A Programming Language, John Wiley and Sons, New York.57. Johnson, D. B. (1975). Priority queues with update and finding minimum spanningtrees, Inf. Processing Letters 4:3, pp. 53-57.58. Johnson, D.
B. (1977). Efficient algorithms for shortest paths is sparse networks, J.ACM 24:1, pp. 1-13.59. Карацуба А. А., Офман Ю. П. (1961). Умножение многозначных чисел на автоматах. Докл. АН СССР, 145, № 2, с. 293-294.60. Kernighan, В. W., and P. J. Plauger (1974). The Elements of Programming Style,McGraw-Hill, N. Y.61. Kernighan, B. W., and P. J. Plauger (1981). Software Tools in Pascal, AddisonWesley, Reading, Mass.62.
Knowlton, K. C. (1965). A fast storage allocator, Comm. ACM 8:10, pp. 623-625.63. Knuth, D. E. (1968). The Art of Computer Programming Vol. I: FundamentalAlgorithms, Addison-Wesley, Reading, Mass. (Русский перевод: Кнут Д. Искусствопрограммирования для ЭВМ. Том 1: Основные алгоритмы. — М., "Мир", 1976.Русский перевод переработанного издания: Кнут Д.
Искусство программирования. Том 1: Основные алгоритмы. — М., Издательский дом "Вильяме", 2000.)64. Knuth, D. E. (1971). Optimum binary search trees, Acta Informatica 1:1, pp. 14-25.65. Knuth, D. E. (1973). The Art of Computer Programming Vol. Ill: Sorting andSearching, Addison-Wesley, Reading, Mass. (Русский перевод: Кнут Д.
Искусствопрограммирования для ЭВМ. Том 3: Поиск и сортировка. — М., "Мир", 1976.Русский перевод переработанного издания: Кнут Д. Искусство программирования. Том 3: Поиск и сортировка. — М., Издательский дом "Вильяме", 2000.)66. Knuth, D. E. (1981). ТЕХ and Metafont, New Directions in Typesetting, DigitalPress, Bedford, Mass.67.
Kruskal, J. B. Jr. (1956). On the shortest spanning subtree of a graph and thetraveling salesman problem, Proc.AMS 7:1, pp. 48-50.68. Lin, S., and B. W. Kernighan (1973). A heuristic algorithm for the travelingsalesman problem, Operations Research 21, pp. 498—516.69. Liskov, В., A. Snyder, R. Atkinson, and C. Scaffert (1977). Abstraction mechanismsin CLU, Comm. ACM 20:8, pp. 564-576.70. Liu, C. L. (1968). Introduction to Combinatorial Mathematics, McGraw-Hill, N.
Y.СПИСОК ЛИТЕРАТУРЫ37171. 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 Surveys7: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(J\V~\- \ E \) algorithm for findingmaximum matching in general graphs, Proc. IEEE Twenty-first Annual Symp. onFoundations 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.ACM 21: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 ofa digraph, J. ACM 16:3, pp. 455-460.80. Nicholls, 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 Surveys6: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. Jr. (1980). Conditions for optimality of the Huffman algorithm,SIAM J. Computing 9:3, pp. 470-489.84. Perl, Y., A. Itai, and H.
Avni (1978). Interpolation search — a log log n search,Comm.ACM 21:7, pp. 550-553.85. Peterson, W. W. (1957). Addressing for random access storage, IBM J. Res. andDevel. 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, BellSystem Technical J. 36, pp. 1389-1401.89. Reingold, E. M. (1972). On the optimality of some set algorithms, J. ACM 19:4,pp. 649-659.90. Robson, J. M. (1971). An estimate of the store size necessary for dynamic storageallocation, J.ACM 18:3, pp. 416-423.91. Robson, J. M. (1974).
Bounds for some functions concerning dynamic storageallocation, J. ACM 21:3, pp. 491-499.92. Robson, J. M. (1977). A bounded storage algorithm for copying cyclic structures,Comm. ACM 20:6, pp. 431-433.93. Sahni, S. (1974). Computationally related problems, SIAM J. Computing 3:3,pp. 262-279.372СПИСОК ЛИТЕРАТУРЫ94.
Sammet, J. E. (1968). Programming Languages: History and Fundamentals,Prentice-Hall, Englewood Cliffs, N. J.95. Schkolnick, M. (1975). The optimal selection of secondary indices for files,Information Systems 1, pp. 141-146.96. Schoenhage, A., and V. Strassen (1971). Schnelle multiplikation grosser zahlen,Computing 7, pp. 281-292.97. Schorr, H., and W. M. Waite (1967).
An efficient machine-independent procedurefor garbage collection in various list structures, Comm. ACM 10:8, pp. 501-506.98. Schwartz, J. T. (1973). On Programming: An Interrum Report on the SETL Project,Courant Inst., New York.99. Sharir, M. (1981). A strong-connectivity algorithm and its application in data flowanalysis, Computers and Mathematics with Applications 7:1, pp. 67-72.100.Shaw, M., W.
A. Wulf, and R. L. London (1977). Abstraction and verification inALPHARD: 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:7, pp. 30-32.102. Shell, D. L. (1971). Optimizing the polyphase sort, Comm. ACM 14:11, pp. 713-719.103. Singleton, R. C. (1969).
Algorithm 347: an algorithm for sorting with minimalstorage, Comm. ACM 12:3, pp. 185-187.104. Strassen, V. (1969). Gaussian elimination is not optimal, Numerische Mathematik13, pp. 354-356.105. Stroustrup, B. (1982). Classes: an abstract data type facility for the С language,SIGPLAN Notices 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 linear set mergingalgorithm, J. ACM 22: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.lll.Ullman, J. D. (1974). Fast algorithms for the elimination of common subexpressions, Acta Informatica 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 ofan efficient priority queue structure, Math Syst. Theory, 10, pp. 99-127.114. Warshall, S. (1962). A theorem on Boolean matrices, J.ACM 9:1, pp. 11-12.HS.Weinberg, G. M.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
