Sunday Morning, January 28, 1996
Sherwood Room

Session 2

Chair: David Applegate, AT&T Bell Laboratories
9:00-9:20 Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees
Marek Karpinski, University of Bonn, Germany; Lawrence L. Larmore, University of Nevada, Las Vegas; and Wojciech Rytter, Warsaw University, Poland
9:25-9:45 Time and Space Efficient Method-Lookup in Object-Oriented Programming Languages
S. Muthukrishnan, DIMACS, Rutgers University; and Martin Muller, University of New Mexico
9:50-10:10 Worst-Case Efficient Priority Queues
Gerth S. Brodal, University of Aarhus, Denmark
10:15-10:35 On RAM Priority Queues
Mikkel Thorup, University of Copenhagen, Denmark

Registration | Hotel Information | Transportation | Author Index