## Distributed Computing: 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001. ProceedingsThis book consitutes the refereed proceedings of the 15th International Conference on Distributed Computing, DISC 2001, held in Lisbon, Portugal, in October 2001. The 23 revised papers presented were carefully reviewed and selected from 70 submissions. Among the issues addressed are mutual exclusion, anonymous networks, distributed files systems, information diffusion, computation slicing, commit services, renaming, mobile search, randomized mutual search, message-passing networks, distributed queueing, leader election algorithms, Markov chains, network routing, ad-hoc mobile networks, and adding networks. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A Time Complexity Bound for Adaptive Mutual Exclusion | 1 |

QuorumBased Algorithms for Group Mutual Exclusion | 16 |

An Effective Characterization of Computability | 33 |

Copyright | |

21 other sections not shown

### Common terms and phrases

abort agents assume atomic atomic commitment availability black hole called chosen edges configuration consistent cuts contains coordinator counting network critical events defined definition delete denote directed graph distributed algorithm Distributed Computing Do-All execution expected number failures fibration find messages global graph G greedy routing hop count implementation initial leader election least Lemma linearizable long range contact lower bound machines Markov Markov chain Maurice Herlihy maximum message-passing minimum minimum spanning tree multicast mutual search algorithm node non-blocking number of steps operations output paper path performance phase problem Proc Proceedings processor proof properties protocol pseudosphere quorum system random receives regular predicates replicas ring round scheduler search message search tree Section self-stabilizing simplexes slice small world phenomenon spanning tree stabilizing subset synchronous Theorem timer token transaction transition uni-delivered update variable vertex vertices virtual virtual synchrony vote