Volume 24,
Number 1,
1999
Volume 24,
Number 2,
1999
Volume 24,
Numbers 3-4,
1999
- Frank K. H. A. Dehne:
Guest Editor's Introduction.
173-176
- Paolo Ferragina, Fabrizio Luccio:
String Search in Coarse-Grained Parallel Computers.
177-194
- Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda:
d-Dimensional Range Search on Multicomputers.
195-208
- Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
The Complexity of Parallel Multisearch on Coarse-Grained Machines.
209-242
- Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor:
Design and Implementation of a Practical Parallel Delaunay Algorithm.
243-269
- Xiaotie Deng, Binhai Zhu:
A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.
270-286
- William F. McColl, Alexandre Tiskin:
Memory-Efficient Matrix Multiplication in the BSP Model.
287-297
- Young Won Lim, Prashanth B. Bhat, Viktor K. Prasanna:
Efficient Algorithms for Block-Cyclic Redistribution of Arrays.
298-330
- Erich Kaltofen, A. Lobo:
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields.
331-348
- Thomas H. Cormen, James C. Clippinger:
Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI.
349-370
- E. L. G. Saukas, S. W. Song:
A Note on Parallel Selection on Coarse-Grained Multicomputers.
371-380
- Micah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Modeling Parallel Bandwidth: Local versus Global Restrictions.
381-404
- Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis:
BSP versus LogP.
405-422
Copyright © Sat Nov 28 22:25:39 2009
by Michael Ley (ley@uni-trier.de)