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

рительной обработкой коэффициентов. Проблемы кибернетики, вып. 5, М.,

Физматгиз, 7-15. Беллман (Bellman R. Е.)

[1957] Dynamic programming, Princeton University Press, Princeton, N.J.

(Русский перевод: Беллман P., Динамическое программирование, М., ИЛ,

1960.) Берж (Berge С.)

[1958] The theory of graphs and its applications, Wiley, New York. (Русский перевод: Берж С, Теория графов и ее применение, М., ИЛ, 1962.)

Бёркхард (Burkhard W. Е.)

[1973] Nonrecursive tree traversal algorithms, Proc. 7th Annual Princeton Conference on Information Sciences and Systems, 403-405.

Биркгоф, Барти (Birkhoff G., Bartee T. C.)

[1970] Modern applied algebra, McGraw-Hill, New York. (Русский перевод: Биркгоф Г., Барти Т., Современная прикладная алгебра, М., Мир, 1976.)

Блюм (Blum М.)

[1967] А machine independent theory of the complexity of recursive functions, J. Assoc. Comput. Mach., 14, № 2, 322-336. (Русский перевод в сб. «Проблемы математической логики», М., Мир, 1970, стр. 401-422.) Блюм, Флойд, Пратт, Ривесг, Тарьян (Blum М., Floyd R. W., Pratt V. R., Ri-vest R. L., Tarjan R. E.)

[1972] Time bounds for selection, J. Comput. and Syst. Sci., 7, №4,448-461. Блюстейн (Bluestein L. J.)

[1970] A linear filtering approach to the computation of the discrete Fourier

transform, IEEE Trans. Electroacoustics, AU-18, №4, 451-455. См. также

Рабинер, Ридер [1972], 317-321. Бородин (Borodin А. В.)

[1973а] Computational complexity - theory and practice, см. Ахо [1973], 35

[19736] On the number of arithmetics required to compute certain functions- circa May 1973, см. Трауб [1973], 149-180. Бородин, Кук (Borodin А. В., Cook S. А.)

[1974] On the number of additions to compute specific polynomials, Proc. 6th Annual ACM Symposium on Theory of Computing, Seattle, Washington, 342- 347.

Бородин, Мунро (Borodin A. В., Munro I.)

[1971] Eva uating polynomials at many points. Inform. Process. Lett., 1, №2, 66-68.

[1975] The computational complexity of algebraic and numeric problems, American Elsevier, N. Y. Браун (Brown W. S.)

[1971] On Euclids algorithm and greatest common divisors, J. Assoc. Comput. Mach., 18. №4, 478-504.

[1973] ALTRAN users manual (3rd edition). Bell Laboratories, Murray Hill, N.J.

Бруно, Сети (Bruno J. L., Sethi R.)

[1974] Register allocation for a one-register machine, Proc. 8th Annual Princeton Conference on Information Sciences and Systems.

Бук (Book R. V.)

[1972] On languages accepted in polynomial time, SIAM J. Comput. 1, №4, 281-287.

[1974] Comparing complexity classes, J. Comput. and Syst. Sci., 9, № 2, 213- 229.

Вагнер (Wagner R. A.)

[1974] A shortest path algorithm for edge-sparse graphs, Dept. Syst. and Inform. Sci., Vanderbilt University, Nashville, Tennessee.



Вагнер, Фишер (Wagner R. А., Fischer М. J.)

[1974] The string-to-string correction problem, J. Assoc. Comput. Mach., 21,

№1, 168-173. Вайнер (Weiner P.)

[1973] Linear pattern matching algorithms, IEEE 14th Annual Symposium on

Switching and Automata Theory, 1-11. Валиант (Valiant L. G.)

[1974] General context-free recognition in less than cubic time, Dept. Comput.

Sci., Carnegie-Mellon University, Pittsburg, Pa. См. также J. Comput. and

Syst. Sci., 10, №2 (1975). 308-315. Вари (Vari T. M.)

[1974] Some complexity results for a class of Toeplitz matrices, неопубликованное сообщение, York Univ., Toronto, Ontario, Canada. Виноград (Winograd S.)

[1965] On the time required to perform addition, J. Assoc. Comput. Madi., 12, №2, 277-285. (Русский перевод в Кибернетическом сборнике, нов. сер., вып. 6, М., Мир, 1969, стр. 41-54.)

[1967] On the time required to perform multiplication, J. Assoc. Comput. Mach., 14, № 4, 793-802 (Русский перевод в Кибернетическом сборнике, нов. сер., вып. 6, М., Мир, 1969, стр. 55-71.)

[1970а] On the number of multiplications necessary to compute certain functions. Comm. Pure and Appl. Math., 23, 165-179.

[19706] On the multiplication of 2x2 matrices, IBM Res. Rept. RC 267, January 1970.

[1970b] The algebraic complexity of functions, Proc. Intern. Congress of Mathematicians (1970), vol. 3, Gauthier-Villars, Paris, 1971, 283-288. [1973] Some remarks on fast multiplication of polynomials, см. Трауб [1973], 181-196.

Галлер, Фишер (Galler В. А., Fischer М. J.)

[1964] An improved equivalence algorithm. Comm. ACM, 7, №5, 301-303. Гейл, Карп (Gale D., Karp R. M.)

[1970] A phenomenon in the theory of sorting, IEEE Uth Annual Symposium

