default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed Computing, Volume 22
Volume 22, Number 1, April 2009
- Hagit Attiya
:
Editorial: It's all about change. 1 - Shing-Tsaan Huang, Chi-Hung Tzeng:
Distributed edge coloration for bipartite networks. 3-14 - Mirela Damian, Nagesh Javali:
Distributed construction of low-interference spanners. 15-28 - Josef Widder, Ulrich Schmid:
The Theta-Model: achieving synchrony without clocks. 29-47 - Bernadette Charron-Bost, André Schiper:
The Heard-Of model: computing in distributed systems with benign faults. 49-71
Volume 22, Number 2, October 2009
- Kai Engelhardt, Yoram Moses:
Causing communication closure: safe program composition with reliable non-FIFO channels. 73-91 - Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Maximum throughput of multiple access channels in adversarial environments. 93-116 - David Ilcinkas, Nicolas Nisse, David Soguet:
The cost of monotonicity in distributed graph searching. 117-127
Volume 22, Number 3, March 2010
- Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh:
Model checking transactional memories. 129-145 - Seth Pettie:
Distributed algorithms for ultrasparse spanners and linear size skeletons. 147-166 - Emanuele G. Fusco, Andrzej Pelc:
Broadcasting in UDG radio networks with missing and inaccurate information. 167-183 - Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers:
The k-simultaneous consensus problem. 185-195 - Yuh-Jzer Joung:
On quorum systems for group resources allocation. 197-214
Volume 22, Number 4, May 2010
- Amos Korman, Shay Kutten, David Peleg:
Proof labeling schemes. 215-233 - Magnús M. Halldórsson, Joseph Y. Halpern, Li Erran Li, Vahab S. Mirrokni:
On spectrum sharing games. 235-248 - Fabian Kuhn, Stefan Schmid, Roger Wattenhofer:
Towards worst-case churn resistant peer-to-peer systems. 249-267 - Alessandro Panconesi, Mauro Sozio:
Fast primal-dual distributed algorithms for scheduling and matching problems. 269-283
Volume 22, Numbers 5-6, August 2010
- Boaz Patt-Shamir:
Special issue on PODC 2008. 285 - Armando Castañeda, Sergio Rajsbaum:
New combinatorial topology bounds for renaming: the lower bound. 287-301 - Marcos Kawazoe Aguilera, Sam Toueg:
Adaptive progress: a gracefully-degrading liveness property. 303-334 - Piotr Zielinski:
Anti-Omega: the weakest failure detector for set agreement. 335-348 - Johannes Schneider, Roger Wattenhofer:
An optimal maximal independent set algorithm for bounded-independence graphs. 349-361 - Leonid Barenboim, Michael Elkin:
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. 363-379 - Marios Mavronicolas, Thomas Sauerwald:
The impact of randomization in smoothing networks. 381-411
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-30 00:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
