Abstract is missing.
- Cortical ComputationChristos H. Papadimitriou, Santosh S. Vempala. 1-2 [doi]
- Near-Optimal Scheduling of Distributed AlgorithmsMohsen Ghaffari. 3-12 [doi]
- Scheduling Loop-free Network Updates: It's Good to Relax!Arne Ludwig, Jan Marcinkowski, Stefan Schmid. 13-22 [doi]
- New Routing Techniques and their ApplicationsLiam Roditty, Roei Tov. 23-32 [doi]
- Brief Announcement: Routing the Internet with Very Few EntriesCyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas. 33-35 [doi]
- Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of AutomataOthon Michail. 37-46 [doi]
- Fast and Exact Majority in Population ProtocolsDan Alistarh, Rati Gelashvili, Milan Vojnovic. 47-56 [doi]
- Distributed House-Hunting in Ant ColoniesMohsen Ghaffari, Cameron Musco, Tsvetomira Radeva, Nancy A. Lynch. 57-66 [doi]
- Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable MatterZahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida A. Bazzi, Andréa W. Richa, Christian Scheideler. 67-69 [doi]
- Construction and Impromptu Repair of an MST in a Distributed Network with o(m) CommunicationValerie King, Shay Kutten, Mikkel Thorup. 71-80 [doi]
- Near-Optimal Distributed Maximum Flow: Extended AbstractMohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir. 81-90 [doi]
- Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MSTJames W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, Vivek B. Sardeshmukh, Michele Scquizzato. 91-100 [doi]
- Fast Distributed Almost Stable MatchingsRafail Ostrovsky, Will Rosenbaum. 101-108 [doi]
- A (Truly) Local Broadcast Layer for Unreliable Radio NetworksNancy A. Lynch, Calvin Newport. 109-118 [doi]
- Efficient Communication in Cognitive Radio NetworksSeth Gilbert, Fabian Kuhn, Calvin Newport, Chaodong Zheng. 119-128 [doi]
- A Local Broadcast Layer for the SINR Network ModelMagnús M. Halldórsson, Stephan Holzer, Nancy A. Lynch. 129-138 [doi]
- Brief Announcement: Fast and Simple Node Coloring in the SINR ModelFabian Fuchs. 139-141 [doi]
- Algebraic Methods in the Congested CliqueKeren Censor Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela. 143-152 [doi]
- Fast Partial Distance Estimation and ApplicationsChristoph Lenzen, Boaz Patt-Shamir. 153-162 [doi]
- Brief Announcement: Distributed Single-Source ReachabilityMohsen Ghaffari, Rajan Udwani. 163-165 [doi]
- Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to UnicastFlorent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila. 167-169 [doi]
- The "Mobile Adversary" Paradigm in Distributed Computation and SystemsMoti Yung. 171-172 [doi]
- Trading Fences with RMRs and Separating Memory ModelsHagit Attiya, Danny Hendler, Philipp Woelfel. 173-182 [doi]
- The Price of being AdaptiveOhad Ben-Baruch, Danny Hendler. 183-192 [doi]
- On the Time and Space Complexity of ABA Prevention and DetectionZahra Aghazadeh, Philipp Woelfel. 193-202 [doi]
- Brief Announcement: Fault-tolerant Broadcast in Anonymous Distributed Systems with Fair Lossy Communication ChannelsJian Tang, Mikel Larrea, Sergio Arévalo, Ernesto Jiménez. 203-205 [doi]
- Impossibility Results for Distributed Transactional MemoryCostas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma. 207-215 [doi]
- Disjoint-Access Parallelism: Impossibility, Possibility, and Cost of Transactional Memory ImplementationsSebastiano Peluso, Roberto Palmieri, Paolo Romano, Binoy Ravindran, Francesco Quaglia. 217-226 [doi]
- Safety-Liveness Exclusion in Distributed ComputingVictor Bushkov, Rachid Guerraoui. 227-236 [doi]
- Brief Announcement: Eventually Consistent LinearizabilityMaciej Kokocinski, Tadeusz Kobus, Pawel T. Wojciechowski. 237-239 [doi]
- Help!Keren Censor Hillel, Erez Petrank, Shahar Timnat. 241-250 [doi]
- Lock-Free Algorithms under Stochastic SchedulersDan Alistarh, Thomas Sauerwald, Milan Vojnovic. 251-260 [doi]
- Reclaiming Memory for Lock-Free Data Structures: There has to be a Better WayTrevor Alexander Brown. 261-270 [doi]
- On the Space Complexity of Set Agreement?Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert. 271-280 [doi]
- How Fair is Your Protocol?: A Utility-based Approach to Protocol OptimalityJuan A. Garay, Jonathan Katz, Björn Tackmann, Vassilis Zikas. 281-290 [doi]
- Adaptively Secure Computation with Partial ErasuresCarmit Hazay, Yehuda Lindell, Arpita Patra. 291-300 [doi]
- Improved Analysis of Deterministic Load-Balancing SchemesPetra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski. 301-310 [doi]
- Brief Announcement: Robust and Private Distributed Shared Atomic Memory in Message Passing NetworksShlomi Dolev, Thomas Petig, Elad Michael Schiller. 311-313 [doi]
- Randomized Proof-Labeling SchemesBaruch Mor, Pierre Fraigniaud, Boaz Patt-Shamir. 315-324 [doi]
- Distributed Convex ThresholdingRan Wolff. 325-334 [doi]
- Brief Announcement: Average Complexity for the LOCAL ModelLaurent Feuilloley. 335-337 [doi]
- Brief Announcement: Investigating the Cost of Anonymity on Dynamic NetworksGiuseppe Antonio Di Luna, Roberto Baldoni. 339-341 [doi]
- Online Resource LeasingChristine Markarian, Friedhelm Meyer auf der Heide. 343-344 [doi]
- Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty NetworksLeonid Barenboim. 345-354 [doi]
- On Information Complexity in the Broadcast ModelMark Braverman, Rotem Oshman. 355-364 [doi]
- How To Elect a Leader Faster than a TournamentDan Alistarh, Rati Gelashvili, Adrian Vladu. 365-374 [doi]
- The Weakest Failure Detector for Eventual ConsistencySwan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit, Pierre Sens. 375-384 [doi]
- Limitations of Highly-Available Eventually-Consistent Data StoresHagit Attiya, Faith Ellen, Adam Morrison. 385-394 [doi]
- Computing Weak Consistency in Polynomial Time: [Extended Abstract]Wojciech M. Golab, Xiaozhou (Steve) Li, Alejandro López-Ortiz, Naomi Nishimura. 395-404 [doi]
- On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald. 405-412 [doi]
- Distributed Resource Discovery in Sub-Logarithmic TimeBernhard Haeupler, Dahlia Malkhi. 413-419 [doi]
- The Cost of Synchronizing Multiple-Access ChannelsTomasz Jurdzinski, Grzegorz Stachowiak. 421-430 [doi]
- Leveraging Multiple Channels in Ad Hoc NetworksMagnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu. 431-440 [doi]
- Towards Optimal Synchronous CountingChristoph Lenzen, Joel Rybicki, Jukka Suomela. 441-450 [doi]
- Fault-Tolerant Consensus in Directed GraphsLewis Tseng, Nitin H. Vaidya. 451-460 [doi]
- Minimal Synchrony for Byzantine ConsensusZohir Bouzid, Achour Mostéfaoui, Michel Raynal. 461-470 [doi]
- Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems: Extended abstractSilvia Bonomi, Shlomi Dolev, Maria Potop-Butucaru, Michel Raynal. 471-479 [doi]
- Dual Failure Resilient BFS StructureMerav Parter. 481-490 [doi]