1. Discrete logarithms inGF(p)

   • Don Coppersmith
   • Andrew M. Odlzyko
   • Richard Schroeppel

   OriginalPaper Pages: 1 - 15

2. The complexity of hashing with lazy deletion

   • Christopher J. Van Wyk
   • Jeffrey Scott Vitter

   OriginalPaper Pages: 17 - 29

3. Shortest paths in euclidean graphs

   • Robert Sedgewick
   • Jeffrey Scott Vitter

   OriginalPaper Pages: 31 - 48

4. Visibility of disjoint polygons

   • Takao Asano
   • Tetsuo Asano
   • Hiroshi Imai

   OriginalPaper Pages: 49 - 63

5. Area-time lower-bound techniques with applications to sorting

   • G. Bilardi
   • F. P. Preparata

   OriginalPaper Pages: 65 - 91

6. Edge-skeletons in arrangements with applications

   • H. Edelsbrunner

   OriginalPaper Pages: 93 - 109

7. The pairing heap: A new form of self-adjusting heap

   • Michael L. Fredman
   • Robert Sedgewick
   • Robert E. Tarjan

   OriginalPaper Pages: 111 - 129

8. Fractional cascading: I. A data structuring technique

   • Bernard Chazelle
   • Leonidas J. Guibas

   OriginalPaper Pages: 133 - 162

9. Fractional cascading: II. Applications

   • Bernard Chazelle
   • Leonidas J. Guibas

   OriginalPaper Pages: 163 - 191

10. Geometric complexity of some location problems

    • D. T. Lee
    • Y. F. Wu

    OriginalPaper Pages: 193 - 211

11. Channel routing in knock-knee mode: Simplified algorithms and proofs

    • Kurt Mehlhorn
    • F. P. Preparata
    • M. Sarrafzadeh

    OriginalPaper Pages: 213 - 221

12. Two-layer channel routing with vertical unit-length overlap

    • Shaodi Gao
    • Susanne Hambrusch

    OriginalPaper Pages: 223 - 232

13. Optimal book embeddings of the FFT, benes, and barrel shifter networks

    • Richard A. Games

    OriginalPaper Pages: 233 - 250

14. AnO(ND) difference algorithm and its variations

    • Eugene W. Myers

    OriginalPaper Pages: 251 - 266

15. Introduction

    • Dale Skeen

    EditorialNotes Pages: 269 - 269

16. On-the-fly, incremental, consistent reading of entire databases

    • Callon Pu

    OriginalPaper Pages: 271 - 287

17. Bit transposition for very large scientific and statistical databases

    • Harry K. T. Wong
    • J. Z. Li
    • Linda Wong

    OriginalPaper Pages: 289 - 309

18. An evaluation of buffer management strategies for relational database systems

    • Hong -Tai Chou
    • David J. DeWitt

    OriginalPaper Pages: 311 - 336

19. Understanding the implications of view update policies

    • Claudia Bauzer Medeiros
    • Frank Wm. Tompa

    OriginalPaper Pages: 337 - 360

20. A time bound on the materialization of some recursively defined views

    • Yannis E. Ioannidis

    OriginalPaper Pages: 361 - 385

21. Introduction: New approaches to linear programming

    • Nimrod Megiddo

    OriginalPaper Pages: 387 - 394

22. A modification of karmarkar's linear programming algorithm

    • Robert J. Vanderbei
    • Marc S. Meketon
    • Barry A. Freedman

    OriginalPaper Pages: 395 - 407

23. An extension of Karmarkar's algorithm for linear programming using dual variables

    • Michael J. Todd
    • Bruce P. Burrell

    OriginalPaper Pages: 409 - 424

24. A polynomial newton method for linear programming

    • Guy de Ghellinck
    • Jean -Philippe Vial

    OriginalPaper Pages: 425 - 453

25. A multiplicative barrier function method for linear programming

    • Masao Iri
    • Hiroshi Imai

    OriginalPaper Pages: 455 - 482

26. A monotonic projective algorithm for fractional linear programming

    • Kurt M. Anstreicher

    OriginalPaper Pages: 483 - 498

27. Determining basic variables of optimal solutions in Karmarkar's new LP algorithm

    • Masakazu Kojima

    OriginalPaper Pages: 499 - 515

28. A projective method for linear programming with box-type constraints

    • G. Rinaldi

    OriginalPaper Pages: 517 - 527

29. Homotopy techniques in linear programming

    • J. L. Nazareth

    OriginalPaper Pages: 529 - 535

30. The iterative step in the linear programming algorithm of N. Karmarkar

    • C. E. Blair

    OriginalPaper Pages: 537 - 539