Главная  Полное построение алгоритма 

[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]

AQ. Huntsberger, D. V., and P. Billingsley, Elements of Stalisiica\ Inference, 3d ed., Allyn and Bacon, Boston, Mass., 1973(EM).

49. Ingalls, D. H. H., "FETE: A Fortran Execution Time Estimator," Tech. Rept. ) STAN-CS-71-204, Stanford University; Stanford, Calif., 1971(E).

50. Johnson, D., "Approximation Algorithms for Combinatorial Problems," J. Comput:

Syst. ScL, 9: 256-276 (1974)(АМ).

51. Karp, R. M., "On the Computational Complexity of Combinatorial Problems."

Networks, 5: 45-68 (1975)(AM).

52. Kaufmann, A., Graphs, Dynamic Programming and Finite Games, Academic, New

York, 1967(IM).

БЗ. Kautz, W. H., K. N. Levitt, and A. Waksman. "Cellular Interconnection Arrays." IEEE

Trans. Comput.. 0-17: 443-451 (1968)(IM). 54i Kernighan, B. W., and P. J. Plauger, The Elements of Programming Style,

McGraw-Hill, New York, 1970(E).

55. King. C. A., "A Graph-Theoretic Programming Language," in R. C. Read(ed.),

Graph Theory and Computing, Academic, New York, 1972, 63-74(1).

56. Knuth, D. E., Fundamental Algorithms, The Art of Computer Programming, vol. 1,

Addison-Wesley, Reading, fvlass., 1969a(AM). 57.-. Seminumericai Algorithms, The Art of Computer Programming, vol. 2,

Addison-Wesley, Reading, Mass., 1969b(AM). 58.-. "An Empirical Study of Fortran Programs," Software Pract. Exper., 1:

105-133 (1971)(E).

59.-. Sorting and Searching, The Art of Computer Programming, vol. 3.

Addison-Wesley, Reading, Mass., 1973(AM).

60. --• "Estimating the Efficiency of Ba:cktrack Programs," Matlu Comput., 29:

121-136.(1975)(IM).

61. LaSalle, J. P., The Influence of Computing on Mathematical Research and Education:

Proc. Symp. Appl. Math., vol. 20, American Mathematical Society. Providence, R.I., 1974(AM).

62. Lawler. E,, Combinatorial Optimization: Networks and Matroids, Holt, Rineharl and

Winston, New York. 1976(AM).

63. Lenstra, J. K., and A. H. G. Kan Rinnooy. "Some Simple Applications of the

Traveling Salesman Pioblenn." Publication EW 38/74. Mathematisch Centrum.-Amsterdam, 1974(AM).

64. Un. S., and B. W. Kernighan. "An Effective Heuristic Algorithm for the Traveling

Salesman Problem," Oper. Res., 21: 496-516 (1973)(l).

65. Laile. J. D. C, K. G. Murty, D. W. Sweeney, and C. Karel, "An Algorithm for the

Traveling Salesman Problem." Oper. Res., 11: 979-989 (1963)(IM).

66. Liu, C. L., Introduction to Combinatorial Mathematics, McGraw-Hill, New York.

1968(1M).

67. Luce, R. D., and H. Raiffa, Games and Decisions, Wiley, New York, 1957(AM). 66. Martin, С and D. S. Richards. "CLAMAR: A Combinatorial Language," Tech. Rept.

75-5, Department of Applied Mathematics and Computer Science, University of Virginia, 1975(1).

69.Martin, W. A., "Sorting." Comput. Surv.,S: 148-174 (1971)(l).



70. McGowan, С. L., and J. R. Kelly, Top-Down Structured Programming Techniques,

Petrocelli/Charter, New York, 1975(E).

71. Meltzer, В., and D. Michie, Machitfe Intelligence 7, Wiley, New York, 1972(AM).

72. Minsky, M., Computation: Finite and Infinite Machines, Rrenlice-Hall, Englewood

Cliffs, N.J., 1967(IM).

•73. Mood, A. M., and F. A. Graybill, Introduction to the Theory of Statistics, IVJcGraw-Hill, New York, 1963(IM). -

74. Mooney, J. W., "Organized Program Maintenance," Datatnation, 21: 63-64 (1975)

(E).

75. Nievergelt, J., J. C. Farrar, and E. M. Reingold, Computer Approaches to Mathemati-

cal Problems. Prentice-Hall. Englewood Cliffs, N.J., 1974(IM). 7Б. Nilsson, N. J., Artificial Intelligence. McGraw-Hill. New York, 1971(IM).

77. Page, E. S., and L. B. Wilson, Information Representation and Manipulation in a

Computer, Cambridge, London, 1973(IM).

78. Polya, G., How to Solve It, Doubleday, Garden City, N.Y., 1957(EM).

79. -, Mathematical Discovery, vols. 1 and 2, Wiley, New York. 1962(EM).

60. Prim. R. C. "Shortest Connection Networks and Some Generalizations," Bell Syst.

Tech. J.. 36: 1389-1401 (1957)(IM).

