1. A cautious scheduler for multistep transactions

   • Naoki Katoh
   • Tiko Kameda
   • Toshihide Ibaraki

   OriginalPaper Pages: 1 - 26

2. Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram

   • Colm Ó'Dúnlaing
   • Micha Sharir
   • Chee Yap

   OriginalPaper Pages: 27 - 59

3. Algorithms for corner stitched data-structures

   • Mark A. Shand

   OriginalPaper Pages: 61 - 80

4. A linear time randomizing algorithm for searching ranked functions

   • Eitan Zemel

   OriginalPaper Pages: 81 - 90

5. The set LCS problem

   • D. S. Hirschberg
   • L. L. Larmore

   OriginalPaper Pages: 91 - 95

6. On problem transformability in VLSI

   • Scot Hornick
   • Majid Sarrafzadeh

   OriginalPaper Pages: 97 - 111

7. Global wire routing in two-dimensional arrays

   • R. M. Karp
   • F. T. Leighton
   • V. V. Vazirani

   OriginalPaper Pages: 113 - 129

8. Some problems in computational geometry

   • Claire Mathieu

   Problem Section Pages: 131 - 134

9. Editor's foreword

   • Bernard Chazelle

   EditorialNotes Pages: 135 - 136

10. A faster divide-and-conquer algorithm for constructing delaunay triangulations

    • Rex A. Dwyer

    OriginalPaper Pages: 137 - 151

11. A sweepline algorithm for Voronoi diagrams

    • Steven Fortune

    OriginalPaper Pages: 153 - 174

12. On approximation behavior of the greedy triangulation for convex polygons

    • Christos Levcopoulos
    • Andrzej Lingas

    OriginalPaper Pages: 175 - 193

13. Geometric applications of a matrix-searching algorithm

    • Alok Aggarwal
    • Maria M. Klawe
    • Robert Wilber

    OriginalPaper Pages: 195 - 208

14. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

    • Leonidas Guibas
    • John Hershberger
    • Robert E. Tarjan

    OriginalPaper Pages: 209 - 233

15. An improved algorithm for finding the median distributively

    • Francis Chin
    • H. F. Ting

    OriginalPaper Pages: 235 - 249

16. A minimum-area circuit forl-selection

    • Pavol Ďuriš
    • Ondrej Sýkora
    • Imrich Vrto

    OriginalPaper Pages: 251 - 265

17. Minimizing channel density in standard cell layout

    • Jean R. S. Blair
    • S. Kapoor
    • Kenneth J. Supowit

    OriginalPaper Pages: 267 - 282

18. Algorithms for the compilation of regular expressions into PLAs

    • Anna R. Karlin
    • Howard W. Trickey
    • Jeffrey D. Ullman

    OriginalPaper Pages: 283 - 314

19. The longest common subsequence problem revisited

    • A. Apostolico
    • C. Guerra

    OriginalPaper Pages: 315 - 336

20. Computing on a free tree via complexity-preserving mappings

    • Bernard Chazelle

    OriginalPaper Pages: 337 - 361

21. Preface special issue on robotics

    • Chee -Keng Yap

    EditorialNotes Pages: 363 - 365

22. A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space

    • S. Sifrony
    • M. Sharir

    OriginalPaper Pages: 367 - 402

23. Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape

    • Vladimir J. Lumelsky
    • Alexander A. Stepanov

    OriginalPaper Pages: 403 - 430

24. Motion planning with inertial constraints

    • Colm Ó'Dúnlaing

    OriginalPaper Pages: 431 - 475

25. On multiple moving objects

    • Michael Erdmann
    • Tomás Lozano-Pérez

    OriginalPaper Pages: 477 - 521

26. Optimal piecewise linear motion of an object among obstacles

    • Christos H. Papadimitriou
    • Ellen B. Silverberg

    OriginalPaper Pages: 523 - 539

27. On the existence and synthesis of multifinger positive grips

    • B. Mishra
    • J. T. Schwartz
    • M. Sharir

    OriginalPaper Pages: 541 - 558