Accepted papers
The papers are published in Springer LNCS 2508. Online access is avaliable on
their German
site and NY
site.
(order is arbitrary)
-
Secure Computation Without Agreement
Shafi Goldwasser and Yehuda Lindell
-
A Simple Coding-Theory Based Characterization of Conditions for Solving Consensus
Roy Friedman
-
Tight bounds for shared memory systems accessed by Byzantine processes
Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca Wright
-
Condition-Based Protocols for Set Agreement Problems
Achour Mostefaoui and Sergio Rajsbaum and Michel Raynal and Matthieu Roy
-
Distributed Agreement and its Relation with Error-Correcting Codes
Roy Friedman and Achour Mostefaoui and Sergio Rajsbaum and Michel Raynal
-
Ruminations on Domain-Based Reliable Broadcast
Svend Frolund and Fernando Pedone
-
Stateless Termination Detection
Gideon Stupp
-
Assignment-based Partitioning in a Condition Monitoring System
Yongqiang Huang and Hector Garcia-Molina
-
Failure detection sequencers: necessary and sufficient information about failures to solve predicate detection
Felix C. Gartner and Stefan Pleisch
-
Wait-Free n-set Consensus when Inputs are Restricted
Hagit Attiya and Zvi Avidor
-
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures
Maurice Herlihy and Victor Luchangco and Mark Moir
-
Bounding Work and Communication in Robust Cooperative Computation
Bogdan Chlebus and Leszek Gasieniec and Dariusz Kowalski and Alex A. Shvartsman
-
Transformations of Self-Stabilizing Algorithms
Kleoni Ioannidou
-
RAMBO: A Reconfigurable Atomic Memory Service
Nancy Lynch and Alex Shvartsman
-
A practical multi-word compare-and-swap operation
Timothy L Harris and Keir Fraser and Ian A Pratt
-
The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses
D. Agrawal and A. El Abbadi and A. Mostefaoui and M. Raynal and M. Roy
-
Early-Delivery Dynamic Atomic Broadcast
Ziv Bar-Joseph, Idit Keidar, and Nancy Lynch
-
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
D. Koukopoulos and M. Mavronikolas and S. Nikoletseas and P. Spirakis
-
Ad Hoc Membership for Scalable Applications
Tal Anker, Danny Dolev, Ilya Shnayderman
-
Improved Compact Routing Scheme for Chordal Graphs
Yon Dourisboure and Cyril Gavoille
-
Failure Detection Lower Bounds on Registers and Consensus
C. Delporte and H. Fauconnier and Rachid Guerraoui
-
An Efficient Universal Construction for Message-Passing Systems
Partha Dutta and Svend Frolund and Rachid Guerraoui and Bastian Pochon
-
Minimal Byzantine Storage
Jean-Philippe Martin and Lorenzo Alvisi and Michael Dahlin
-
On the impact of fast failure detectors on real-time fault-tolerant systems
Marcos Aguilera and Gerard Le Lann and Sam Toueg
-
Simple Wait-free Multireader Registers
Paul Vitanyi
Brief Announcements
-
Shifting Arguments Without Global Time
Jerry James and Jed Miadowicz and Sivaprasath Murugeshan and Mangal Singh
-
Clock Synchronization using Packet Streams
Philipp Blum and Lothar Thiele
-
A Sufficient Condition to Transform <>S into <>P in Asynchronous Systems
Antonio Fernández and Mikel Larrea and Sergio Arévalo
-
Subscription Partitioning and Routing in Content-based Publish/Subscribe Networks
Yi-Min Wang, Lili Qiu, Dimitris Achlioptas, Gautam Das, Paul Larson and Helen J. Wang
Winner of best students paper award
Assignment-based Partitioning in a Condition Monitoring System
Yongqiang Huang and Hector Garcia-Molina
(Yongqiang Huang is the winner)
Last updated: 17-sep-2002
DISC02 home page