Abstract is missing.
- Coordinated consensus in dynamic networksFabian Kuhn, Rotem Oshman, Yoram Moses. 1-10 [doi]
- Error-free multi-valued consensus with byzantine failuresGuanfeng Liang, Nitin H. Vaidya. 11-20 [doi]
- Byzantine agreement with homonymsCarole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The. 21-30 [doi]
- Distributed graph coloring in a few roundsKishore Kothapalli, Sriram V. Pemmaraju. 31-40 [doi]
- MIS on treesChristoph Lenzen, Roger Wattenhofer. 41-48 [doi]
- Toward more localized local algorithms: removing assumptions concerning global knowledgeAmos Korman, Jean-Sébastien Sereni, Laurent Viennot. 49-58 [doi]
- The complexity of robust atomic storageDan Dobre, Rachid Guerraoui, Matthias Majuntke, Neeraj Suri, Marko Vukolic. 59-68 [doi]
- Resilience of mutual exclusion algorithms to transient memory faultsThomas Moscibroda, Rotem Oshman. 69-78 [doi]
- Structuring unreliable radio networksKeren Censor Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport. 79-88 [doi]
- The impact of memory models on software reliability in multiprocessorsAlexander Jaffe, Thomas Moscibroda, Laura Effinger-Dean, Luis Ceze, Karin Strauss. 89-98 [doi]
- On the power of hardware transactional memory to simplify memory managementAleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir. 99-108 [doi]
- A complexity separation between the cache-coherent and distributed shared memory modelsWojciech M. Golab. 109-118 [doi]
- From bounded to unbounded concurrency objects and backYehuda Afek, Adam Morrison, Guy Wertheim. 119-128 [doi]
- Distributed deterministic edge coloring using bounded neighborhood independenceLeonid Barenboim, Michael Elkin. 129-138 [doi]
- The space complexity of long-lived and one-shot timestamp implementationsMaryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel. 139-148 [doi]
- Compact policy routingGábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József Bíró. 149-158 [doi]
- Locally checkable proofsMika Göös, Jukka Suomela. 159-168 [doi]
- Fault-tolerant spanners: better and simplerMichael Dinitz, Robert Krauthgamer. 169-178 [doi]
- Adaptively secure broadcast, revisitedJuan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou. 179-186 [doi]
- Scalable rational secret sharingVarsha Dani, Mahnush Movahedi, Yamel Rodriguez, Jared Saia. 187-196 [doi]
- Analyzing consistency properties for fun and profitWojciech M. Golab, Xiaozhou Li, Mehul A. Shah. 197-206 [doi]
- Distributed k-core decompositionAlberto Montresor, Francesco De Pellegrini, Daniele Miorandi. 207-208 [doi]
- Fork-consistent constructions from registersMatthias Majuntke, Dan Dobre, Neeraj Suri. 209-210 [doi]
- Unbounded contention resolution in multiple-access channelsMiguel A. Mosteiro, Antonio Fernández Anta, Jorge Ramón Muñoz. 211-212 [doi]
- Tracking distributed aggregates over time-based sliding windowsGraham Cormode, Ke Yi. 213-214 [doi]
- Accurate byzantine agreement with feedbackVijay K. Garg, John Bridgman, Bharath Balasubramanian. 215-216 [doi]
- B-neck: a distributed and quiescent max-min fair algorithmAlberto Mozo, José Luis López-Presa, Antonio Fernández Anta. 217-218 [doi]
- Information dissemination on multiple channelsStephan Holzer, Yvonne Anne Pignolet, Jasmin Smula, Roger Wattenhofer. 219-220 [doi]
- Robust data sharing with key-value storesCristina Basescu, Christian Cachin, Ittay Eyal, Robert Haas, Marko Vukolic. 221-222 [doi]
- Network synchronization and localization based on stolen signalsChristian Schindelhauer, Zvi Lotker, Johannes Wendeberg. 223-224 [doi]
- Validity bound of regular registers with churn and byzantine processesRoberto Baldoni, Silvia Bonomi, Amir Soltani Nezhad. 225-226 [doi]
- Easy impossibility proofs for k-set agreement in message passing systemsMartin Biely, Peter Robinson, Ulrich Schmid. 227-228 [doi]
- Solving the at-most-once problem with nearly optimal effectivenessSotiris Kentros, Aggelos Kiayias. 229-230 [doi]
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutionsMaurice Herlihy, Yoram Moses, Mark R. Tuttle. 231-238 [doi]
- Optimal-time adaptive strong renaming, with applications to countingDan Alistarh, James Aspnes, Keren Censor Hillel, Seth Gilbert, Morteza Zadimoghaddam. 239-248 [doi]
- The round complexity of distributed sorting: extended abstractBoaz Patt-Shamir, Marat Teplitsky. 249-256 [doi]
- A tight unconditional lower bound on distributed randomwalk computationDanupon Nanongkai, Atish Das Sarma, Gopal Pandurangan. 257-266 [doi]
- Minimum congestion mapping in a cloudNikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer. 267-276 [doi]
- Conflict on a communication channelValerie King, Jared Saia, Maxwell Young. 277-286 [doi]
- The universe of symmetry breaking tasksDamien Imbs, Sergio Rajsbaum, Michel Raynal. 287-288 [doi]
- Rationality authority for provable rational behaviorShlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis. 289-290 [doi]
- Secure data structures based on multi-party computationTomas Toft. 291-292 [doi]
- Robust network supercomputing without centralized controlSeda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman. 293-294 [doi]
- On the hardness and approximation of minimum topic-connected overlayMonika Steinová. 295-296 [doi]
- A theory of goal-oriented communicationOded Goldreich, Brendan Juba, Madhu Sudan. 299-300 [doi]
- Xheal: localized self-healing using expandersGopal Pandurangan, Amitabh Trehan. 301-310 [doi]
- Fast and compact self stabilizing verification, computation, and fault detection of an MSTAmos Korman, Shay Kutten, Toshimitsu Masuzawa. 311-320 [doi]
- Stability of a peer-to-peer communication systemJi Zhu, Bruce E. Hajek. 321-330 [doi]
- Scalability versus semantics of concurrent FIFO queuesHannes Payer, Harald Röck, Christoph M. Kirsch, Ana Sokolova. 331-332 [doi]
- Distributed computing with rules of thumbAaron D. Jaggard, Michael Schapira, Rebecca N. Wright. 333-334 [doi]
- Incentive-compatible distributed greedy protocolsNoam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. 335-336 [doi]
- Sustaining collaboration in multicast despite rational collusionHaifeng Yu, Phillip B. Gibbons, Chenwei Shi. 337-338 [doi]
- Reliable end-user communication under a changing packet network protocolBrendan Juba. 339-340 [doi]
- Securing social networksMichael Backes, Matteo Maffei, Kim Pecina. 341-342 [doi]
- Parallel and distributed programming extensions for mainstream languages based on pi-calculusPatrick Viry. 343-344 [doi]
- A nonblocking set optimized for querying the minimum valueYujie Liu, Michael F. Spear. 345-346 [doi]
- Time bounds for shared objects in partially synchronous systemsJiaqi Wang, Jennifer L. Welch, Hyunyoung Lee. 347-348 [doi]
- The inherent difficulty of timely primary-backup replicationPramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, Gordon T. Wilfong. 349-350 [doi]
- Randomized compact routing in decomposable metricsGoran Konjevod, Andréa W. Richa, Donglin Xia, Ling Zhou. 351-352 [doi]
- Partial reversal acyclicityTsvetomira Radeva, Nancy A. Lynch. 353-354 [doi]
- Tight bounds on information dissemination in sparse mobile networksAlberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal. 355-362 [doi]
- Order optimal information spreading using algebraic gossipChen Avin, Michael Borokhovich, Keren Censor Hillel, Zvi Lotker. 363-372 [doi]
- Time-efficient randomized multiple-message broadcast in radio networksMajid Khabbazian, Dariusz R. Kowalski. 373-380 [doi]
- Faster information dissemination in dynamic networks via network codingBernhard Haeupler, David Karger. 381-390 [doi]