default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 512
Volume 512, November 2013
- Xavier Défago
, Franck Petit, Vincent Villain:
Preface. 1
- Andrew Berns, Sukumar Ghosh, Sriram V. Pemmaraju:
Building self-stabilizing overlay networks with the transitive closure framework. 2-14 - Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët:
Tight complexity analysis of population protocols with cover times - The ZebraNet example. 15-27 - Roberto Baldoni, Silvia Bonomi, Amir Soltani Nezhad:
A protocol for implementing byzantine storage in churn-prone distributed systems. 28-40 - Hagit Attiya, Armando Castañeda:
A non-topological proof for the impossibility of k-set agreement. 41-48 - Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing labeling and ranking in ordered trees. 49-66 - Davide Frey, Arnaud Jégou, Anne-Marie Kermarrec, Michel Raynal, Julien Stainer:
Trust-aware peer sampling: Performance and privacy tradeoffs. 67-83 - Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Dynamic regular registers in systems with churn. 84-97 - Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis:
The computational power of simple protocols for self-awareness on graphs. 98-118 - Rizal Mohd Nor, Mikhail Nesterenko, Christian Scheideler:
Corona: A stabilizing deterministic message-passing skip list. 119-129 - Damien Imbs, Michel Raynal:
The weakest failure detector to implement a register in asynchronous systems with hybrid communication. 130-142
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:37 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:
