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

Пратт. Яо (Pratt V. Н., Yao F. F.)

[1973] On lower bounds for computing the rth largest element, IEEE 14th Annual Symposium on Switching and Automata Theory, 70-81.

Прим (Prim R. C.)

[1957] Shortest connection networks and some generalizations, Bell Sustem Tehn. J., 1389-1401. *

Рабин (Rabin M. 0.)

[1963] Real-time computation, tsr. J. Math., 1, №4. 203-211. (Русский перевод в сб. «Проблемы математической логики», М., Мир, 1970, стр. 156-167.) [1972] Proving simultaneous positivity of linear forms, J. Comput. and Syst. Sci., 6, №6, 639-650.

Рабин, Виноград (Rabin M. 0., Winoad S.)

[1971] Fast evaluation of polynomials by rational preparation, IBM. Techn. Rept. RC 3645, Yorktown Heights, N.Y. (См. также Математика, 18.- 4, (1974), 98-120.)

Рабин, Скотт (Rabin М. О., Scott D.)

[1959] Finite automata and their decision problems, IBM J. Res. and Devel., 3, №2, 114-125. (Русский перевод в Кибернетическом сборнике, вып. 4, М., ИЛ, 1962, стр. 56-91.)

Рабинер, Рейдер (ред.) (Rabiner L. R., Rader С. М.)

[1972] Digital signal processing, IEEE Press, New York.

Рабинер, Шэфер, Рейдер (Rabiner L. R., Schafer R. W., Rader C. M.)

[1969] The chirp г-transforra and its application. Bell Syst. Techn. J., 48, №3, 1249-1292. Cm. также Рабинер, Рейдер [1972], 322-328.

Раундз (Rounds W. С.)

[1973] Complexity of recognition in intermediate level languages, IEEE 14th Annual Symposium on Switching and Automata Theory, 145-158.

Рейнгольд (Reingold E. M.)

[1972] On the optimality of some set algorithms, J. Assoc. Comput. Mach., 19, №4, 649-659.

Рейдер (Rader C. M.)

[1968] Discrete Fourier transform when the number of data points is prime, Proc. IEEE, 56, 1107-1108.

Роджерс (Rogers H. Jr.)

[1967] Theory of recursive functions and effective computability, McGraw-Hill, New York. (Русский перевод: Роджерс X., Теория рекурсивных функций и эффективная вычислимость, М., Мир, 1972.)

Рунге, Кёниг (Runge С, Konig Н.)

[1924] Die Grundlehren der mathematischen Wissenschaften, В. И, Springer, Berlin.

Сайферас, Фишер, Мейер (Seiferas J. J., Fischer M. J., Meyer A. R.)

[1973] Refinements of nondeterministic time and space hierarchies, IEEE 14th Annual Symposium on Switching and Automata Theory, 130-137.

Охни (Sahni S. K.)

[1972] Some related problems from network flows, game theory and integer programming, IEEE 13th Annual Symposium on Switching and Automata Theory, 130-138.

Сети (Sethi R.)

[1973] Complete register allocation problems, Proc. 5th Annual ACM Symposium

on Theory of Computing, Austin, Texas, 182-195. Синглтон (Singleton R. C.)

[1969] Algorithm 347: an algorithm for sorting with minimal storage, Comm.

ACM, 12, №3, 185-187. Слисенко A. O.

"[1977] Распознавание предиката вхождения в реальное время, препринт



ЛОМИ Р-7-77, Ленинград. Слоун (Sloane N. J. А.)

[1973] А handbook of integer sequences. Academic Press, New York. Спира (Spira P. M.)

[1973] A new algorithm for finding all shortest paths in a graph of positive arcs

in average time 0 (я log я), SIAM J. Comput., 2, № 1, 28-32. Спира, Пан (Spira P. M., Pan A.)

[1973] On finding and updating shortest paths and spanning trees, IEEE 14th

Annual Symposium on Switching and Automata Theory, 82-84. Стирнз, Розенкранц (Stearns R. E., Rosenkrantz D. J.)

[1969] Table machine simulation, IEEE 10th Annual Symposium on Switching

and Automata Theory, 118-128. Стокмейер (Stockmeyer L. J.)

[1973] Planar 3-colorability is polynomial complete, SIGACT News, 5, №3,

19-25.

Стокмейер, Мейер (Stockmeyer L. J., Meyer A. R.)

[1973] Word problems requiring exponential time, Proc. 5th Annual ACM Symposium on Theory of Computing, 1-9.

Стоун (Stone H. S.)

[1972] Introduction to computer organization and data structures, McGraw-Hill, New York.

Сэвич (Savitch W. J.)

[1970] Relationship between nondeterministic and deterministic tape complexities, J. Comput. and Syst. Sci., 4, №2, 177-192.

[1971] Maze recognizing automata, Proc. 4th Annual ACM Symposium on Theory of Computing, Denver, Colorado, 151-156. Тарьян (Tarjan R. E.)

[1972] Depth first search and linear graph algorithms, SIAM J. Comput. I, №2, 146-160.

