DIMACS Workshop on Distributed Data and Structures

May 10 - 11, 1999
Princeton University, Computer Science Department, Princeton, NJ

Organizers:

Yuri Breitbart, Lucent Technologies, Bell Labs, yuri@research.bell-labs.com

Sajal Das, University of North Texas, Denton, das@cs.unt.edu

Nicola Santoro, Carleton University, Ottawa, Canada, nicola.santoro@carleton.ca

Peter Widmayer, ETH Zurich, Switzerland, widmayer@inf.ethz.ch

Workshop Program:

Preliminary Workshop Program:

Sunday, May 9, 1999

 8:00 pm       Reception


Monday, May 10, 1999


 8:30  - 8:50  Registration

 8:50  - 9:00  Welcome
               Robert Sedgewick, DIMACS Co-Director

 9:00  - 9:30  Distributed Directories as a Data Structure Problem
               Maurice Herlihy

 9:30 - 10:00  High-Availability in Scalable Distributed Data Structures
               Witold Litwin

10:00 - 10:30  Break


10:30 - 11:00  Synopsis Data Structures: Cached Surrogates for
               Large Remote Data Sets
               Phillip B. Gibbons

11:00 - 11:30  Balanced and Distributed Search Trees with Logarithmic Costs.
               Enrico Nardelli, Adriano Di Pasquale

11:30 - 12:00  Distributed suffix trees
               Esko Ukkonen

12:00 - 2:00   Lunch

 2:00 - 2:30   Parallel Disk Systems: Basic Operations
               Sanguthevar Rajasekaran

 2:30 - 3:00   Implementing B+Tree Index for Data
               Distributed  over Multiple Disks
               Ekow J. Otoo, K. W. Wong, F. Zhou

 3:00 - 3:30   An Optimal Disk Allocation Strategy for Partial Match Queries
               on Non-Uniform Cartesian Product Files
               Cristina Pinotti, Sajal Das

 3:30 - 4:00   Break

 4:00 - 4:30   Selection and Sorting on Distributed Data
               Nicola Santoro

 4:30 - 5:00   The Dynamic of Distributed Object Naming
               by Sense of Direction
               Paola Flocchini

 5:00 - 5:30   Scalable Concurrent Priority Queue Algorithms
               Nir Shavit, Asaph Zemach

 6:00 -        Dinner



Tuesday, May 11, 1999


 9:00  - 9:30  Black Box Correctness Tests for Distributed Data Structures
               Phillip B. Gibbons

 9:30 - 10:00  Dense Trees: a new structure for interconnection
               F. Luccio, L. Pagli

10:00 - 10:30  Break


10:30 - 11:00  Fast Deterministic Parallel  Branch-and-Bound.
               Geppino Pucci

11:00 - 11:30  The Complexity of Parallel Multisearch
               on Coarse-Grained Machines
               Andrea Pietracaprina, A. Baumker, W. Dittrich

11:30 - 12:00  A Key Tool for Optimality in the State Model
               Vincent Villain

12:00 - 2:00   Lunch

 2:00 - 2:30   Time and Space Optimality of Distributed Depth-First
               Token Circulation Algorithms
               Franck Petit

 2:30 - 3:00   Optimal PIF In Tree Networks
               Alain Bui, Ajoy K. Datta, Franck Petit, Vincent Villain

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage