Table of Contents

• Refining the way to consensusRobbert van Renesse. 1 [doi]
• Memory models: a case for rethinking parallel languages and hardwareSarita V. Adve. 2 [doi]
• Emerging challenges and opportunities in parallel computing: the cretaceous redux?Bruce Hendrickson. 3 [doi]
• The life and times of a zookeeperFlavio Paiva Junqueira, Benjamin Reed. 4 [doi]
• Cassandra: structured storage system on a P2P networkAvinash Lakshman, Prashant Malik. 5 [doi]
• Pregel: a system for large-scale graph processingGrzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski. 6 [doi]
• Preventing versus curing: avoiding conflicts in transactional memoriesAleksandar Dragojevic, Rachid Guerraoui, Anmol V. Singh, Vasu Singh. 7-16 [doi]
• Dynamic atomic storage without consensusMarcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkhi, Alexander Shraer. 17-25 [doi]
• Randomized mutual exclusion in O(log N / log log N) RMRsDanny Hendler, Philipp Woelfel. 26-35 [doi]
• Max registers, counters, and monotone circuitsJames Aspnes, Hagit Attiya, Keren Censor. 36-45 [doi]
• Tight bounds for clock synchronizationChristoph Lenzen, Thomas Locher, Roger Wattenhofer. 46-55 [doi]
• Load balancing without regret in the bulletin board modelRobert D. Kleinberg, Georgios Piliouras, Éva Tardos. 56-62 [doi]
• Concurrent imitation dynamics in congestion gamesHeiner Ackermann, Petra Berenbrink, Simon Fischer, Martin Hoefer. 63-72 [doi]
• Extracting quorum failure detectorsVibhor Bhatt, Nicholas Christman, Prasad Jayanti. 73-82 [doi]
• The weakest failure detector for solving k-set agreementEli Gafni, Petr Kuznetsov. 83-91 [doi]
• Simple and efficient asynchronous byzantine agreement with optimal resilienceArpita Patra, Ashish Choudhary, C. Pandu Rangan. 92-101 [doi]
• Partial synchrony based on set timelinessMarcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. 102-110 [doi]
• Fast scalable deterministic consensus for crash failuresBogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski. 111-120 [doi]
• The forgiving graph: a distributed data structure for low stretch under adversarial attackThomas P. Hayes, Jared Saia, Amitabh Trehan. 121-130 [doi]
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphsRiko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig. 131-140 [doi]
• The flip markov chain and a randomising P2P protocolColin Cooper, Martin E. Dyer, Andrew J. Handley. 141-150 [doi]
• Correctness of gossip-based membership under message lossMaxim Gurevich, Idit Keidar. 151-160 [doi]
• Fast distributed random walksAtish Das Sarma, Danupon Nanongkai, Gopal Pandurangan. 161-170 [doi]
• Distributed and parallel algorithms for weighted vertex cover and other covering problemsChristos Koufogiannakis, Neal E. Young. 171-179 [doi]
• Return of the primal-dual: distributed metric facilitylocationSaurav Pandit, Sriram V. Pemmaraju. 180-189 [doi]
• The wireless synchronization problemShlomi Dolev, Seth Gilbert, Rachid Guerraoui, Fabian Kuhn, Calvin C. Newport. 190-199 [doi]
• SINR diagrams: towards algorithmically usable SINR models of wireless networksChen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty. 200-209 [doi]
• Coloring unstructured wireless multi-hop networksJohannes Schneider, Roger Wattenhofer. 210-219 [doi]
• Oblivious interference schedulingAlexander Fanghänel, Thomas Keßelheim, Harald Räcke, Berthold Vöcking. 220-229 [doi]
• Efficient broadcasting in known topology radio networks with long-range interferenceFrantisek Galcík, Leszek Gasieniec, Andrzej Lingas. 230-239 [doi]
• The effect of power-law degrees on the navigability of small worlds: [extended abstract]Pierre Fraigniaud, George Giakkoupis. 240-249 [doi]
• Bounding the locality of distributed routing algorithmsProsenjit Bose, Paz Carmi, Stephane Durocher. 250-259 [doi]
• Parsimonious flooding in dynamic graphsHervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud. 260-269 [doi]
• Brief announcement: Stateless distributed algorithms for generalized packing linear programsBaruch Awerbuch, Zhenghua Fu, Rohit Khandekar. 270-271 [doi]
• Brief announcement: concurrent non-commutative boosted transactionsEric Koskinen, Maurice Herlihy. 272-273 [doi]
• Brief announcement: distributed phase synchronization of dynamic set of processesR. K. Shyamasundar, Shivali Agarwal. 274-275 [doi]
• Brief announcement: how to speed-up fault-tolerant clock generation in VLSI systems-on-chip via pipeliningAndreas Dielacher, Matthias Függer, Ulrich Schmid. 276-277 [doi]
• Brief announcement: perfectly secure message transmission in directed networks re-visitedArpita Patra, Ashish Choudhary, C. Pandu Rangan. 278-279 [doi]
• Brief announcement: virtual world consistency: a new condition for STM systemsDamien Imbs, José Ramón González de Mendívil, Michel Raynal. 280-281 [doi]
• Brief announcement: a note on distributed stable matchingAlex Kipnis, Boaz Patt-Shamir. 282-283 [doi]
• On a selfish caching gamePietro Michiardi, Carla-Fabiana Chiasserini, Claudio Casetti, Chi-Anh La, Marco Fiore. 284-285 [doi]
• Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents--the notion of speedJoffroy Beauquier, Janna Burman, Julien Clement, Shay Kutten. 286-287 [doi]
• The disagreement power of an adversary: extended abstractCarole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann. 288-289 [doi]
• Brief announcement: weakest failure detectors via an egg-laying simulationAntonio Fernández Anta, Sergio Rajsbaum, Corentin Travers. 290-291 [doi]
• Brief announcement: optimization based rate allocation for application layer multicastJinyao Yan, Martin May, Bernhard Plattner. 292-293 [doi]
• Brief announcement: the price of anonymity: optimal consensus despite asynchrony, crash and anonymityFrançois Bonnet, Michel Raynal. 294-295 [doi]
• Brief announcement: minimum spanning trees and cone-based topology controlAlejandro Cornejo, Nancy A. Lynch. 296-297 [doi]
• Brief announcement: locality-based aggregate computation in wireless sensor networksJen-Yeu Chen, Gopal Pandurangan, Jianghai Hu. 298-299 [doi]
• Brief announcement: tight lower bounds for greedy routing in uniform small world ringsMartin Dietzfelbinger, Philipp Woelfel. 300-301 [doi]
• Brief announcement: optimal self-stabilizing multi-token ring: a randomized solutionAndrew Berns, Anurag Dasgupta, Sukumar Ghosh. 302-303 [doi]
• Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversaryValerie King, Jared Saia. 304-305 [doi]
• Brief announcement: PUSH, a DISC shellNoah Paul Evans, Eric Van Hensbergen. 306-307 [doi]
• Brief announcement: deaf, dumb, and chatting robotsYoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal. 308-309 [doi]
• Brief announcement: global consistency can be easier than point-to-point communicationPrasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piyush Bansal, Kannan Srinathan. 310-311 [doi]
• Vertical paxos and primary-backup replicationLeslie Lamport, Dahlia Malkhi, Lidong Zhou. 312-313 [doi]
• Brief announcement: topology knowledge affects probabilistic reliable communicationPranav K. Vasishta, Prasant Gopal, Anuj Gupta, Piyush Bansal, K. Srinathan. 314-315 [doi]
• Brief announcement: a platform for experimenting with mobile algorithms in a laboratoryMatthieu Roy, Marc-Olivier Killijian. 316-317 [doi]
• Brief announcement: the theory of network tracingHrishikesh B. Acharya, Mohamed G. Gouda. 318-319 [doi]
• Brief announcement: (more) efficient pruning of ad-hoc wireless networksEnoch Peserico. 320-321 [doi]
• Brief announcement: self-assembly as graph grammar as distributed systemAaron Sterling. 322-323 [doi]
• Distributed discovery of large near-cliquesZvika Brakerski, Boaz Patt-Shamir. 324-325 [doi]
• Brief announcement: lightweight key agreement and digital certificates for wireless sensor networksOscar García Morchon, Tobias Heer, Klaus Wehrle. 326-327 [doi]
• Brief announcement: distributed algorithms for approximating wireless network capacityMichael Dinitz. 328-329 [doi]
• Brief announcement: hardness of broadcasting in wireless networks with unreliable communicationFabian Kuhn, Nancy A. Lynch, Calvin C. Newport. 330-331 [doi]
• Brief announcement: complexity analysis and algorithm design for pipeline configuration in distributed networksYi Gu, Qishi Wu, Anne Benoit, Yves Robert. 332-333 [doi]
• Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networksHirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani. 334-335 [doi]
• Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbitersAlptekin Küpçü, Anna Lysyanskaya. 336-337 [doi]
• Brief announcement: collaborative measurement of upload speeds in P2P systemsJohn R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi. 338-339 [doi]
• Brief announcement: new bounds for the controller problemYuval Emek, Amos Korman. 340-341 [doi]