Volume 3,
1988
- Jeffrey Scott Vitter:
Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part I.
1-3
- Jeffrey D. Ullman, Allen Van Gelder:
Parallel Complexity of Logical Query Programs.
5-42
- Faith E. Fich, Prabhakar Ragde, Avi Wigderson:
Simulations Among Concurrent-Write PRAMs.
43-51
- Charles E. Leiserson, Bruce M. Maggs:
Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines.
53-77
- Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator:
Competitive Snoopy Caching.
77-119
- Yoram Moses, Mark R. Tuttle:
Programming Simultaneous Actions Using Common Knowledge.
121-169
- Greg N. Frederickson, Ravi Janardan:
Designing Networks with Compact Routing Tables.
171-190
- Marshall W. Bern:
Two Probabilistic Results on Rectilinear Steiner Trees.
191-204
- Bernard Chazelle:
An Algorithm for Segment-Dragging and Its Implementation.
205-221
- Hyeong-Ah Choi, S. Louis Hakimi:
Data Transfers in Networks.
223-245
- Jayaram Bhasker, Sartaj Sahni:
A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph.
247-278
- Chee-Keng Yap:
Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map.
279-288
- Jeffrey Scott Vitter:
Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part II.
289-291
- Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap:
Parallel Computational Geometry.
293-327
- Richard Cole, Uzi Vishkin:
The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time.
329-346
- Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin:
Parallel Construction of a Suffix Tree with Applications.
347-365
- Sape J. Mullender, Paul M. B. Vitányi:
Distributed Match-Making.
367-391
- Rivka Ladin, Barbara Liskov, Liuba Shrira:
A Technique for Constructing Highly Available Services.
393-420
- Paris C. Kanellakis, Scott A. Smolka:
On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes.
421-450
- Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
The Synthesis of Communication Protocols.
451-472
- David P. Dobkin, Diane L. Souvaine, Christopher J. Van Wyk:
Decomposition and Intersection of Simple Splinegons.
473-485
- Paul Czerwinski, Vijaya Ramachandran:
Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles.
487-510
- Paul A. Peterson, Michael C. Loui:
The General Maximum Matching Algorithm of Micali and Vazirani.
511-533
- Mikhail J. Atallah, Michael T. Goodrich:
Parallel Algorithms for Some Functions of two Convex Polygons.
535-548
- Michael R. Fellows, Donald K. Friesen, Michael A. Langston:
On Finding Optimal and Near-Optimal Lineal Spanning Trees.
549-560
- John M. Marberg, Eli Gafni:
Sorting in Constant Number of Row and Column Phases on a Mesh.
561-572
Copyright © Mon Nov 30 20:23:19 2009
by Michael Ley (ley@uni-trier.de)
