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

Список литературы

1. Адельсон-Вельский Г. М., Ландис Е. М. (1962). Один алгоритм организации информации. Докл. АН СССР, 146, с. 263-266.

2. Alio, А. V., М. R. Garey, and J. D. Ullman (1972). The transitive reduction of a directed grapli, SIAMJ. Computing 1:2, pp. 131-137.

3. Aho, A. v., J. E. Hopcroft, and J. D. Ullman (1974). The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (Русский перевод: Ахо A., Хоркрофт Дж., Ульман Дж. Построение и анализ вычислительных алгоритмов. - М., "Мир", 1979.)

4. Aho, А. V., and N. J. А. Sloane (1973). Some doubly exponential sequences, Fibonacci Quarterly, 11:4, pp. 429-437.

5. Aho, A. v., and J. D. Ullman (1977). Principles of Compiler Design, Addison-Wesley, Reading, Mass.

6. Bayer, R., and E. M. McCreight (1972). Organization and maintenance of large ordered indices, ДсГа Informatical.3, pp. 173-189.

7. Bellman, R. E. (1957). Dynamic Programming, Princeton University Press, Princeton, N. J. (Русский перевод: Беллман P. Динамическое программирование. -М., ИЛ, 1960.)

8. Bentley, J. L. (1982). Writing Efficient Programs, Prentice-Hall, Englewood Chffs, N. J.

9. Bentley, J. L., D. Haken, and J. B. Saxe (1978). A general method for solving divide-and-conquer recurrences, CMU-CS-78-154, Dept. of CS, Carnegie-Mellon Univ., Pittsburg, Pa.

10. Berge, C. (1957). Two theorems in graph theory, Proc. National Academy of Sciences 43, pp. 842-844.

11. Berge, C. (1958). The Theory of Graphs and its Applications, Wiley, N. Y. (Русский перевод: Берж С. Теория графов и ее применение. - М., ИЛ, 1962.)

12. Birtwistle, G. М., 0.-J. Dahl, В. Myhrhaug, and К. Nygaard (1973). SIMULA Begin, Auerbach Press, Philadelphia, Pa.

13. Blum, M., R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan (1972). Time bounds for selection, /. Computer and System Sciences 7:4, pp. 448-461.

14. Boruvka, 0. (1926). On a minimal problem, Prdce Moraske Pridovedecke Spolecnosti 3:3, pp. 37-58.

15. Brooks, F. P. (1974). The Mythical Man Month, Addison-Wesley, Reading, Mass.

16. Carter, J. L., and M. N. Wegman (1977). Universal classes of hash functions, Proc. Ninth Annual ACM Symp. on Theory of Computing, pp. 106-112.

17. Cheriton, D., and R. E. Tarjan (1976). Finding minimum spanning trees, SLAM J. Computing 5:4, pp. 724-742.

18. Cocke, J., and F. E. Allen (1976). A program data flow analysis procedure, Comm. дел/19:3, pp. 137-147.

19. Coffman, E. G. (ed.) (1976). Computer and Job Shop Scheduling Theory, John Wiley and Sons, New York.

20. Comer, D. (1979). The ubiquitous B-tree, Computing Surveys 11, pp. 121-137.

21. Cooley, J. M., and J. W. Tukey (1965). An algorithm for the machine calculation of complex Fourier series, Math. Сотр. 19, pp. 297-301.

22. DBTG (1971). CODASYL Data Base Task Group April 1971 Report, ACM, New York.



23. Demers, A., and J. Donahue (1979). Revised report on RUSSELL, TR79-389, Dept. of Computer Science, Cornell Univ., Ithaca, N. Y.

24. Deo, N. (1975). Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Englewood Cliffs, N. J.

25. Deutsch, L. P., and D. G. Bobrow (1966). An efficient incremental automatic garbage collector, Comm. ACM 9:9, pp. 522-526.

26. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs, Num.erische Mathematik 1, pp. 269-271.

27. Edmonds, J. (1965). Paths, trees, and flowers, Canadian J. Math 17, pp. 449-467.

28. Even, S. (1980). Graph Algorithms, Computer Science Press, Rockville, Md.

29. Even, S., and O. Kariv (1975). An 0(п) algorithm for maximum matching in general graphs, Proc. IEEE Sixteenth Annual Symp. on Eoundations of Computer Science, pp. 100-112.

30. Farber, D., R. E. Griswold, and L Polonsky (1964). SNOBOL, a string manipulation language, J. ACM 11:1, pp. 21-30.

31. Fischer, M. J. (1972). Efficiency of equivalence algorithms, in Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.), pp. 153-168.

32. Fletcher, W., and R. Silver (1966). Algorithm 284: interchange of two blocks of data, Comm. ACM 9:5, p. 326.

