Table of Contents

• Transactional memory for a modern microprocessorMarc Tremblay. 1 [doi]
• The Akamai approach to achieving performance and reliability on the internetTom Leighton. 2 [doi]
• Constant-RMR implementations of CAS and other synchronization primitives using read and write operationsWojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel. 3-12 [doi]
• SNZI: scalable NonZero indicatorsFaith Ellen, Yossi Lev, Victor Luchangco, Mark Moir. 13-22 [doi]
• Abortable and query-abortable objects and their efficient implementationMarcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg. 23-32 [doi]
• Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CASPanagiota Fatourou, Nikolaos D. Kallimanis. 33-42 [doi]
• Reconstructing approximate tree metricsIttai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar. 43-52 [doi]
• A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphsBeat Gfeller, Elias Vicari. 53-60 [doi]
• Improved sparse covers for graphs excluding a fixed minorCostas Busch, Ryan LaFortune, Srikanta Tirthapura. 61-70 [doi]
• Compact routing with slack in low doubling dimensionGoran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu. 71-80 [doi]
• Compact routing with slackMichael Dinitz. 81-88 [doi]
• Towards fast decentralized construction of locality-aware overlay networksAleksandrs Slivkins. 89-98 [doi]
• On the complexity of greedy routing in ring-based peer-to-peer networksGeorge Giakkoupis, Vassos Hadzilacos. 99-108 [doi]
• Constructing scalable overlays for pub-sub with many topicsGregory Chockler, Roie Melamed, Yoav Tock, Roman Vitenberg. 109-118 [doi]
• Refined quorum systemsRachid Guerraoui, Marko Vukolic. 119-128 [doi]
• Efficient fork-linearizable access to untrusted shared memoryChristian Cachin, Abhi Shelat, Alexander Shraer. 129-138 [doi]
• Verifying distributed erasure-coded dataJames Hendricks, Gregory R. Ganger, Michael K. Reiter. 139-146 [doi]
• Truth in advertising: lightweight verification of route integrityEdmund L. Wong, Praveen Balasubramanian, Lorenzo Alvisi, Mohamed G. Gouda, Vitaly Shmatikov. 147-156 [doi]
• Countering web spam with credibility-based link analysisJames Caverlee, Ling Liu. 157-166 [doi]
• Distributed approximate matchingZvi Lotker, Boaz Patt-Shamir, Adi Rosén. 167-174 [doi]
• Controller and estimator for dynamic networksAmos Korman, Shay Kutten. 175-184 [doi]
• A near-optimal distributed fully dynamic algorithm for maintaining sparse spannersMichael Elkin. 185-194 [doi]
• Broadcasting in udg radio networks with unknown topologyYuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su. 195-204 [doi]
• Communication in dynamic radio networksAndrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri. 205-214 [doi]
• Time-decaying sketches for sensor data aggregationGraham Cormode, Srikanta Tirthapura, Bojian Xu. 215-224 [doi]
• Summarizing data using bottom-k sketchesEdith Cohen, Haim Kaplan. 225-234 [doi]
• On the weakest failure detector everRachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport. 235-243 [doi]
• Tolerating corrupted communicationMartin Biely, Josef Widder, Bernadette Charron-Bost, Antoine Gaillard, Martin Hutle, André Schiper. 244-253 [doi]
• Optimal inter-object correlation when replicating for availabilityHaifeng Yu, Phillip B. Gibbons. 254-263 [doi]
• Graceful degradation via versions: specifications and implementationsLidong Zhou, Vijayan Prabhakaran, Venugopalan Ramasubramanian, Roy Levin, Chandramohan A. Thekkath. 264-273 [doi]
• Greedy distributed optimization of multi-commodity flowsBaruch Awerbuch, Rohit Khandekar. 274-283 [doi]
• Distributed network monitoring and multicommodity flows: a primal-dual approachBaruch Awerbuch, Rohit Khandekar. 284-291 [doi]
• The price of anarchy in network creation gamesErik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam. 292-298 [doi]
• Network formation games with local coalitionsStefano Leonardi, Piotr Sankowski. 299-305 [doi]
• Partition approach to failure detectors for k-set agreementWei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu. 306-307 [doi]
• Failure detectors are schedulersAlejandro Cornejo, Sergio Rajsbaum, Michel Raynal, Corentin Travers. 308-309 [doi]
• Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptionsAmitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi. 310-311 [doi]
• Remote storage with byzantine serversMarcos Kawazoe Aguilera, Ram Swaminathan. 312-313 [doi]
• Towards the minimal synchrony for byzantine consensusAchour Mostéfaoui, Gilles Trédan. 314-315 [doi]
• Multicoordinated PaxosLásaro J. Camargos, Rodrigo Schmidt, Fernando Pedone. 316-317 [doi]
• The complexity of updating multi-writer snapshot objectsHagit Attiya, Faith Ellen, Panagiota Fatourou. 318-319 [doi]
• From an intermittent rotating star to a leaderAntonio Fernández, Michel Raynal. 320-321 [doi]
• Constant phase efficient protocols for secure message transmission in directed networksArpita Patra, Ashish Choudhary, Chanrasekharan Pandu Rangan. 322-323 [doi]
• Space adaptation: privacy-preserving multiparty collaborative mining with geometric perturbationKeke Chen, Ling Liu. 324-325 [doi]
• Practical private computation of vector addition-based functionsYitao Duan, John F. Canny. 326-327 [doi]
• Integrated resource allocation in heterogeneous SAN data centersAameek Singh, Madhukar R. Korupolu, Bhuvan Bamba. 328-329 [doi]
• ::::d::::-clock: distributed QoS in heterogeneous resource environmentsAjay Gulati, Arif Merchant, Peter J. Varman. 330-331 [doi]
• Configurations: a model for distributed data storageBob Mungamuru, Hector Garcia-Molina, Christopher Olston. 332-333 [doi]
• A formal treatment of an abstract channel implementation using java sockets and TCPChryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman, Elaine L. Sonderegger. 334-335 [doi]
• Transactions and privatization in Delaunay triangulationMichael L. Scott, Michael F. Spear, Luke Dalessandro, Virendra J. Marathe. 336-337 [doi]
• Privatization techniques for software transactional memoryMichael F. Spear, Virendra J. Marathe, Luke Dalessandro, Michael L. Scott. 338-339 [doi]
• From causal to z-linearizable transactional memoryTorvald Riegel, Christof Fetzer, Heiko Sturzrehm, Pascal Felber. 340-341 [doi]
• The power of DCAS: highly-concurrent software transactional memoryHagit Attiya, Eshcar Hillel. 342-343 [doi]
• Object replication degree customization for high availabilityMing Zhong, Kai Shen, Joel I. Seiferas. 344-345 [doi]
• Sharpness, a tight condition for throughput scalabilityAugustin Chaintreau. 346-347 [doi]
• An analysis of intention preservation in group editorsDu Li, Rui Li. 348-349 [doi]
• The coBFIT toolkitHariGovind V. Ramasamy, Mouna Seri, William H. Sanders. 350-351 [doi]
• On local representation of distances in treesCyril Gavoille, Arnaud Labourel. 352-353 [doi]
• Minimizing the total cost of network measurements in a distributed manner: a primal-dual approachBaruch Awerbuch, Rohit Khandekar. 354-355 [doi]
• Game authority for robust andscalable distributed selfish-computer systemsShlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas. 356-357 [doi]
• Theory of BAR gamesAllen Clement, Jeff Napper, Harry C. Li, Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin. 358-359 [doi]
• An algorithm composition scheme preserving monotonicityDavide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti. 360-361 [doi]
• An incentive-compatible multi-armed bandit mechanismRica Gonen, Elan Pavlov. 362-363 [doi]
• On cost sharing mechanisms in the network design gameBaruch Awerbuch, Rohit Khandekar. 364-365 [doi]
• Asynchronous recommendation systemsBaruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir. 366-367 [doi]
• Bringing order to BGP: decreasing time and message complexityAnat Bremler-Barr, Nir Chen, Jussi Kangasharju, Osnat Mokryn, Yuval Shavitt. 368-369 [doi]
• A denial-of-service resistant DHTBaruch Awerbuch, Christian Scheideler. 370-371 [doi]
• Measuring robustness of superpeer topologiesBivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy Ganguly. 372-373 [doi]
• SuperTrust: a secure and efficient framework for handling trust in super-peer networksTassos Dimitriou, Ghassan Karame, Ioannis T. Christou. 374-375 [doi]
• Toward an optimal social network defense against Sybil attacksHaifeng Yu, Phillip B. Gibbons, Michael Kaminsky. 376-377 [doi]
• Trinity: distributed defense against transient spam-botsAlex Brodsky, Dmitry Brodsky. 378-379 [doi]
• Non-searchability of random scale-free graphsPhilippe Duchon, Nicole Eggemann, Nicolas Hanusse. 380-381 [doi]
• Distributed broadcasting and mapping protocols in directed anonymous networksMichael Langberg, Moshe Schwartz, Jehoshua Bruck. 382-383 [doi]
• Optimal atomic broadcast and multicast algorithms for wide area networksNicolas Schiper, Fernando Pedone. 384-385 [doi]
• Solvability of geocasting in mobile ad-hoc networksRoberto Baldoni, Kleoni Ioannidou, Alessia Milani. 386-387 [doi]
• Geographic gossip on geometric random graphs via affine combinationsHariharan Narayanan. 388-389 [doi]
• Practical summation via gossipWesley W. Terpstra, Christof Leng, Alejandro P. Buchmann. 390-391 [doi]
• Distributed algorithms for dynamic coverage in sensor networksLan Lin, Hyunyoung Lee. 392-393 [doi]
• DoS-resilient secure aggregation queries in sensor networksHaifeng Yu. 394-395 [doi]
• Self-stabilizing counting in mobile sensor networksJoffroy Beauquier, Julien Clement, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy. 396-397 [doi]
• Paxos made live: an engineering perspectiveTushar Deepak Chandra, Robert Griesemer, Joshua Redstone. 398-407 [doi]