DISC A

50 papers

YearTitle / Authors
2006A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.
Maleq Khan, Gopal Pandurangan
2006A Knowledge-Based Analysis of Global Function Computation.
Joseph Y. Halpern, Sabina Petride
2006A Lazy Snapshot Algorithm with Eager Validation.
Torvald Riegel, Pascal Felber, Christof Fetzer
2006A New Proof of the GHS Minimum Spanning Tree Algorithm.
Yoram Moses, Benny Shimony
2006Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.
Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt
2006Bounded Wait-Free
Rida A. Bazzi, Yin Ding
2006Brief Announcement Monitoring of Linear Distributed Computations.
Anton A. Esin, Rostislav Yavorskiy, Nikolay Zemtsov
2006Brief Announcement: Abortable and Query-Abortable Objects.
Marcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg
2006Brief Announcement: Communication-Optimal Implementation of Failure Detector Class à
Mikel Larrea, Alberto Lafuente, Joachim Wieland
2006Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules.
Joffroy Beauquier, Colette Johnen, Stéphane Messika
2006Brief Announcement: Convergence Analysis of Scalable Gossip Protocols.
Stacy Patterson, Bassam Bamieh, Amr El Abbadi
2006Brief Announcement: Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance.
Yu Chen, Wei Chen
2006Brief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems.
Alysson Neves Bessani, Miguel Correia, Joni da Silva Fraga, Lau Cheuk Lung
2006Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers.
Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman
2006Brief Announcement: Many Slices Are Better Than One.
Vinit A. Ogale, Vijay K. Garg
2006Brief Announcement: On Augmented Graph Navigability.
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2006Brief Announcement: Optimistic Algorithms for Partial Database Replication.
Nicolas Schiper, Rodrigo Schmidt, Fernando Pedone
2006Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays.
François Bonnet, Frederic Tronel, Spyros Voulgaris
2006Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks.
Srinivasan Krishnamurthy, R. Chandrasekaran, Neeraj Mittal, Subbarayan Venkatesan
2006Built-In Coloring for Highly-Concurrent Doubly-Linked Lists.
Hagit Attiya, Eshcar Hillel
2006Byzantine and Multi-writer K-Quorums.
Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi
2006Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture.
Lisa Higham, LillAnne Jackson, Jalal Kawash
2006Checking a Multithreaded Algorithm with
Leslie Lamport
2006Conflict Detection and Validation Strategies for Software Transactional Memory.
Michael F. Spear, Virendra J. Marathe, William N. Scherer III, Michael L. Scott
2006Constructing Shared Objects That Are Both Robust and High-Throughput.
Danny Hendler, Shay Kutten
2006Distributed Approximation Algorithms in Unit-Disk Graphs.
Andrzej Czygrinow, Michal Hanckowiak
2006Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings
Shlomi Dolev
2006Distributed Resource Allocation in Stream Processing Systems.
Cathy H. Xia, James Broberg, Zhen Liu, Li Zhang
2006Efficient Dynamic Aggregation.
Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster
2006Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.
Arthur Brady, Lenore Cowen
2006Exploring Gafni's Reduction Land: From
Achour Mostéfaoui, Michel Raynal, Corentin Travers
2006Fast Computation by Population Protocols with a Leader.
Dana Angluin, James Aspnes, David Eisenstat
2006Fault-Tolerant and Self-stabilizing Mobile Robots Gathering.
Xavier Défago, Maria Gradinariu, Stéphane Messika, Philippe Raipin Parvédy
2006Fully-Adaptive Algorithms for Long-Lived Renaming.
Alex Brodsky, Faith Ellen, Philipp Woelfel
2006Groupings and Pairings in Anonymous Networks.
Jérémie Chalopin, Shantanu Das, Nicola Santoro
2006Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects.
Yehuda Afek, Eran Shalom
2006Low-latency Atomic Broadcast in the presence of contention.
Piotr Zielinski
2006Oblivious Gradient Clock Synchronization.
Thomas Locher, Roger Wattenhofer
2006On Consistency of Encrypted Files.
Alina Oprea, Michael K. Reiter
2006On Minimizing the Number of ADMs in a General Topology Optical Network.
Michele Flammini, Mordechai Shalom, Shmuel Zaks
2006On Randomized Broadcasting in Power Law Networks.
Robert Elsässer
2006On Self-stabilizing Search Trees.
Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
2006One-Step Consensus Solvability.
Taisuke Izumi, Toshimitsu Masuzawa
2006Renaming in Message Passing Systems with Byzantine Failures.
Michael Okun, Amnon Barak
2006Robust Network Supercomputing with Malicious Processes.
Kishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Shvartsman
2006Subconsensus Tasks: Renaming Is Weaker Than Set Agreement.
Eli Gafni, Sergio Rajsbaum, Maurice Herlihy
2006The Weakest Failure Detectors to Boost Obstruction-Freedom.
Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov
2006Time and Communication Efficient Consensus for Crash Failures.
Bogdan S. Chlebus, Dariusz R. Kowalski
2006Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala
2006Transactional Locking II.
David Dice, Ori Shalev, Nir Shavit