on Switching and Automata Theory, 51-59. Гилберт, Myp (Gilbert E. N.. Moore E. F.)

[1959] Variable length encodings. Bell. Syst. Techn. J., 38, № 4, 933-963. Годбоул (Godbole S. S.)

[1973] On efficient computation of matrix chain products, IEEE Trans. Comput.,

C-22, №9, 864-966. Грей, Харрисон, Ибарра (Gray J. N., Harrison M. A., Ibarra O. H.)

[1967] Two way pushdown automata. Inform, and Contr., II, Ns3, 30-70.

Грэхем (Graham R. L.)

[1972] An efficient algorithm for determining the convex hull of a planar set.

Inform. Process. Lett., 1, №4, 132-133. Гуд (Good I. J.)

[1958] The interaction algorithm and practical Fourier series, J. Roy. Statist.

Soc, Ser. B, 20, 361-372; Addendum, там же, 22 (1960), 372-375. Гэри, Джонсон, Стокмейер (Garey М. R., Johnson D. S., Stockmeyer L. J.)

[1974] Some simplified polynomial complete problems, Proc. 6th Annual ACM

Symposium on Theory of Computing, Seattle, Washington, 47-63. Данциг, Блаттнер, Рао (Dantzig G. В., Blattner W. O., Rao M. R.)

[1966] All shortest routes from a fixed origin in a graph, Theory of graphs.

Intern. Symp., Rome, July 1966. (Труды симпозиума опубликованы изд-вом

Gordon and Breach, New York, 1967, 85-90.)

Дейкстра (Dijkstra E. W.)

[1959] A note on two problems in connection with graphs, Numer. Math., 1, 269-271.



Джентльмен (Gentleman W. М.)

[1972] Optimal multiplication chains for computing powers of polynomials,

Math. Comput., 26, № 120, 935-940. Джентльмен, Джонсон (Gentleman W. M., Johnson S. C.)

[1973] Analysis of algorithms, a case study: determinants of polynomials, Proc,

5th Annual ACM Symposium on Theory of Computing, Austin, Texas, 135-141. Джентльмен, Санд (Gentleman W. M., Sande G.)

[1966] Fast Fourier transforms for fun and profit, Proc. AFIPS 1966 Fall Joint

Computer Conf., vol. 29, Spartan, Washington, D. C, 563-578. Джонсон (Johnson D. B.)

[1973] Algorithms for shortest paths. Ph. D, Thesis, Dept. Comput. Sci., Cor-

nell University, Ithaca, New York. Джонсон (Johnson S. C.)

[1974] Sparse polynomial arithmetic. Bell Laboratories, Murrary Hill, N.J., Джоунс (Jones N. D.)

[1973] Reducibility among combinatorial problems in log л space, Proc. 7th

Annual Princeton Conference on Information Sciences and Systems, 547-551. Диветти, Грасселли (Divetti L., Grasselli A.)

[19б1в] On the determination of minimum feedback arc and vertex sets, /ЕЕЕ

Trans. Circuit Theory, CT-IS, № 1, 86-89. Дэниелсон, Ланцош (Danielson G. C, Lanczos C.)

[1942] Some improvements in practical Fourier analysis and their application

to X-ray scattering from liquids, J. Franklin Inst., 233, 365-380, 435-452. Дэвис (Davis M.)

[1958] Computability and unsolvability, McGraw-Hill, New York. Зивекинг (Sieveking M.)

[1972] An algorithm for division of power series. Computing, 10, 153-156. Ибарра (Ibarra O. H.)

[1972] A note concerning nondeterministic tape complexities, J. Assoc. Comput.

Mach., T9, №4, 608-612. Ибарра, Сахии (Ibarra 0. H., Sahni S. K.)

[1973] Polynomial complete fault detection problems, Techn. Rept. 74-3, Comput. Inform, and Control Sci., University of Minnesota, Minneapolis. См. также

IEEE Trans. Comput., C-24, Яв 3, (1975), 242-249. Ив (Eve J.)

[1964] The evaluation of polynomials, Numer. Math., 6, 17-21. Ивен (Even S.)

[1973] An algorithm for determining whether the connectivity of a graph is at least k, TR-73-184, Dept. Computer Sci., Cornell University, Ithaca, N.Y.

Карацуба A. A., Офман Ю. П.

[1961] Умножение многозначных чисел на автоматах. Доклады АН СССР, 145, №2, 293-294.

Карп (Кагр R. М.)

[1972] Reducibility among combinatorial problems, см. Миллер, Тэчер [1972], 85-104. (Русски) перевод в Кибернетическом сборнике, нов. сер., вып. 12, М., Мир, 1975, стр. 16-38.)

Карп, Миллер, Розенберг (Кагр R. М., Miller R. Е., Rosenberg А. L.)

[1972] Rapid ident fication of repeated patterns in strings, trees and arrays, Proc. 4th Annual ACM Symposium on Theory of Computing, Denver, Colorado, 125-136.

Касами (Kasami T.)

[1965] An efficient recognition and syntax algorithm for context-free languages, Sci. Rept. AFCRL-65-758, Air Force Cambridge Research Lab., Bedford, Mass.

Кедем (Kedem Z.)

[1974] On the number of multiplications and divisions required to compute certain rational functions, Proc. 6th Annual ACM Symposium on Theory of Computing, Seattle, Washington, 334-341.





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 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 [164] 165 166 167 168 169 170 171 172 173 174

0.0038