Monday, January 10

Session 7B

1:30 PM-3:35 PM
Room: Oregon/Nevada

1:30 Restructuring Ordered Binary Trees

William Evans, University of Arizona; and David Kirkpatrick, University of British Columbia, Canada

1:55 Faster Deterministic Dictionaries

Rasmus Pagh, BRICS, University of Aarhus, Denmark

2:20 Competitive Tree-Structured Dictionaries

Michael T. Goodrich, Johns Hopkins University

2:45 Even Strongly Universal Hashing is Pretty Fast

Mikkel Thorup, AT&T Labs - Research

3:10 Word Encoding Tree Connectivity Works

Stephen Alstrup, The IT University in Copenhagen, Denmark; Jens Peter Secher, University of Copenhagen, Denmark; and Mikkel Thorup, AT&T Labs - Research