20. DISC 2006:
Stockholm, Sweden
Shlomi Dolev (Ed.):
Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings.
Lecture Notes in Computer Science 4167 Springer 2006, ISBN 3-540-44624-9
- Achour Mostéfaoui, Michel Raynal, Corentin Travers:
Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement.
1-15

- Michael Okun, Amnon Barak:
Renaming in Message Passing Systems with Byzantine Failures.
16-30

- Hagit Attiya, Eshcar Hillel:
Built-In Coloring for Highly-Concurrent Doubly-Linked Lists.
31-45

- Xavier Défago, Maria Gradinariu, Stéphane Messika, Philippe Raipin Parvédy:
Fault-Tolerant and Self-stabilizing Mobile Robots Gathering.
46-60

- Dana Angluin, James Aspnes, David Eisenstat:
Fast Computation by Population Protocols with a Leader.
61-75

- Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore:
On Self-stabilizing Search Trees.
76-89

- Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster:
Efficient Dynamic Aggregation.
90-104

- Jérémie Chalopin, Shantanu Das, Nicola Santoro:
Groupings and Pairings in Anonymous Networks.
105-119

- Yoram Moses, Benny Shimony:
A New Proof of the GHS Minimum Spanning Tree Algorithm.
120-135

- Joseph Y. Halpern, Sabina Petride:
A Knowledge-Based Analysis of Global Function Computation.
136-150

- Leslie Lamport:
Checking a Multithreaded Algorithm with +CAL.
151-163

- Lisa Higham, LillAnne Jackson, Jalal Kawash:
Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture.
164-178

- Michael F. Spear, Virendra J. Marathe, William N. Scherer III, Michael L. Scott:
Conflict Detection and Validation Strategies for Software Transactional Memory.
179-193

- David Dice, Ori Shalev, Nir Shavit:
Transactional Locking II.
194-208

- Yehuda Afek, Eran Shalom:
Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects.
209-223

- Taisuke Izumi, Toshimitsu Masuzawa:
One-Step Consensus Solvability.
224-237

- Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.
238-253

- Alina Oprea, Michael K. Reiter:
On Consistency of Encrypted Files.
254-268

- Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt:
Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.
269-283

- Torvald Riegel, Pascal Felber, Christof Fetzer:
A Lazy Snapshot Algorithm with Eager Validation.
284-298

- Rida A. Bazzi, Yin Ding:
Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients.
299-313

- Bogdan S. Chlebus, Dariusz R. Kowalski:
Time and Communication Efficient Consensus for Crash Failures.
314-328

- Eli Gafni, Sergio Rajsbaum, Maurice Herlihy:
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement.
329-338

- Arthur Brady, Lenore Cowen:
Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.
339-354

- Maleq Khan, Gopal Pandurangan:
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.
355-369

- Robert Elsässer:
On Randomized Broadcasting in Power Law Networks.
370-384

- Andrzej Czygrinow, Michal Hanckowiak:
Distributed Approximation Algorithms in Unit-Disk Graphs.
385-398

- Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov:
The Weakest Failure Detectors to Boost Obstruction-Freedom.
399-412

- Alex Brodsky, Faith Ellen, Philipp Woelfel:
Fully-Adaptive Algorithms for Long-Lived Renaming.
413-427

- Danny Hendler, Shay Kutten:
Constructing Shared Objects That Are Both Robust and High-Throughput.
428-442

- Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi:
Byzantine and Multi-writer K-Quorums.
443-458

- Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On Minimizing the Number of ADMs in a General Topology Optical Network.
459-473

- Kishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Shvartsman:
Robust Network Supercomputing with Malicious Processes.
474-488

- Cathy H. Xia, James Broberg, Zhen Liu, Li Zhang:
Distributed Resource Allocation in Stream Processing Systems.
489-504

- Piotr Zielinski:
Low-latency Atomic Broadcast in the presence of contention.
505-519

- Thomas Locher, Roger Wattenhofer:
Oblivious Gradient Clock Synchronization.
520-533

- Marcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg:
Brief Announcement: Abortable and Query-Abortable Objects.
534-536

- Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman:
Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers.
537-539

- Stacy Patterson, Bassam Bamieh, Amr El Abbadi:
Brief Announcement: Convergence Analysis of Scalable Gossip Protocols.
540-542

- Joffroy Beauquier, Colette Johnen, Stéphane Messika:
Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules.
543-547

- Vinit A. Ogale, Vijay K. Garg:
Brief Announcement: Many Slices Are Better Than One.
548-550

- Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker:
Brief Announcement: On Augmented Graph Navigability.
551-553

- Alysson Neves Bessani, Miguel Correia, Joni da Silva Fraga, Lau Cheuk Lung:
Brief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems.
554-556

- Nicolas Schiper, Rodrigo Schmidt, Fernando Pedone:
Brief Announcement: Optimistic Algorithms for Partial Database Replication.
557-559

- François Bonnet, Frederic Tronel, Spyros Voulgaris:
Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays.
560-562

- Yu Chen, Wei Chen:
Brief Announcement: Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance.
563-565

- Anton Esin, Rostislav Yavorskiy, Nikolay Zemtsov:
Brief Announcement Monitoring of Linear Distributed Computations.
566-568

- Mikel Larrea, Alberto Lafuente, Joachim Wieland:
Brief Announcement: Communication-Optimal Implementation of Failure Detector Class àP.
569-571

- Srinivasan Krishnamurthy, R. Chandrasekaran, Neeraj Mittal, Subbarayan Venkatesan:
Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks.
572-574

Last update Mon May 20 16:12:33 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page