Tuesday, January 11

Session 11C

1:45 PM-3:50 PM
Room: Gold Rush B

1:45 Towards A Theory of Cache-Efficient Algorithms
Sandeep Sen, University of North Carolina, Chapel Hill and Indian Institute of Technology-New Delhi, India; and Siddhartha Chatterjee, University of North Carolina, Chapel Hil
2:10 Efficient Bundle Sorting
Yossi Matias and Eran Segal, Tel-Aviv University, Israel; and Jeffrey Scott Vitter, Duke University
2:35 Fast Concurrent Access to Parallel Disks
Peter Sanders, Max-Planck-Institute for Computer Science, Germany; Sebastian Egner and Jan Korst, Philips Research Laboratories, The Netherlands
3:00 On External Memory Graph Traversal
Adam L. Buchsbaum, AT&T Labs - Research; Michael Goldwasser, Princeton University; Suresh Venkatasubramanian, Stanford University; and Jeffery R. Westbrook, AT&T Labs - Research
3:25 Deterministic Broadcasting in Unknown Radio Networks
Bogdan S. Chlebus, Uniwersytet Warszawski, Poland; Leszek Gasieniec and Alan Gibbons, The University of Liverpool, United Kingdom; Andrzej Pelc, Université du Québec à Hull, Canada; and Wojciech Rytter, Uniwersytet Warszawski, Poland and The University of Liverpool, United Kingdom

© 1999, Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 11/7/99; Last Updated 11/7/99