Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings > Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems
Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings |
Gadi Taubenfeld
Springer Berlin Heidelberg
Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings
Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems
Authors

Robert Danek; Hyonho Lee

ARI Id

1664848208306_3766887

Access

Not Available Free

Pages

512-513

DOI

10.1007/978-3-540-87779-0_41

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-87779-0_41

Table of Contents of Book
Showing 1 to 20 of 46 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
The Mailbox Problem
Marcos K. Aguilera; Eli Gafni; Leslie Lamport
1-15
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
Amitanand S. Aiyer; Lorenzo Alvisi; Rida A. Bazzi; Allen Clement
16-31
How to Solve Consensus in the Smallest Window of Synchrony
Dan Alistarh; Seth Gilbert; Rachid Guerraoui; Corentin Travers
32-46
Local Terminations and Distributed Computability in Anonymous Networks
Jérémie Chalopin; Emmanuel Godard; Yves Métivier
47-62
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
Viacheslav Chernoy; Mordechai Shalom; Shmuel Zaks
63-77
Fast Distributed Approximations in Planar Graphs
Andrzej Czygrinow; Michal Hańćkowiak; Wojciech Wawrzyniak
78-92
Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
Robert Danek; Wojciech Golab
93-108
The Weakest Failure Detector for Message Passing Set-Agreement
Carole Delporte-Gallet; Hugues Fauconnier; Rachid Guerraoui; Andreas Tielmann
109-120
Local Maps: New Insights into Mobile Agent Algorithms
Bilel Derbel
121-136
r3: Resilient Random Regular Graphs
Stanko Dimitrov; P. Krishnan; Colin Mallows; Jean Meloche; Shalini Yajnik
137-151
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
Michael Dinitz
152-166
Constant-Space Localized Byzantine Consensus
Danny Dolev; Ezra N. Hoch
167-181
Optimistic Erasure-Coded Distributed Storage
Partha Dutta; Rachid Guerraoui; Ron R. Levy
182-196
On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing
Mahmoud Elhaddad; Rami Melhem
197-211
On Radio Broadcasting in Random Geometric Graphs
Robert Elsässer; Leszek Gąsieniec; Thomas Sauerwald
212-226
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
Paola Flocchini; David Ilcinkas; Nicola Santoro
227-241
Deterministic Rendezvous in Trees with Little Memory
Pierre Fraigniaud; Andrzej Pelc
242-256
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
Emanuele G. Fusco; Andrzej Pelc
257-273
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
Leszek Gąsieniec; Dariusz R. Kowalski; Andrzej Lingas; Martin Wahlen
274-288
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 46 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings