Sunday, January 17

Session 15

4:10 PM-5:30 PM
Room: Carroll
Chair: S. Muthukrishnan, Bell Laboratories, Lucent Technologies

4:10-4:27 Parallel Virtual Memory
F. Dehne, Carleton University, Ottawa, Canada; W. Dittrich, Bosch Telecom, Backnang, Germany; D. Hutchinson and A. Maheshwari, Carleton University, Ottawa, Canada
4:30-4:47 I/O-Complexity of Graph Algorithms
M. V. Kameshwar and Abhiram Ranade, Indian Institute of Technology Bombay, India
4:50-5:07 I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions
Pankaj K. Agarwal and Lars Arge, Duke University; Gerth S. Brodal, New BRICS, University of Aarhus, Denmark; and Jeffrey S. Vitter, Duke University
5:10-5:27 Indexing Schemes for Random Points
Elias Koutsoupias and David Scot Taylor, University of California, Los Angeles

SODA'99 Home


Program Updates

Author Index




tjf, 9/12/98, MMD, 11/2/98