Array processing machines
暂无分享,去创建一个
[1] Walter J. Savitch,et al. Time Bounded Random Access Machines with Parallel Processing , 1979, JACM.
[2] Stephen A. Cook,et al. The Classifikation of Problems which have Fast Parallel Algorithms , 1983, FCT.
[3] Uzi Vishkin,et al. Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..
[4] J. van Leeuwen. Parallel computers and algorithms , 1985 .
[5] Steven Fortune,et al. Parallelism in random access machines , 1978, STOC.
[6] Stephen A. Cook,et al. Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..
[7] Michael J. Flynn,et al. Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.
[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[9] Walter L. Ruzzo. On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..
[10] Juris Hartmanis,et al. On the Power of Multiplication in Random Access Machines , 1974, SWAT.
[11] Leslie M. Goldschlager,et al. A universal interconnection pattern for parallel computers , 1982, JACM.
[12] Kai Hwang,et al. Vector Computer Architecture and Processing Techniques , 1981, Adv. Comput..
[13] Bernard Chazelle,et al. Unbounded Hardware is Equivalent to Deterministic Turing Machines , 1983, Theor. Comput. Sci..
[14] P. van Emde Boas. The second machine class: models of parallelism , 1985 .
[15] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[16] Larry J. Stockmeyer,et al. A Characterization of the Power of Vector Machines , 1976, J. Comput. Syst. Sci..
[17] Harold S. Stone,et al. An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations , 1973, JACM.
[18] Amir Schorr. Physical Parallel Devices are not Much Faster than Sequential Ones , 1983, Inf. Process. Lett..
[19] Erwin Engeler. Introduction to the theory of computation , 1973 .