Table of Contents

• The inherent complexity of transactional memory and what to do about itHagit Attiya. 1-5 [doi]
• Transactional predication: high-performance concurrent sets and maps for STMNathan Grasso Bronson, Jared Casper, Hassan Chafi, Kunle Olukotun. 6-15 [doi]
• On maintaining multiple versions in STMDmitri Perelman, Rui Fan, Idit Keidar. 16-25 [doi]
• The multiplicative power of consensus numbersDamien Imbs, Michel Raynal. 26-35 [doi]
• The ::::k::::-bakery: local-spin ::::k::::-exclusion using non-atomic reads and writesRobert Danek. 36-44 [doi]
• Group mutual exclusion in ::::O::::(log ::::n::::) RMRVibhor Bhatt, Chien-Chung Huang. 45-54 [doi]
• On asymmetric progress conditionsDamien Imbs, Michel Raynal, Gadi Taubenfeld. 55-64 [doi]
• Brief announcement: view transactions: transactional model with relaxed consistency checksYehuda Afek, Adam Morrison, Moran Tzafrir. 65-66 [doi]
• Brief announcement: single-version permissive STMHagit Attiya, Eshcar Hillel. 67-68 [doi]
• Brief announcement: NUMA-aware transactional memoryKai Lu, Ruibo Wang, Xicheng Lu. 69-70 [doi]
• Brief announcement: actions in the twilight - concurrent irrevocable transactions and inconsistency repairAnnette Bieniusa, Arie Middelkoop, Peter Thiemann. 71-72 [doi]
• Brief announcement: on enhancing concurrency in distributed transactional memoryBo Zhang, Binoy Ravindran. 73-74 [doi]
• Brief announcement: queuing or priority queuing? on the design of cache-coherence protocols for distributed transactional memoryBo Zhang, Binoy Ravindran. 75-76 [doi]
• Brief announcement: k-shot distributed broadcasting in radio networksParaschos Koutris, Aris Pagourtzis. 77-78 [doi]
• Brief announcement: a shared disk on distributed storageStefan Vijzelaar, Herbert Bos, Wan Fokkink. 79-80 [doi]
• Brief announcement: on L-resilience, hitting sets, and colorless tasksEli Gafni, Petr Kuznetsov. 81-82 [doi]
• Brief announcement: an efficient failure detector for omission environmentsRoberto Cortiñas, Iratxe Soraluze Arriola, Alberto Lafuente, Mikel Larrea. 83-84 [doi]
• Verifying linearizability with hindsightPeter W. O Hearn, Noam Rinetzky, Martin T. Vechev, Eran Yahav, Greta Yorsh. 85-94 [doi]
• Eventually linearizable shared objectsMarco Serafini, Dan Dobre, Matthias Majuntke, Péter Bokor, Neeraj Suri. 95-104 [doi]
• The topology of shared-memory adversariesMaurice Herlihy, Sergio Rajsbaum. 105-113 [doi]
• Brief announcement: towards robust medium access in multi-hop networksAndréa W. Richa, Jin Zhang, Christian Scheideler, Stefan Schmid. 114-115 [doi]
• Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratioFlorian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim. 116-117 [doi]
• Brief announcement: ART--sub-logarithmic decentralized range query processing with probabilistic guaranteesSpyros Sioutas, George Papaloukopoulos, Evangelos Sakkopoulos, Kostas Tsichlas, Yannis Manolopoulos, Peter Triantafillou. 118-119 [doi]
• Brief announcement: pan and scanMatthew P. Johnson, Amotz Bar-Noy. 120-121 [doi]
• Brief announcement: complexity and solution of the send-receive correlation problemBenito van der Zander, Egon Wanke, Wolfgang Kieß, Björn Scheuermann. 122-123 [doi]
• Brief announcement: distributed contention resolution in wireless networksThomas Kesselheim, Berthold Vöcking. 124-125 [doi]
• Brief announcement: sources of instability in data center multicastDmitry Basin, Ken Birman, Idit Keidar, Ymir Vigfusson. 126 [doi]
• Brief announcement: superpeer formation amidst churn and rewiringBivas Mitra, Sujoy Ghose, Niloy Ganguly. 127-128 [doi]
• Brief announcement: self-monitoring in dynamic wireless networksStephan Holzer, Yvonne Anne Pignolet, Jasmin Smula, Roger Wattenhofer. 129-130 [doi]
• Non-blocking binary search treesFaith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel. 131-140 [doi]
• Adaptive randomized mutual exclusion in sub-logarithmic expected timeDanny Hendler, Philipp Woelfel. 141-150 [doi]
• Distributed data classification in sensor networksIttay Eyal, Idit Keidar, Raphael Rom. 151-160 [doi]
• Partial information spreading with application to distributed maximum coverageKeren Censor Hillel, Hadas Shachnai. 161-170 [doi]
• Adaptive system anomaly prediction for large-scale hosting infrastructuresYongmin Tan, Xiaohui Gu, Haixun Wang. 173-182 [doi]
• Efficient threshold detection in a distributed environment: extended abstractYuval Emek, Amos Korman. 183-191 [doi]
• Forbidden-set distance labels for graphs of bounded doubling dimensionIttai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg. 192-200 [doi]
• Efficient distributed random walks with applicationsAtish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali. 201-210 [doi]
• On the theoretical gap between synchronous and asynchronous MPC protocolsZuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen. 211-218 [doi]
• Hybrid-secure MPC: trading information-theoretic robustness for computational privacyChristoph Lucas, Dominik Raub, Ueli M. Maurer. 219-228 [doi]
• Brief announcement: the price of anarchy for distributed network formation in an adversary modelLasse Kliemann. 229-230 [doi]
• Brief announcement: swarming secretsShlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov. 231-232 [doi]
• Brief announcement: distributed trust management and revocationDmitriy Kuptsov, Andrei Gurtov, Oscar García Morchon, Klaus Wehrle. 233-234 [doi]
• Brief announcement: realizing secure multiparty computation on incomplete networksShailesh Vaya. 235-236 [doi]
• Brief announcement: anonymity and trust in distributed systemsMichael Backes, Stefan Lorenz, Matteo Maffei, Kim Pecina. 237-238 [doi]
• Brief announcement: secret sharing based on the social behaviors of playersMehrdad Nojoumian, Douglas R. Stinson. 239-240 [doi]
• Brief announcement: improving social-network-based sybil-resilient node admission controlNguyen Tran, Jinyang Li, Lakshminarayanan Subramanian, Sherman S. M. Chow. 241-242 [doi]
• Brief announcement: communication efficient asynchronous byzantine agreementArpita Patra, C. Pandu Rangan. 243-244 [doi]
• Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexityArpita Patra, Ashish Choudhury, C. Pandu Rangan. 245-246 [doi]
• Meeting the deadline: on the complexity of fault-tolerant continuous gossipChryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski. 247-256 [doi]
• A new technique for distributed symmetry breakingJohannes Schneider, Roger Wattenhofer. 257-266 [doi]
• On the computational power of oblivious robots: forming a series of geometric patternsShantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita. 267-276 [doi]
• Brief announcement: on the quest of optimal service ordering in decentralized queriesEfthymia Tsamoura, Anastasios Gounaris, Yannis Manolopoulos. 277-278 [doi]
• Brief announcement: network traffic can optimize consolidation during transformation to virtualizationKewei Sun, Ying Li, Jing Luo. 279-280 [doi]
• Brief announcement: distributed almost stable marriagePatrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela. 281-282 [doi]
• Brief announcement: decentralized construction of multicast trees embedded into P2P overlay networks based on virtual geometric coordinatesMugurel Ionut Andreica, Andrei Dragus, Ana-Delia Sambotin, Nicolae Tapus. 283-284 [doi]
• Brief announcement: deterministic dominating set construction in networks with bounded degreeRoy Friedman, Alex Kogan. 285-286 [doi]
• Brief announcement: tree decomposition for faster concurrent data structuresJohannes Schneider, Roger Wattenhofer. 287-288 [doi]
• Brief announcement: efficient graph algorithms without synchronizationJohannes Schneider, Roger Wattenhofer. 289-290 [doi]
• Brief announcement: the accuracy of tree-based counting in dynamic networksSupriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf Stadler, Fetahi Zebenigus Wuhib. 291-292 [doi]
• Brief announcement: adaptive content placement for peer-to-peer video-on-demand systemsBo Tan, Laurent Massoulié. 293-294 [doi]
• Brief announcement: exponential speed-up of local algorithms using non-local communicationChristoph Lenzen, Roger Wattenhofer. 295-296 [doi]
• Finding mobile data under delay constraints with searching costsAmotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002, Asaf Levin. 297-304 [doi]
• On utilizing speed in networks of mobile agentsJoffroy Beauquier, Janna Burman, Julien Clement, Shay Kutten. 305-314 [doi]
• Expansion and the cover time of parallel random walksThomas Sauerwald. 315-324 [doi]
• Rapid randomized pruning for fast greedy distributed algorithmsSaurav Pandit, Sriram V. Pemmaraju. 325-334 [doi]
• A certain freedom: thoughts on the CAP theoremEric A. Brewer. 335 [doi]
• Broadcasting in unreliable radio networksFabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Rotem Oshman, Andréa W. Richa. 336-345 [doi]
• Discrete load balancing is (almost) as easy as continuous load balancingRobert Elsässer, Thomas Sauerwald. 346-354 [doi]
• Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse. 355-364 [doi]
• Distributed algorithms for edge dominating setsJukka Suomela. 365-374 [doi]
• Fast flooding over ManhattanAndrea E. F. Clementi, Angelo Monti, Riccardo Silvestri. 375-383 [doi]
• Bayesian ignoranceNoga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz. 384-391 [doi]
• Brief announcement: asynchronous bounded expected delay networksRena Bakhshi, Jörg Endrullis, Wan Fokkink, Jun Pang. 392-393 [doi]
• Brief announcement: locally-accessible implementations for distributed shared memory multiprocessorsWojciech M. Golab. 394-395 [doi]
• Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networksGuanfeng Liang, Nitin Vaidya. 396-397 [doi]
• Brief announcement: a framework for building self-stabilizing overlay networksAndrew Berns, Sukumar Ghosh, Sriram V. Pemmaraju. 398-399 [doi]
• Brief announcement: revisiting the power-law degree distribution for social graph analysisAlessandra Sala, Haitao Zheng, Ben Y. Zhao, Sabrina Gaito, Gian Paolo Rossi. 400-401 [doi]
• Brief announcement: collusion free protocol for rational secret sharingAmjed Shareef. 402-403 [doi]
• Brief announcement: leader election vs pattern formationYoann Dieudonné, Franck Petit, Vincent Villain. 404-405 [doi]
• Brief announcement: monotonic stabilizationYukiko Yamauchi, Sébastien Tixeuil. 406-407 [doi]
• Brief announcement: modelling MapReduce for optimal execution in the cloudAlexander Wieder, Pramod Bhatotia, Ansley Post, Rodrigo Rodrigues. 408-409 [doi]
• Deterministic distributed vertex coloring in polylogarithmic timeLeonid Barenboim, Michael Elkin. 410-419 [doi]
• Breaking the ::::O::::(::::n:::::::2:::) bit barrier: scalable byzantine agreement with an adaptive adversaryValerie King, Jared Saia. 420-429 [doi]
• Optimal gradient clock synchronization in dynamic networksFabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman. 430-439 [doi]
• Online set packing and competitive scheduling of multi-part tasksYuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz. 440-449 [doi]
• How to meet when you forget: log-space rendezvous in arbitrary graphsJurek Czyzowicz, Adrian Kosowski, Andrzej Pelc. 450-459 [doi]
• A modular approach to shared-memory consensus, with applications to the probabilistic-write modelJames Aspnes. 460-467 [doi]
• Constant RMR solutions to reader writer synchronizationVibhor Bhatt, Prasad Jayanti. 468-477 [doi]