OPODIS B

38 papers

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