Journals in DBLP

J. Parallel Distrib. Comput.
1992, volume: 16, number: 3

1. Howard Jay Siegel, Seth Abraham, William L. Bain, Kenneth E. Batcher, Thomas L. Casavant, Doug DeGroot, Jack B. Dennis, David C. Douglas, Tse-Yun Feng, James R. Goodman, Alan Huang, Harry F. Jordan, J. Robert Jamp, Yale N. Patt, Alan Jay Smith, James E. Smith, Lawrence Snyder, Harold S. Stone, Russ Tuck, Benjamin W. Wah
   Report of the Purdue Workshop on Grand Challenges in Computer Architecture for the Support of High Performance Computing. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 1992, v:16, n:3, pp:199-211 [Journal]
   
2. Todd Heywood, Sanjay Ranka
   A Practical Hierarchical Model of Parallel Computation. I. The Model. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 1992, v:16, n:3, pp:212-232 [Journal]
   
3. Todd Heywood, Sanjay Ranka
   A Practical Hierarchical Model of Parallel Computation. II. Binary Tree and FFT Algorithms. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 1992, v:16, n:3, pp:233-249 [Journal]
   
4. Yosi Ben-Asher, David Egozi, Assaf Schuster
   2-D SIMD Algorithms for Perfect Shuffle Networks. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 1992, v:16, n:3, pp:250-257 [Journal]
   
5. Efstathios D. Kyriakis-Bitzaros, Constantinos E. Goutis
   An Efficient Decompostion Technique for Mapping Nested Loops with Constant Dependencies into Regular Processor Arrays. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 1992, v:16, n:3, pp:258-264 [Journal]
   
6. Tadao Takaoka, Kiyomi Umehara
   An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 1992, v:16, n:3, pp:265-270 [Journal]