21. DISC 2007: Lemesos, Cyprus

Invited Talks

• Burkhard Monien, Karsten Tiemann:
  Routing and Scheduling with Incomplete Information. 1-2
  
• David Peleg:
  Time-Efficient Broadcasting in Radio Networks. 3-4
  

Regular Papers

• Michel Raynal:
  A Subjective Visit to Selected Topics in Distributed Computing. 5-6
  
• Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi:
  Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions. 7-19
  
• Dana Angluin, James Aspnes, David Eisenstat:
  A Simple Population Protocol for Fast Robust Approximate Majority. 20-32
  
• Baruch Awerbuch, Christian Scheideler:
  A Denial-of-Service Resistant DHT. 33-47
  
• Roberto Baldoni, Kleoni Ioannidou, Alessia Milani:
  Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks. 48-62
  
• Joffroy Beauquier, Julien Clément, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy:
  Self-stabilizing Counting in Mobile Sensor Networks with a Base Station. 63-76
  
• Edward Bortnikov, Israel Cidon, Idit Keidar:
  Scalable Load-Distance Balancing. 77-91
  
• Janna Burman, Shay Kutten:
  Time Optimal Asynchronous Self-stabilizing Spanning Tree. 92-107
  
• Jérémie Chalopin, Shantanu Das, Nicola Santoro:
  Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. 108-122
  
• Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu:
  Weakening Failure Detectors for k -Set Agreement Via the Partition Approach. 123-138
  
• Gregory Chockler, Rachid Guerraoui, Idit Keidar:
  Amnesic Distributed Storage. 139-151
  
• Andrzej Czygrinow, Michal Hanckowiak:
  Distributed Approximations for Packing in Unit-Disk Graphs. 152-164
  
• Carole Delporte-Gallet, Hugues Fauconnier, Felix C. Freiling, Lucia Draque Penso, Andreas Tielmann:
  From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors. 165-178
  
• Bilel Derbel, Cyril Gavoille, David Peleg:
  Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. 179-192
  
• Danny Dolev, Ezra N. Hoch:
  On Self-stabilizing Synchronous Actions Despite Byzantine Attacks. 193-207
  
• Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Calvin C. Newport:
  Gossiping in a Multi-channel Radio Network. 208-222
  
• Faith Ellen, Panagiota Fatourou, Eric Ruppert:
  The Space Complexity of Unbounded Timestamps. 223-237
  
• Simon Fischer, Lars Olbrich, Berthold Vöcking:
  Approximating Wardrop Equilibria with Finitely Many Agents. 238-252
  
• Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su:
  Energy and Time Efficient Broadcasting in Known Topology Radio Networks. 253-267
  
• Beat Gfeller, Nicola Santoro, Peter Widmayer:
  A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. 268-282
  
• Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski:
  On the Message Complexity of Indulgent Consensus. 283-297
  
• Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada:
  Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result. 298-312
  
• Amos Korman, David Peleg:
  Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. 313-327
  
• Dariusz R. Kowalski, Michal Strojnowski:
  On the Communication Surplus Incurred by Faulty Processors. 328-342
  
• Shay Kutten, Toshimitsu Masuzawa:
  Output Stability Versus Time Till Output. 343-357
  
• Matthew Lang, Paolo A. G. Sivilotti:
  A Distributed Maximal Scheduler for Strong Fairness. 358-372
  
• Shuang Liang, Ke Chen, Song Jiang, Xiaodong Zhang:
  Cost-Aware Caching Algorithms for Distributed Storage Servers. 373-387
  
• Thomas Locher, Remo Meier, Stefan Schmid, Roger Wattenhofer:
  Push-to-Pull Peer-to-Peer Live Streaming. 388-402
  
• Michael G. Merideth, Michael K. Reiter:
  Probabilistic Opaque Quorum Systems. 403-419
  
• Vinit A. Ogale, Vijay K. Garg:
  Detecting Temporal Logic Predicates on Distributed Computations. 420-434
  
• Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
  Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. 435-449
  
• Gadi Taubenfeld:
  Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms. 450-464
  
• Piotr Zielinski:
  Automatic Classification of Eventual Failure Detectors. 465-479
  

Brief Announcements

• Alysson Neves Bessani, Miguel Correia, Henrique Moniz, Nuno Ferreira Neves, Paulo Veríssimo:
  When 3f+1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus. 480-481
  
• Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
  On the Complexity of Distributed Greedy Coloring. 482-484
  
• Colette Johnen, Lisa Higham:
  Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks. 485-487
  
• Virendra J. Marathe, Michael F. Spear, Michael L. Scott:
  Transaction Safe Nonblocking Data Structures. 488-489
  
• Tal Mizrahi, Yoram Moses:
  Long Live Continuous Consensus. 490-491
  
• Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah:
  Fully Distributed Algorithms for Convex Optimization Problems. 492-493
  
• Michael Okun:
  On the Power of Impersonation Attacks. 494-495
  
• Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan:
  Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. 496-498
  
• Rodrigo Schmidt, Fernando Pedone:
  A Formal Analysis of the Deferred Update Technique. 499-500
  

DISC 20th Anniversary

• Michel Raynal, Sam Toueg, Shmuel Zaks:
  DISC at Its 20th Anniversary (Stockholm, 2006). 501-503
  
• Leslie Lamport:
  DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems. 504
  
• Nancy A. Lynch:
  DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982. 505
  
• Michael O. Rabin:
  DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems. 506-508
  

Last update Tue May 21 18:12:50 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page