[1973a] Finding dominators in directed graphs, Proc. 7th Anual Princeton Conference on Information Sciences and Systems, 414-418. [19736] Testing flow graph reducibility, Proc. 5th Annual ACM Symposium on Theory of Computing, Austin, Texas, 96-107.

[1975] On the efficiency of a good but not linear set union algorithm, J. Assoc. Comput. Mach., 22, №2, 215-224.

°[1977] Reference machines require non-linear time to maintain disjoint sets,

Proc. 9th Annual ACM Symposium on Theory of Computing, Boulder, Colorado,

18-29. Томпсон (Thompson K.)

[1968] Regular expression search algorithm. Comm. ACM, 11, № 6, 419-422. Трауб (ред.) (Traub J. F.)

[1973] Complexity of sequential and parallel numerical algorithms, Academic

Press, New York. Трахтенброт Б. A.

°[1956] Сигнализирующие функции и табличные операторы, Уч. записки

Пензенского гос. пед. ин-та, IV, 75-87. Тьюринг (Turing А. М.)

1936] On computable numbers, with an application to the Entscheidungsprob-

lem, Proc. London Math, Soc, ser. 2, 42, 230-265. Corrections, там оке 43,

1937 544 546.

Уильяме (Williams" J. W. J.)

[1964] Algorithm 232: Heapsort, Comm. ACM, 7, № 6, 347-348. Ульман (Ullman J. D.)

[1973] Polynomial complete scheduling problems, Proc. 4th Symposium on

Operating System Principles, 96-101.

[1974] Fast algorithms for the elimination of common subexpressions. Acta Inform., 2, №3, 191-213.



Уоршолл (Warshall S.)

[1962] А theorem on Boolean matrices, J. Assoc. Comput. Mach., 9, № 1, 11-12.

Фидуччиа (Fiduccia C. M.)

[1971] Fast matrix multiplication, Proc. 3rd Annual ACM Symposium on Theory of Computing, Shaker Hights, Ohio, 45-49.

[1972] Polynomial evaluation via the division algorithm-the fast Fourier transform revisited, Proc. 4th Annual ACM Symposium on Theory of Computine, Denver, Colorado, 88-93.

Фишер (Fischer M. J.)

[1972] Efficiency of equivalence algorithms, см. Миллер, Тэчер [1972], 153-168.

Фишер, Мейер (Fischer М. J., Meyer А. R.)

[1971] Boolean matrix multiplication and transitive closure, IEEE 12th Annual Symposium on Switching and Automata Theory, 129-131.

Фишер, Патерсон (Fischer M. J., Paterson M. S.)

[1974] String-matching and other products. Complexity Comput. (SIAM-AMS Proc, Vol. 7), Providence, R. I. 113-125.

Фишер, Рабин (Fischer M. J., Rabin M. 0.)

[1974] Super-exponential complexity of Presburger arithmetic. Complexity Comput. (SIAM-AMS Proc, Vol. 7), Providence, R. I., 27-42.

Флойд (Floyd R. W.)

1962] Algorithm 97: shortest path. Comm. ACM, 5, № 6, 345. 1964] Algorithm 245: treesort 3, Comm. ACM, 7, № 12, 701.

Флойд, Ривест (Floyd R. W., Rivest R. L.)

[1973] Expected time bounds for selection. Computer Sci. Dept., Stanford University.

Форд, Джонсон (Ford L. R., Johnson S. M.)

[1959] A tournament problem, Amer. Math. Monthly, 66, 387-389. Фрэзер, Мак-Келлар (Frazer W. D., McKellar A. C.)

[1970] Samplesort: a smapling approach to minimal storage tree sorting, J,

Assoc. Comput. Mach., 17, № 3, 496-507. Фурман M. E.

[1970] О применении метода быстрого перемножения матриц в задаче нахождения транзитивного замыкания графа. Доклады АН СССР, 194, № 3, 524. Хант (Hunt Н. В. Ill)

(1973а] On the time and tape complexity of languages, Proc. 5th Annual ACM Symposium on Theory of Computing, Austin, Texas, 10-19. См. также TR-73-182, Dept. Comput. Sci., Cornell University. Ithaca, N. Y. [19736] The equivalence problem for regular expressions with intersection is not polynjmia in tape, TR 73-156, Dept. Comput. Sci., Cornell University, Ithaca, N. Y.

[1974] Stack languages. Rices theorem and a natural exponential complexity gap, TR-142, Comput. Sci. Lab., Dept. Electr. Engineering, Princeton University, Princeton, N. J.

Хант, Розенкранц (Hunt H. B. Ill, Rosenkrantz D. J.)

[1974] Computational parallels between the regular and context-free languages, Proc. 6th Annual ACM Symposium on Theory of Computing, Seattle, Washington, 64-74.

Харари (Harary F.)

[1969] Graph theory, Addison-Wesley, Reding Mass. (Русский перевод: Харари Ф., Теория графов, М., Мир, 1973.)

Харпер, Сэвидж (Harper L. Н., Savage J. Е.)

[1972] On the complexity of the marriage problem, Advan. Math., 9, № 3, 299- 312.

Хартманис (Hartmanis J.)

[1971] Computational complexity of random access stored program machines. Math. Syst. Theory., 5, №3, 232-245.





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