25. PODC 2006: Denver, Colorado, USA

• Maurice Herlihy:
  The art of multiprocessor programming. 1-2
  
• Danny Dolev:
  Century papers at the first quarter-century milestone. 3-4
  
• Jon M. Kleinberg:
  Distributed social systems. 5-6
  

Graph algorithms

• Fabian Kuhn, Roger Wattenhofer:
  On the complexity of distributed graph coloring. 7-15
  
• Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter:
  Quorum placement in networks: minimizing network congestion. 16-25
  
• Amos Korman, Shay Kutten:
  Distributed verification of minimum spanning trees. 26-34
  

Game theory

• Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer:
  When selfish meets evil: byzantine players in a virus inoculation game. 35-44
  
• Avrim Blum, Eyal Even-Dar, Katrina Ligett:
  Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. 45-52
  
• Ittai Abraham, Danny Dolev, Rica Gonen, Joseph Y. Halpern:
  Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. 53-62
  
• Idit Keidar, Roie Melamed, Ariel Orda:
  EquiCast: scalable multicast with selfish users. 63-71
  

Algorithms

• Bogdan Caprita, Jason Nieh, Clifford Stein:
  Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. 72-81
  
• Srikanta Tirthapura, Bojian Xu, Costas Busch:
  Sketching asynchronous streams over a sliding window. 82-91
  
• Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
  Adversarial queuing on the multiple-access channel. 92-101
  
• Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster, Ran Wolff:
  Veracity radius: capturing the locality of distributed computations. 102-111
  
• Werner Vogels:
  Life is not a state-machine: the long road from research to production. 112
  

Peer-to-peer

• Damon Mosk-Aoyama, Devavrat Shah:
  Computing separable functions via gossip. 113-122
  
• Laurent Massoulié, Erwan Le Merrer, Anne-Marie Kermarrec, Ayalvadi J. Ganesh:
  Peer counting and sampling in overlay networks: random walk methods. 123-132
  
• Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer:
  On the topologies formed by selfish peers. 133-142
  

Agreement problems

• Ariel Daliot, Danny Dolev:
  Self-stabilizing byzantine agreement. 143-152
  
• Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers:
  Irreducibility and additivity of set agreement-oriented failure detector classes. 153-162
  
• Matthias Fitzi, Martin Hirt:
  Optimally efficient multi-valued byzantine agreement. 163-168
  
• Idit Keidar, Alexander Shraer:
  Timeliness, failure-detectors, and consensus performance. 169-178
  

Graph algorithms

• Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
  Oracle size: a new measure of difficulty for communication tasks. 179-187
  
• Ittai Abraham, Cyril Gavoille:
  Object location using path separators. 188-197
  
• Goran Konjevod, Andréa W. Richa, Donglin Xia:
  Optimal-stretch name-independent compact routing in doubling metrics. 198-207
  
• Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju:
  Local approximation schemes for topology control. 208-217
  

Shared memory

• Yehuda Afek, Eli Gafni, Adam Morrison:
  Common2 extended to stacks and unbounded concurrency. 218-227
  
• Panagiota Fatourou, Nikolaos D. Kallimanis:
  Single-scanner multi-writer snapshot implementations are fast! 228-237
  
• Wojciech M. Golab, Danny Hendler, Philipp Woelfel:
  An O(1) RMRs leader election algorithm. 238-247
  

Fault tolerance

• Rachid Guerraoui, Marko Vukolic:
  How fast can a very robust read be? 248-257
  
• Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Nitin H. Vaidya:
  Reliable broadcast in radio networks: the bounded collision case. 258-264
  
• Kannan Srinathan, C. Pandu Rangan:
  Possibility and complexity of probabilistic reliable communication in directed networks. 265-274
  

Algorithms and lower bounds

• Rui Fan, Nancy A. Lynch:
  An Omega (n log n) lower bound on the cost of mutual exclusion. 275-284
  
• Dan Holtby, Bruce M. Kapron, Valerie King:
  Lower bound for scalable Byzantine Agreement. 285-291
  
• Dana Angluin, James Aspnes, David Eisenstat:
  Stably computable predicates are semilinear. 292-299
  

Shared memory synchronization

• Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov:
  Synchronizing without locks is inherently expensive. 300-307
  
• Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
  Transactional contention management as a non-clairvoyant scheduling problem. 308-315
  
• Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
  Towards a theory of transactional contention managers. 316-317
  

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