default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th OPODIS 2011: Toulouse, France
- Antonio Fernández Anta, Giuseppe Lipari, Matthieu Roy:
Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings. Lecture Notes in Computer Science 7109, Springer 2011, ISBN 978-3-642-25872-5 - Marco Ajmone Marsan:
From Energy-Efficient Networking to ZEN. 1-3 - George B. Mertzios
, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. 4-17 - Bo Zhang, Binoy Ravindran:
A Quorum-Based Replication Framework for Distributed Software Transactional Memory. 18-33 - Arpita Patra:
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. 34-49 - Peng Lu, Binoy Ravindran, Changsoo Kim:
Enhancing the Performance of High Availability Lightweight Live Migration. 50-64 - Yehuda Afek, Hillel Avni, Nir Shavit:
Towards Consistency Oblivious Programming. 65-79 - Edmund L. Wong, Isaac Levy, Lorenzo Alvisi, Allen Clement, Michael Dahlin:
Regret Freedom Isn't Free. 80-95 - Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. 96-111 - Petr Kuznetsov, Srivatsan Ravi:
On the Cost of Concurrency in Transactional Memory. 112-127 - Jeremy P. Erickson, James H. Anderson:
Response Time Bounds for G-EDF without Intra-Task Precedence Constraints. 128-142 - Cyril Gavoille, Quentin Godfroy, Laurent Viennot:
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. 143-158 - Alain Cournier, Stephane Rovedakis, Vincent Villain:
The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction. 159-174 - Zohir Bouzid, Pierre Sutra, Corentin Travers:
Anonymous Agreement: The Janus Algorithm. 175-190 - Emanuele G. Fusco, Andrzej Pelc:
Communication Complexity of Consensus in Anonymous Message Passing Systems. 191-206 - Trevor Brown, Joanna Helga:
Non-blocking k-ary Search Trees. 207-221 - Jan Olaf Blech:
Probabilistic Compositional Reasoning for Guaranteeing Fault Tolerance Properties. 222-234 - Joffroy Beauquier, Janna Burman:
Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering. 235-250 - François Bonnet, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil:
Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction. 251-265 - Bharath Balasubramanian, Vijay K. Garg:
Fused State Machines for Fault Tolerance in Distributed Systems. 266-282 - Matthias Majuntke, Dan Dobre, Christian Cachin, Neeraj Suri:
Fork-Consistent Constructions from Registers. 283-298 - Martin Biely, Peter Robinson, Ulrich Schmid:
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. 299-312 - Maurice Herlihy, Nir Shavit:
On the Nature of Progress. 313-328 - Pavel Raykov, Nicolas Schiper, Fernando Pedone:
Byzantine Fault-Tolerance with Commutative Commands. 329-342 - Chiahsun Ho, Shelby H. Funk:
Partially Non-Preemptive Dual Priority Multiprocessor Scheduling. 343-356 - Mohammad Alaggan, Sébastien Gambs, Anne-Marie Kermarrec:
Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy. 357-377 - Christian Glacet, Nicolas Hanusse, David Ilcinkas:
The Impact of Edge Deletions on the Number of Errors in Networks. 378-391 - Xavier Vilaça, João Leitão, Miguel Correia, Luís E. T. Rodrigues:
N-party BAR Transfer. 392-408 - Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie:
Computing with Pavlovian Populations. 409-420 - Samuel Guilbault, Andrzej Pelc:
Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs. 421-434 - Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman:
Robust Network Supercomputing without Centralized Control. 435-450 - David Ilcinkas, Ahmed Mouhamadou Wade:
On the Power of Waiting When Exploring Public Transportation Systems. 451-464 - Vijay K. Garg, John Bridgman, Bharath Balasubramanian:
Accurate Byzantine Agreement with Feedback. 465-480 - Petar Tsankov, Mohammad Torabi Dashti, David A. Basin:
Constructing Mid-Points for Two-Party Asynchronous Protocols. 481-496 - Samaneh Navabpour, Borzoo Bonakdarpour, Sebastian Fischmeister:
Optimal Instrumentation of Data-flow in Concurrent Data Structures. 497-512 - Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro:
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. 513-527 - Gurulingesh Raravi, Björn Andersson, Konstantinos Bletsas:
Provably Good Scheduling of Sporadic Tasks with Resource Sharing on a Two-Type Heterogeneous Multiprocessor Platform. 528-543 - Gal Bar-Nissan, Danny Hendler, Adi Suissa:
A Dynamic Elimination-Combining Stack Algorithm. 544-561
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 2026-01-22 00:07 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:
