-
1
-
-
0023432638
-
Simulation of idealized parallel computers on more realistic ones
-
Air, H., Hagerup, T., Mehlhorn, K., Preparata, F.P.: Simulation of idealized parallel computers on more realistic ones, SIAM Journal on Computing, 16, 5 (1987) 808-835
-
(1987)
SIAM Journal on Computing
, vol.16
, Issue.5
, pp. 808-835
-
-
Air, H.1
Hagerup, T.2
Mehlhorn, K.3
Preparata, F.P.4
-
3
-
-
84976858135
-
A terMtop before its time
-
Bell, G.: A terMtop before its time, Comm. of the AGM, 35, 8 (1992), 26-47
-
(1992)
Comm. of the AGM
, vol.35
, Issue.8
, pp. 26-47
-
-
Bell, G.1
-
4
-
-
0021412333
-
A framework for solving VLSI graph layout problems
-
Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems, Journal of Computer and Systems Sciences, 28, 2 (1984), 300-342
-
(1984)
Journal of Computer and Systems Sciences
, vol.28
, Issue.2
, pp. 300-342
-
-
Bhatt, S.N.1
Leighton, F.T.2
-
5
-
-
52449147995
-
Area-time lower-bound techniques with application to sorting
-
Bilardi, G., Preparata, F. P.: Area-time lower-bound techniques with application to sorting, Algorithmica, 1, (1986), 65-91
-
(1986)
Algorithmica
, vol.1
, pp. 65-91
-
-
Bilardi, G.1
Preparata, F.P.2
-
6
-
-
0020165894
-
A critique of network speed in VLSI models of computation
-
Bilardi, G., Pracchi, M., Preparata, F.P.: A critique of network speed in VLSI models of computation, IEEE Journal Solid-State Circuits, 17(1982), 696-702
-
(1982)
IEEE Journal Solid-State Circuits
, vol.17
, pp. 696-702
-
-
Bilardi, G.1
Pracchi, M.2
Preparata, F.P.3
-
7
-
-
0016046965
-
The parallel evaluation of genera] arithmetic expressions
-
Brent, R.P.: The parallel evaluation of genera] arithmetic expressions, Journal of the ACM, 21,2 (1974)201-206
-
(1974)
Journal of the ACM
, vol.21
, Issue.2
, pp. 201-206
-
-
Brent, R.P.1
-
8
-
-
0022093446
-
A model of computation for VLSI with related complexity results
-
Chazelle, B., Monier, L.: A model of computation for VLSI with related complexity results, Journal of the ACM, 32, (1985) s73-s88
-
(1985)
Journal of the ACM
, vol.32
, pp. s73-s88
-
-
Chazelle, B.1
Monier, L.2
-
9
-
-
0016313543
-
An observation of time-storage tradeoff
-
Cook, S.A.: An observation of time-storage tradeoff, JOSS, 9,3, (1974)308-316
-
(1974)
JOSS
, vol.9
, Issue.3
, pp. 308-316
-
-
Cook, S.A.1
-
10
-
-
0003149350
-
Towards a complexity theory of synchronous parallel computation
-
Cook, S.A.: Towards a complexity theory of synchronous parallel computation, Enseign. Math. 27,(1981) 99-124
-
(1981)
Enseign. Math.
, vol.27
, pp. 99-124
-
-
Cook, S.A.1
-
12
-
-
84938166141
-
Very high-speed computing systems
-
Flynn, M.J.: Very high-speed computing systems, Proc. IEEE 54, 12, (1966), 1901-1909
-
(1966)
Proc. IEEE
, vol.54
, Issue.12
, pp. 1901-1909
-
-
Flynn, M.J.1
-
13
-
-
0011677031
-
Randomized routing on fat-trees
-
Micali, S., editor, JAI Press, Inc.
-
Greenberg, R. I., Leiserson, C.E.: Randomized routing on fat-trees. In Micali, S., editor, Randomness and Computation, 345-374. JAI Press, Inc., 1989.
-
(1989)
Randomness and Computation
, pp. 345-374
-
-
Greenberg, R.I.1
Leiserson, C.E.2
-
14
-
-
0346535290
-
Deterministic simulations of PRAMs on bounded-degree networks
-
Monticello, Illinois
-
Herley, K, Bilardi, G.: Deterministic simulations of PRAMs on bounded-degree networks, Proceedings of the 26th Annum Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, (1988), 1084-1093
-
(1988)
Proceedings of the 26th Annum Allerton Conference on Communication, Control, and Computing
, pp. 1084-1093
-
-
Herley, K.1
Bilardi, G.2
-
15
-
-
0024091390
-
Paxallel hashing-an efficient implementation of shared memory
-
Karlin, A., Upfal, E.: Paxallel hashing-an efficient implementation of shared memory, Journal of the ACM, 35, 4(1988) 876-892
-
(1988)
Journal of the ACM
, vol.35
, Issue.4
, pp. 876-892
-
-
Karlin, A.1
Upfal, E.2
-
17
-
-
0025234213
-
A complexity theory of efficient parallel algorithms
-
Kruskal, C.P., Rudolf, L., Snir, M.: A complexity theory of efficient parallel algorithms, Theoretical Computer Science, 71 (1990) 95-132
-
(1990)
Theoretical Computer Science
, vol.71
, pp. 95-132
-
-
Kruskal, C.P.1
Rudolf, L.2
Snir, M.3
-
18
-
-
0019923189
-
Why systolic architectures?
-
Kung, H.T.: Why systolic architectures? Computer Magazine, 15, 1, (1982), 37-46
-
(1982)
Computer Magazine
, vol.15
, Issue.1
, pp. 37-46
-
-
Kung, H.T.1
-
19
-
-
0002178126
-
The Circuit Value problem is logspace complete for P
-
Ladner, R.E.: The Circuit Value problem is logspace complete for P, SIGACT News 7, 1(1975), 18-20
-
(1975)
SIGACT News
, vol.7
, Issue.1
, pp. 18-20
-
-
Ladner, R.E.1
-
21
-
-
0041891564
-
-
Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, Massachusetts, September
-
Leighton, F.T.: Layouts for the Shuffle-Exchange Graph and Lower Bound Techniques/or VLS1, Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, Massachusetts, September 1981
-
(1981)
Layouts for the Shuffle-Exchange Graph and Lower Bound Techniques/or VLS1
-
-
Leighton, F.T.1
-
22
-
-
0022141776
-
Fat-trees: Universal networks for hardwareefficient supercomputing
-
Leiserson, C.E.: Fat-trees: Universal networks for hardwareefficient supercomputing, IEEE Tramsactions on Computers, C-34,10 (1985) 892-900
-
(1985)
IEEE Tramsactions on Computers
, vol.C-34
, Issue.10
, pp. 892-900
-
-
Leiserson, C.E.1
-
23
-
-
52449145552
-
Communication-efficient parallel algorithms for distributed random-access machines
-
Leiserson, C.E., Maggs, B.M.: Communication-efficient parallel algorithms for distributed random-access machines. A1-gorithmica, 3 (1988) 53-77
-
(1988)
A1-gorithmica
, vol.3
, pp. 53-77
-
-
Leiserson, C.E.1
Maggs, B.M.2
-
25
-
-
0021522108
-
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
-
Mehlhorn, K., Vishkin, U.: Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories, Acta Informatica, 21, 4 (1984) 339-374
-
(1984)
Acta Informatica
, vol.21
, Issue.4
, pp. 339-374
-
-
Mehlhorn, K.1
Vishkin, U.2
-
26
-
-
0017495099
-
The indirect binary n-cube microprocessor array
-
Pease, M.C.: The indirect binary n-cube microprocessor array, IEEE Transactions on Computers, C-26, 5, (1977), 458-473
-
(1977)
IEEE Transactions on Computers
, vol.C-26
, Issue.5
, pp. 458-473
-
-
Pease, M.C.1
-
28
-
-
0019563297
-
The cube-connected cycles: A versatile network for parallel computation
-
Preparata, F.P., Vuillemin, J.: The cube-connected cycles: A versatile network for parallel computation, Communications of the ACM, 24, 5 (1981)300-309
-
(1981)
Communications of the ACM
, vol.24
, Issue.5
, pp. 300-309
-
-
Preparata, F.P.1
Vuillemin, J.2
-
30
-
-
0006036793
-
Three-dimensional integrated circuitry
-
I.T. Kung, B. Sproull, and G. Steele, editors, Computer Science Press
-
Rosenberg, A.L.: Three-dimensional integrated circuitry. In I.T. Kung, B. Sproull, and G. Steele, editors, Proceedings of the CMU Conference on VLSI Systems and Computations, Computer Science Press (1981), 69-80
-
(1981)
Proceedings of the CMU Conference on VLSI Systems and Computations
, pp. 69-80
-
-
Rosenberg, A.L.1
-
31
-
-
0020289466
-
Architecture and applications of the ttEP multiprocessor system
-
Smith, B. J.: Architecture and applications of the ttEP multiprocessor system, Signal Processing IV, 298, (1981), 241-248
-
(1981)
Signal Processing
, vol.4
, Issue.298
, pp. 241-248
-
-
Smith, B.J.1
-
32
-
-
0001036397
-
Type architectures, shared memory, and the corollary of modest potential
-
Snyder, L.: Type architectures, shared memory, and the corollary of modest potential, Annual Review of Computer Science, 1 (1986) 289-317
-
(1986)
Annual Review of Computer Science
, vol.1
, pp. 289-317
-
-
Snyder, L.1
-
33
-
-
0004217544
-
-
Ph.D. dissertation, Carnegie-Mellon University, August
-
Thompson, C.D.: A Complexity Theory for VLSI. Ph.D. dissertation, Carnegie-Mellon University, August 1980
-
(1980)
A Complexity Theory for VLSI
-
-
Thompson, C.D.1
-
34
-
-
0023266822
-
How to share memory in a distributed system
-
Upfal, E., Wigderson, A.: How to share memory in a distributed system, Journal of the ACM, 34, 1(1987) 116-127
-
(1987)
Journal of the ACM
, vol.34
, Issue.1
, pp. 116-127
-
-
Upfal, E.1
Wigderson, A.2
-
35
-
-
0025467711
-
A bridging model for parallel computation
-
Valiant, L.G.: A bridging model for parallel computation, Communications of the ACM, 33,8 (1990), 103-111
-
(1990)
Communications of the ACM
, vol.33
, Issue.8
, pp. 103-111
-
-
Valiant, L.G.1
-
36
-
-
0002655387
-
General purpose parallel architectures
-
[J.v. Leeuwen, ed.], Elsevier-MIT Press
-
Valiant, L.G.: General purpose parallel architectures, Handbook for Theor. Computer Science [J.v. Leeuwen, ed.], Elsevier-MIT Press, 1990
-
(1990)
Handbook for Theor. Computer Science
-
-
Valiant, L.G.1
-
37
-
-
0019532794
-
Universality considerations in VLSI circuits
-
Valiant, L.G.: Universality considerations in VLSI circuits, IEEE Transactions on Computers, C-30, 2, (1981) 135-140
-
(1981)
IEEE Transactions on Computers
, vol.C-30
, Issue.2
, pp. 135-140
-
-
Valiant, L.G.1
|