Distributed Computing, Volume 21

Volume 21, Number 1, June 2008

• Boaz Patt-Shamir, Allon Shafrir:
  Approximate distributed top- k queries. 1-22
  
• Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener:
  Contention-free MAC protocols for asynchronous wireless sensor networks. 23-42
  
• Danny Hendler, Nir Shavit:
  Solo-valency and the cost of coordination. 43-54
  
• Gregory Chockler, Murat Demirbas, Seth Gilbert, Nancy A. Lynch, Calvin C. Newport, Tina Nolte:
  Consensus and collision detectors in radio networks. 55-84
  

Volume 21, Number 2, July 2008

• Andrzej Pelc:
  Special issue on DISC 07. 85
  
• Dana Angluin, James Aspnes, David Eisenstat:
  A simple population protocol for fast robust approximate majority. 87-102
  
• Faith Ellen, Panagiota Fatourou, Eric Ruppert:
  The space complexity of unbounded timestamps. 103-115
  
• Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su:
  Time efficient k-shot broadcasting in known topology radio networks. 117-127
  
• Simon Fischer, Lars Olbrich, Berthold Vöcking:
  Approximating Wardrop equilibria with finitely many agents. 129-139
  
• Amos Korman, David Peleg:
  Compact separator decompositions in dynamic trees and applications to labeling schemes. 141-161
  

Volume 21, Number 3, September 2008

• Leslie Lamport:
  Implementing dataflow with threads. 163-181
  
• Dana Angluin, James Aspnes, David Eisenstat:
  Fast computation by population protocols with a leader. 183-199
  
• Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers:
  On the computability power and the robustness of set agreement-oriented failure detector classes. 201-222
  
• Robert M. Hierons, Hasan Ural:
  Checking sequences for distributed test architectures. 223-238
  

Volume 21, Number 4, October 2008

• Dan Holtby, Bruce M. Kapron, Valerie King:
  Lower bound for scalable Byzantine Agreement. 239-248
  
• Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld:
  Sequentially consistent versus linearizable counting networks. 249-269
  
• Thomas Moscibroda, Roger Wattenhofer:
  Coloring unstructured radio networks. 271-284
  
• Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
  On implementing omega in systems with weak reliability and synchrony assumptions. 285-314
  

Volume 21, Number 5, February 2009

• Roger Wattenhofer:
  Special issue on PODC 2007. 315
  
• Baruch Awerbuch, Rohit Khandekar:
  Greedy distributed optimization of multi-commodity flows. 317-329
  
• Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su:
  Broadcasting in UDG radio networks with unknown topology. 331-351
  
• Rachid Guerraoui, Maurice Herlihy, Petr Kuznetsov, Nancy A. Lynch, Calvin C. Newport:
  On the weakest failure detector ever. 353-366
  
• Haifeng Yu, Phillip B. Gibbons:
  Optimal inter-object correlation when replicating for availability. 367-384
  

Volume 21, Number 6, March 2009

• James Aspnes, Udi Wieder:
  The expansion and mixing time of skip graphs with applications. 385-393
  
• Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
  Distributed computing with advice: information sensitivity of graph coloring. 395-403
  
• Danny Hendler, Shay Kutten:
  Bounded-wait combining: constructing robust and high-throughput shared objects. 405-431
  
• Cristian Tapus, Jason Hickey:
  Distributed speculative execution for reliability and fault tolerance: an operational semantics. 433-455