default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed Computing, Volume 29
Volume 29, Number 1, February 2016
- Yuezhou Lv, Thomas Moscibroda:
Fair and resilient Incentive Tree mechanisms. 1-16 - Yuda Zhao, Haifeng Yu, Binbin Chen
:
Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions. 17-38 - Jaroslav Nesetril, Patrice Ossona de Mendez:
A distributed low tree-depth decomposition algorithm for bounded expansion classes. 39-49 - Avery Miller, Andrzej Pelc:
Time versus cost tradeoffs for deterministic rendezvous in networks. 51-64 - Liam Roditty, Roei Tov:
Close to linear space routing schemes. 65-74
Volume 29, Number 2, April 2016
- Hagit Attiya:
Special issue in memory of Berthold Vöcking. 75 - Magnús M. Halldórsson, Pradipta Mitra:
Nearly optimal bounds for distributed wireless scheduling in the SINR model. 77-88 - Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran:
Simple and optimal randomized fault-tolerant rumor spreading. 89-104 - Heiner Ackermann, Petra Berenbrink, Simon Fischer, Martin Hoefer:
Concurrent imitation dynamics in congestion games. 105-125 - Christoph Lenzen, Roger Wattenhofer:
Tight bounds for parallel randomized load balancing. 127-142 - Hoda Akbari, Petra Berenbrink, Thomas Sauerwald:
A simple approach for adapting continuous load balancing processes to discrete settings. 143-161
Volume 29, Number 3, June 2016
- Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
DEX: self-healing expanders. 163-185 - Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Rendezvous in networks in spite of delay faults. 187-205 - Othon Michail, Paul G. Spirakis:
Simple and efficient local codes for distributed stable network construction. 207-237
Volume 29, Number 4, August 2016
- Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Upper and lower bounds for deterministic broadcast in powerline communication networks. 239-250 - Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers:
Universal constructions that ensure disjoint-access parallelism and wait-freedom. 251-277 - Rob J. van Glabbeek, Peter Höfner, Marius Portmann, Wee Lum Tan:
Modelling and verifying the AODV routing protocol. 279-315
Volume 29, Number 5, October 2016
- Petra Berenbrink, Robert Elsässer, Tom Friedetzky:
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. 317-339 - Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Randomized mutual exclusion on a multiple access channel. 341-359 - Mohsen Eftekhari Hesari, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Distributed algorithms for barrier coverage using relocatable sensors. 361-376 - Peter Jeavons, Alex Scott, Lei Xu:
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring. 377-393 - Nir Shavit, Gadi Taubenfeld:
The computability of relaxed data structures: queues and stacks as examples. 395-407
Volume 29, Number 6, November 2016
- Yuval Emek, Erez Kantor, David Peleg:
On the effect of the deployment setting on broadcasting in Euclidean radio networks. 409-434 - Sébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial:
Byzantine gathering in networks. 435-457 - Béatrice Bérard, Pascal Lafourcade, Laure Millet, Maria Potop-Butucaru, Yann Thierry-Mieg, Sébastien Tixeuil:
Formal verification of mobile robot protocols. 459-487
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-12-05 22:25 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:
