default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed Computing, Volume 31
Volume 31, Number 1, February 2018
- Serafino Cicerone
, Gabriele Di Stefano, Alfredo Navarra:
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. 1-50 - Marco Carbone, Fabrizio Montesi, Carsten Schürmann:
Choreographies, logically. 51-67 - Magnús M. Halldórsson, Christian Konrad:
Computing large independent sets in a single round. 69-82
Volume 31, Number 2, April 2018
- Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz:
Distributed backup placement in networks. 83-98 - Zohir Bouzid, Michel Raynal, Pierre Sutra:
Anonymous obstruction-free (n, k)-set agreement with n-k+1 atomic read/write registers. 99-117 - Michael Elkin, Ofer Neiman:
On efficient distributed construction of near optimal routing schemes. 119-137 - Lélia Blin, Sébastien Tixeuil:
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. 139-166
Volume 31, Number 3, June 2018
- Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent limitations of hybrid transactional memory. 167-185 - Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith:
Parameterized model checking of rendezvous systems. 187-222 - Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed construction of purely additive spanners. 223-240 - Adrian Ogierman, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang:
Sade: competitive MAC under adversarial SINR. 241-254
Volume 31, Number 4, August 2018
- Yoram Moses:
Introduction to the special issue of papers from DISC 2015. 255 - David Doty, David Soloveichik:
Stable leader election in population protocols requires linear time. 257-271 - Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport:
Smoothed analysis of dynamic networks. 273-287 - Éric Goubault, Samuel Mimram, Christine Tasson:
Geometric and combinatorial views on asynchronous computability. 289-316 - Rati Gelashvili:
On the optimal space complexity of consensus for anonymous processes. 317-326
Volume 31, Number 5, October 2018
- Mercedes G. Merayo, Robert M. Hierons, Manuel Núñez:
Passive testing with asynchronous communications and timestamps. 327-342 - Othon Michail:
Terminating distributed construction of shapes and patterns in a fair solution of automata. 343-365 - Vincent Gramoli, Rachid Guerraoui, Vasileios Trigonakis:
TM2C: a software transactional memory for many-cores. 367-388 - Karolos Antoniadis, Peva Blanchard, Rachid Guerraoui, Julien Stainer:
The entropy of a distributed computation random number generation from memory interleaving. 389-417
Volume 31, Number 6, November 2018
- Valerie King, Seth Pettie, Jared Saia, Maxwell Young:
A resource-competitive jamming defense. 419-439 - Michael Mitzenmacher, Rasmus Pagh:
Simple multi-party set reconciliation. 441-453 - Othon Michail, Paul G. Spirakis:
How many cooks spoil the soup? 455-469 - Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Time-communication impossibility results for distributed transactional memory. 471-487 - Dan Alistarh, James Aspnes, Valerie King, Jared Saia:
Communication-efficient randomized consensus. 489-501 - Chen Avin, Robert Elsässer:
Breaking the $$\log n$$ log n barrier on rumor spreading. 503-513
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-23 00:33 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:
