Session 1 Data Structures I

9:00 AM-10:40 AM
Room: Liberty A
Chair: Valerie King, University of Victoria, Canada

9:00-9:17 Synopsis Data Structures for Massive Data Sets: Phillip B. Gibbons, Bell Laboratories, Lucent Technologies; and Yossi Matias, Tel-Aviv University, Israel and Bell Laboratories
9:20-9:37 Dynamic LCA Queries on Trees: Richard Cole, Courant Institute of Mathematical Sciences, New York University; and Ramesh Hariharan, Indian Institute of Science, Bangalore, India
9:40-9:57 Checking Priority Queues: Ulrich Finkler, IBM T. J. Watson Research Center; and Kurt Mehlhorn, Max-Planck Institut für Informatik, Saarbrücken, Germany
10:00-10:17 Stop minding Your P's and Q's: A Simplified O(n) Planar Embedding Algorithm: John Boyer, UWI.Com - The Internet Forms Company; and Wendy Myrvold, University of Victoria, Canada
10:20-10:37 Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees: Christian A. Duncan, Michael T. Goodrich, and Stephen G. Kobourov, Johns Hopkins University

tjf, 9/16/98; MMD, 10/13/98