33. Floyd, R. W. (1962). Algorithm 97: shortest path, Comm. ACM 5:6, p. 345.

34. Floyd, R. W. (1964). Algorithm 245: treesort 3, Comm. ACM1:\2, p. 701.

35. Floyd, R. W., and A. Smith (1973). A linear time two-tape merge, Inf. Processing letters 2:5, pp. 123-126.

36. Ford, L. R., and S. M. Johnson (1959). A tournament problem, Amer. Math. Monthly 66, pp. 387-389.

37. Frazer, W. D., and A. C. McKellar (1970). Samplesort: a sampling approach to minimal tree storage sorting, J.ACM 17:3, pp. 496-507.

38. Fredkin, E. (I960). Trie memory, Comm. ACM 3:9, pp. 490-499.

39. Friend, E. H. (1956). Sorting on electronic computer systems, J.ACMy.2, pp. 134-168.

40. Fuchs, H., Z. M. Kedem, and S. P. Uselton (1977). Optimal surface reconstruction using planar contours. Comm. ACM 2Q:\Q, pp. 693-702.

41. Garey, M. R., and D. S. Johnson (1979). Computers and Intractability: a Guide to the Theory of NP-Conpleteness, Freeman, San Francisco. (Русский перевод: Еэри М., Джонсон Д.С. Вычислительные машины и трудноразрешимые задачи. - М., "Мир", 1982.)

42. Geschke, С. М., J. Н. Morris, Jr., and Е. Н. Satterthwaite (1977). Early expreience with MESA, Comm. ACM 20:8, pp. 540-552.

43. Gotlieb, C. C, and L. R. Gotlieb (1978). Data Types and Data Structures, Prentice-Hall, 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, Е., and S. Tsur (1980). Experiments with B-tree reorganization, ACM SIGMOD 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.)



48. Hirschberg, D. S. (1973). A class of dynamic memory allocation algorithms. Comm. ACM\6:\Q,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. (Русский перевод: Дал У., Дейкстра Э., Хоор К. Структурное программирование. - М., "Мир", 1975.)

51. Hopcroft, J. е., and R. М. Karp (1973). An n algorithm for maximum matchings in bipartite graphs, SIAMJ. Computing 2:4, pp. 225-231.

52. Hopcroft, J. E., and R. E. Tarjan (1973). Efficient algorithms for graph manipulation. 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-redundancy codes, Proc. IRE 40, pp. 1098-1101.

55. Hunt, J. W., and T. G. Szymanski (1977). A fast algorithm for computing longest common 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 spanning trees, Lnf. Processing Letters 4:3, pp. 53-57.

58. Johnson, D. B. (1977). Efficient algorithms for shortest paths is sparse networks, /. ACM 24:1, pp. 1-13.

59. Карацуба A. A., Офман Ю. П. (1961). Умножение многозначных чисел на автоматах. Докл. ДЯ СССР, 145, № 2, с. 293-294.

60. Kernighan, В. W., and Р. 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, Addison-Wesley, Reading, Mass.

62. Knowlton, K. C. (1965). A fast storage allocator. Comm. ACM Ы0, pp. 623-625.

63. Knuth, D. E. (1968). The Art of Computer Programming Vol. L: Fundamental Algorithms, Addison-Wesley, Reading, Mass. (Русский перевод: Кнут Д. Искусство программирования для ЭВМ. Том 1: Основные алгоритмы. - М., "Мир", 1976. Русский перевод переработанного издания: Кнут Д. Искусство программирования. Том 1: Основные алгоритмы. - М., Издательский дом "Вильяме", 2000.)

64. Knuth, D. Е. (1971). Optimum binary search trees. Acta/n/ormatical:l, pp. 14-25.

65. Knuth, D. E. (1973). The Art of Computer Programming Vol. Ill: Sorting and Searching, Addison-Wesley, Reading, Mass. (Русский перевод: Кнут Д. Искусство программирования для ЭВМ. Том 3: Поиск и сортировка. - М., "Мир", 1976. Русский перевод переработанного издания: Кнут Д. Искусство программирования. Том 3: Поиск и сортировка. - М., Издательский дом "Вильяме", 2000.)

66. Knuth, D. Е. (1981). ТЕХ and Metafont, New Directions in Typesetting, Digital Press, Bedford, Mass.

67. Kruskal, J. B. Jr. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. AMS7:1, pp. 48-50.

68. Lin, S., and B. W. Kernighan (1973). A heuristic algorithm for the traveling salesman problem. Operations Research 21, pp. 498-516.

69. Liskov, В., A. Snyder, R. Atkinson, and C. Scaffert(1977). Abstraction mechanisms in CLU, Comm. ДСМ20:8, pp. 564-576.

70. Liu, C. L. (1968). Introduction to Combinatorial Mathematics, McGraw-Hill, N. Y.





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.0037