61. Ross, S. M.. Introduction to Probability Models, Academic, New.York,.1972(IM). 6Z. Scarne, J., Scarnes Complete Guide to Gambling, Simon andSchuster, New York,

1961(E).

83. Singleton, R. R., and W. F. Tyndalt, Games and Programs: Mathematics for Modeling,

Freeman, San Francisco, 1974(IM).

84. Slotnick. D. L., "The Fastest Computer." Sci. Am., 224: 76-88 (1971)(E).

85. Snell, J. L., Introduction to Probability Theory with C}mpiiting, Prentice-Hall, En-

glewood Cliffs, N.J.. 1975(EM).

86. Spencer, D. D., Game Playing with Computers, Spartan, New York, 1968(E).

87. Stone, H„ Introduction to Computer Organization and Data Structure., McGraw-Hill,

New York, 1972(1).

88. Tarjan, R., "Depth-First Search and Linear Graph Algorithms," SIAMJ. Comput, 1;

146-160 (1972)(IM).

89. Trakhtenbrot, E. A., Algorithms and Automatic Computing Machines, Heath, Boston,

Mass., 1963(1 M).

90. Traub. J. F., "Niimerical Mathematics and Computer Science," Comm. ACM, 15:

537-541 (1972)(IM).

91. -(ed.), Complexity of Sequential and Parallel Numerical Algorithms, Academic,

New York, 1973(IM to AM).

92. Van Tassel, D., Program Style, Design, Efficiency, Debugging, and Testing,

Prentice-Hall, Englewood Cliffs, N.J., 1974(E).

93. Von Neumann, J., and O. Morgenstern, Theory of Games and Economic Behavior,

Princeton University Press, Princeton, N.J., 1944(AM).

94. Webb, M. H. J., "Some Methods of Producing Approximate Solutions to Traveling f Salesman Problems with Hundreds or Thousands of Cities," Oper. Res. Q., 22.:

49-66 (1971)(E).

95. Wegner, P., Programming Languages, Information Structures, and Machine



Organization, McGraw-Hill, New York, 1968(1). 96." Wickelgren, W. A., How to Solve Problems; Elements of a Theory of Problems and Problem Solving, Freeman, San Francisco, 1974(EM).

97. Williams, J. D., TheCompleat Strategyst, McGraw-Hill, New York, 1966(EM).

98. Winkler, R. L., Introduction to Bayesian Inference and Decision, Holt, Rinehart and

Winston, New York, 1972(IM). 9 Yohe, J. M., "An Overview of Programming Practices," Comput. Surv., 6:221-245 (1974)(E).

ИМЕЕТСЯ РУССКИЙ ПЕРЕВОД К СЛЕДУЮЩИМ РАБОТАМ:

1. Ахо А., Хлопкрофт Дж., Ульман Дж. Построение и анализ вычислительных алгоритмов.- М.: Мир, 1979.

2. Баррон Д. Рекурсивные методы в программировании.- М.: Мир, 1974.

8. Берзтисс А. Структуры данных.- М.: Статистика, 1974.

9. Басакер Р., Саати Т. Конечные графы и сети.- М.: Наука, 1974.

15. Кокс Д., Хинкли Д. Теоретическая статистика.-М.: Мир, 1978.

16. Дал У., Дейкстра Э., Хоор К- Структурное программирование.- М.: Мир, 1975.

25. Фейгенбаум Э. Вычислительные машины и мышление.- М.: Мир, 1967.

26. Феллер В. Введение в теорию вероятностен и ее приложения.- М.: Мир, 1967.

36. Гарднер М. Математические головоломки и развлечения.- М.: Мир, 1971.

37. Гарднер М. Математические досуги.-М.: Мир, 1972.

56. Кнут Д. Искусство программирования для ЭВМ. Т. 1. Основные алгоритмы.- М.: Мир, 1976.

57. Кнут Д. Искусство программирования для ЭВМ. Т. 2. Получисленные алгоритмы.- М.: Мир, 977.

59. Кнут Д. Искусство программирования для ЭВМ. Т. 3. Сортировка и поиск.- М.: Мир, 1978.

67. ЛьюсР., РайфаХ. Игры и решения.-М.: ИЛ, 1961. 72. Минский М. Вычисления и автоматы.- М.: Мир, 1971.

75. Нивергельт Ю., Феррар Дж., Рейнголд Э. Машинный подход к решению математических задач.-М.: Мир, 1977.

76. Нильсон Н. Искусственный интеллект. Методы поиска решений.- М.: Мне, 1973.

78. Пойа Дж. Как решать задачу. Пособие для учителей.- М.: Учпедгиз, 1961.

79. Пойа Дж. Математическое открытие. Решение задач: основные понятия, изучение и преподавание.- М.: Наука, 1970.

93. Фон Не-1ман Дж., Моргенштерн О. Теория игр и экономическое поведение.- М.: Наука, 1970.

Работа [87] - Трахтенброт Б. А. «Алгоритмы и вычислительные автоматы» - была выпущена издательством «Советское радио» в 1974 г.



[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]

0.0018