Table of Contents

• Transactional Memory Today: A Status ReportMaurice Herlihy. 1 [doi]
• Navigating the Web 2.0 with GosspleAnne-Marie Kermarrec. 2 [doi]
• Transactional Scheduling for Read-Dominated WorkloadsHagit Attiya, Alessia Milani. 3-17 [doi]
• Performance Evaluation of Work Stealing for Streaming ApplicationsJonatha Anselmi, Bruno Gaujal. 18-32 [doi]
• Not All Fair Probabilistic Schedulers Are EquivalentIoannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis. 33-47 [doi]
• Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional MemoryBo Zhang, Binoy Ravindran. 48-53 [doi]
• Byzantine Convergence in Robot Networks: The Price of AsynchronyZohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil. 54-70 [doi]
• Deaf, Dumb, and Chatting Asynchronous RobotsYoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal. 71-85 [doi]
• Synchronization Helps Robots to Detect Black Holes in Directed GraphsAdrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti. 86-98 [doi]
• The Fault Detection ProblemAndreas Haeberlen, Petr Kuznetsov. 99-114 [doi]
• The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing SystemsCarole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. 115-128 [doi]
• Enhanced Fault-Tolerance through Byzantine Failure DetectionRida A. Bazzi, Maurice Herlihy. 129-143 [doi]
• Decentralized Polling with Respectable ParticipantsRachid Guerraoui, Kévin Huguenin, Anne-Marie Kermarrec, Maxime Monod. 144-158 [doi]
• Efficient Power Utilization in Multi-radio Wireless Ad Hoc NetworksRoy Friedman, Alex Kogan. 159-173 [doi]
• Adversarial Multiple Access Channel with Individual Injection RatesLakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki. 174-188 [doi]
• NB-FEB: A Universal Scalable Easy-to-Use Synchronization Primitive for Manycore ArchitecturesPhuong Hoai Ha, Philippas Tsigas, Otto J. Anshus. 189-203 [doi]
• Gradient Clock Synchronization Using Reference BroadcastsFabian Kuhn, Rotem Oshman. 204-218 [doi]
• Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree ConstructionToshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada. 219-224 [doi]
• On the Impact of Serializing Contention Management on STM PerformanceTomer Heber, Danny Hendler, Adi Suissa. 225-239 [doi]
• On the Efficiency of Atomic Multi-reader, Multi-writer Distributed MemoryBurkhard Englert, Chryssis Georgiou, Peter M. Musial, Nicolas C. Nicolaou, Alexander A. Shvartsman. 240-254 [doi]
• Abortable Fork-Linearizable StorageMatthias Majuntke, Dan Dobre, Marco Serafini, Neeraj Suri. 255-269 [doi]
• On the Computational Power of Shared ObjectsGadi Taubenfeld. 270-284 [doi]
• Weak Synchrony Models and Failure Detectors for Message Passing (::::k::::-)Set AgreementMartin Biely, Peter Robinson, Ulrich Schmid. 285-299 [doi]
• Unifying Byzantine Consensus Algorithms with Weak Interactive ConsistencyZarko Milosevic, Martin Hutle, André Schiper. 300-314 [doi]
• Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common GroundSylvie Delaët, Shlomi Dolev, Olivier Peres. 315-329 [doi]
• Proactive Fortification of Fault-Tolerant ServicesPaul D. Ezhilchelvan, Dylan Clarke, Isi Mitrani, Santosh K. Shrivastava. 330-344 [doi]
• Robustness of the Rotor-router MechanismEvangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik. 345-358 [doi]
• Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring AlgorithmYves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. 359-364 [doi]
• Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning TreesLinda Pagli, Giuseppe Prencipe. 365-371 [doi]