1. Editor's foreword special issue on parallel and distributed computing, Part I

   • Jeffrey Scott Vitter

   EditorialNotes Pages: 1 - 3

2. Parallel complexity of logical query programs

   • Jeffrey D. Ullman
   • Allen Van Gelder

   OriginalPaper Pages: 5 - 42

3. Simulations among concurrent-write PRAMs

   • Faith E. Fich
   • Prabhakar Ragde
   • Avi Wigderson

   OriginalPaper Pages: 43 - 51

4. Communication-efficient parallel algorithms for distributed random-access machines

   • Charles E. Leiserson
   • Bruce M. Maggs

   OriginalPaper Pages: 53 - 77

5. Competitive snoopy caching

   • Anna R. Karlin
   • Mark S. Manasse
   • Daniel D. Sleator

   OriginalPaper Pages: 79 - 119

6. Programming simultaneous actions using common knowledge

   • Yoram Moses
   • Mark R. Tuttle

   OriginalPaper Pages: 121 - 169

7. Designing networks with compact routing tables

   • Greg N. Frederickson
   • Ravi Janardan

   OriginalPaper Pages: 171 - 190

8. Two probabilistic results on rectilinear steiner trees

   • Marshall W. Bern

   OriginalPaper Pages: 191 - 204

9. An algorithm for segment-dragging and its implementation

   • Bernard Chazelle

   OriginalPaper Pages: 205 - 221

10. Data transfers in networks

    • Hyeong -Ah Choi
    • S. Louis Hakimi

    OriginalPaper Pages: 223 - 245

11. A linear algorithm to find a rectangular dual of a planar triangulated graph

    • Jayaram Bhasker
    • Sartaj Sahni

    OriginalPaper Pages: 247 - 278

12. Parallel triangulation of a polygon in two calls to the trapezoidal map

    • Chee -Keng Yap

    OriginalPaper Pages: 279 - 288

13. Editor's foreword special issue on parallel and distributed computing, Part II

    • Jeffrey Scott Vitter

    EditorialNotes Pages: 289 - 291

14. Parallel computational geometry

    • A. Aggarwal
    • B. Chazelle
    • C. Yap

    OriginalPaper Pages: 293 - 327

15. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

    • Richard Cole
    • Uzi Vishkin

    OriginalPaper Pages: 329 - 346

16. Parallel construction of a suffix tree with applications

    • A. Apostolico
    • C. Iliopoulos
    • U. Vishkin

    OriginalPaper Pages: 347 - 365

17. Distributed match-making

    • Sape J. Mullender
    • Paul M. B. Vitányi

    OriginalPaper Pages: 367 - 391

18. A technique for constructing highly available services

    • Rivka Ladin
    • Barbara Liskov
    • Liuba Shrira

    OriginalPaper Pages: 393 - 420

19. On the analysis of cooperation and antagonism in networks of communicating processes

    • Paris C. Kanellakis
    • Scott A. Smolka

    OriginalPaper Pages: 421 - 450

20. The synthesis of communication protocols

    • Foto Afrati
    • Christos H. Papadimitriou
    • George Papageorgiou

    OriginalPaper Pages: 451 - 472

21. Decomposition and intersection of simple splinegons

    • David P. Dobkin
    • Diane L. Souvaine
    • Christopher J. Van Wyk

    OriginalPaper Pages: 473 - 485

22. Optimal VLSI graph embeddings in variable aspect ratio rectangles

    • Paul Czerwinski
    • Vijaya Ramachandran

    OriginalPaper Pages: 487 - 510

23. The general maximum matching algorithm of micali and vazirani

    • Paul A. Peterson
    • Michael C. Loui

    OriginalPaper Pages: 511 - 533

24. Parallel algorithms for some functions of two convex polygons

    • Mikhail J. Atallah
    • Michael T. Goodrich

    OriginalPaper Pages: 535 - 548

25. On finding optimal and near-optimal lineal spanning trees

    • Michael R. Fellows
    • Donald K. Friesen
    • Michael A. Langston

    OriginalPaper Pages: 549 - 560

26. Sorting in constant number of row and column phases on a mesh

    • John M. Marberg
    • Eli Gafni

    OriginalPaper Pages: 561 - 572