Abstract is missing.
- Introduction: Distributed Data & Structures 2Yuri Breitbart, Sajal K. Das, Nicola Santoro, Peter Widmayer.
- Optimal PIF in Tree NetworksAlain Bui, Ajoy Kumar Datta, Franck Petit, Vincent Villain. 1-16
- Conflict-Free Access to Subcubes of Mixed-Radix HypercubesSajal K. Das, Maria Cristina Pinotti. 17-24
- The Dynamics of Distributed Object Naming by Sense of DirectionPaola Flocchini. 25-37
- Design Issues for Scalable Availability LH* Schemes with Recor GroupingWitold Litwin, Jai Menon, Tore Risch, Thomas J. E. Schwarz. 38-55
- Dese Trees: A New Structure for InterconnectionFabrizio Luccio, Linda Pagli. 56-72
- Fully Dynamic Balanced and Distributed Search Trees with Logarithmic CostsAdriano Di Pasquale, Enrico Nardelli. 73-90
- Time and Space Optimality of Distributed Depth-First Token Circulation AlgorithmsFranck Petit, Vincent Villain. 91-106
- Concurrent Priority Queue AlgorithmsNir Shavit, Asaph Zemach. 107-132
- A Key Tool for Optimality in the State ModelVincent Villain. 133-148