Abstract is missing.
- Rational and resilient protocolsSilvio Micali. 1 [doi]
- 2) messagesAchour Mostéfaoui, Moumen Hamouma, Michel Raynal. 2-9 [doi]
- Asynchronous MPC with a strict honest majority using non-equivocationMichael Backes, Fabian Bendun, Ashish Choudhury, Aniket Kate. 10-19 [doi]
- Distributing the setup in universally composable multi-party computationJonathan Katz, Aggelos Kiayias, Hong-Sheng Zhou, Vassilis Zikas. 20-29 [doi]
- The future(s) of shared data structuresAlex Kogan, Maurice Herlihy. 30-39 [doi]
- A paradox of eventual linearizability in shared memoryRachid Guerraoui, Eric Ruppert. 40-49 [doi]
- Brief announcement: are lock-free concurrent algorithms practically wait-free?Dan Alistarh, Keren Censor Hillel, Nir Shavit. 50-52 [doi]
- Brief announcement: a generic construction for nonblocking dual containersJoseph Izraelevitz, Michael L. Scott. 53-55 [doi]
- Multi-message broadcast with abstract MAC layers and unreliable linksMohsen Ghaffari, Erez Kantor, Nancy A. Lynch, Calvin C. Newport. 56-65 [doi]
- Consensus with an abstract MAC layerCalvin C. Newport. 66-75 [doi]
- Simple and efficient local codes for distributed stable network constructionOthon Michail, Paul G. Spirakis. 76-85 [doi]
- Linear-in-delta lower bounds in the LOCAL modelMika Göös, Juho Hirvonen, Jukka Suomela. 86-95 [doi]
- Anonymous networks: randomization = 2-hop coloringYuval Emek, Christoph Pfister, Jochen Seidel, Roger Wattenhofer. 96-105 [doi]
- Beyond set disjointness: the communication complexity of finding the intersectionJoshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev. 106-113 [doi]
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communicationOfer Feinerman, Bernhard Haeupler, Amos Korman. 114-123 [doi]
- Estimation for monotone sampling: competitiveness and customizationEdith Cohen. 124-133 [doi]
- Distributed algorithms for the Lovász local lemma and graph coloringKai-Min Chung, Seth Pettie, Hsin-Hao Su. 134-143 [doi]
- Brief announcement: towards security and privacy for outsourced data in the multi-party settingMatteo Maffei, Giulio Malavolta, Manuel Reinert, Dominique Schröder. 144-146 [doi]
- Brief announcement: game theoretical approach for energy-delay balancing in distributed duty-cycled MAC protocols of wireless networksMessaoud Doudou, José M. Barceló-Ordinas, Djamel Djenouri, Jorge García-Vidal, Nadjib Badache. 147-152 [doi]
- Coding theory for scalable media deliveryMichael George Luby. 153-155 [doi]
- Distributed connectivity decompositionKeren Censor Hillel, Mohsen Ghaffari, Fabian Kuhn. 156-165 [doi]
- Can quantum communication speed up distributed computation?Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan. 166-175 [doi]
- Optimal gossip with direct addressingBernhard Haeupler, Dahlia Malkhi. 176-185 [doi]
- Complexity tradeoffs for read and update operationsDanny Hendler, Vitaly Khait. 186-195 [doi]
- Concurrent updates with RCU: search tree as an exampleMaya Arbel, Hagit Attiya. 196-205 [doi]
- Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other propertiesMichel Raynal, Julien Stainer, Gadi Taubenfeld. 206-208 [doi]
- Brief announcement: concurrency-aware linearizabilityNir Hemed, Noam Rinetzky. 209-211 [doi]
- Software-improved hardware lock elisionYehuda Afek, Amir Levy, Adam Morrison. 212-221 [doi]
- A generalized asynchronous computability theoremEli Gafni, Petr Kuznetsov, Ciprian Manolescu. 222-231 [doi]
- Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systemsDan Alistarh, Oksana Denysyuk, Luís Rodrigues, Nir Shavit. 232-241 [doi]
- Dynamic-sized nonblocking hash tablesYujie Liu, Kunlong Zhang, Michael F. Spear. 242-251 [doi]
- Trade-offs between selection complexity and performance when searching the plane without communicationChristoph Lenzen, Nancy A. Lynch, Calvin C. Newport, Tsvetomira Radeva. 252-261 [doi]
- Improved distributed steiner forest constructionChristoph Lenzen, Boaz Patt-Shamir. 262-271 [doi]
- Spanners and sparsifiers in dynamic streamsMichael Kapralov, David P. Woodruff. 272-281 [doi]
- Time versus cost tradeoffs for deterministic rendezvous in networksAvery Miller, Andrzej Pelc. 282-290 [doi]
- An incomplete history of concurrency chapter 1. 1965-1977Leslie Lamport. 291 [doi]
- Rigorous system designJoseph Sifakis. 292 [doi]
- How to withstand mobile virus attacks, revisitedJoshua Baron, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky. 293-302 [doi]
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short sharesBenoît Libert, Marc Joye, Moti Yung. 303-312 [doi]
- Fast and unconditionally secure anonymous channelJuan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov. 313-321 [doi]
- Efficient lock-free binary search treesBapi Chatterjee, Nhan Nguyen Dang, Philippas Tsigas. 322-331 [doi]
- The amortized complexity of non-blocking binary search treesFaith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert. 332-340 [doi]
- Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failuresManfred Schwarz, Kyrill Winkler, Ulrich Schmid, Martin Biely, Peter Robinson. 341-343 [doi]
- Brief announcement: local approximability of minimum dominating set on planar graphsMiikka Hilke, Christoph Lenzen, Jukka Suomela. 344-346 [doi]
- Beyond geometry: towards fully realistic wireless modelsMarijke H. L. Bodlaender, Magnús M. Halldórsson. 347-356 [doi]
- On the impact of geometry on ad hoc communication in wireless networksTomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski, Grzegorz Stachowiak. 357-366 [doi]
- On the power of the congested clique modelAndrew Drucker, Fabian Kuhn, Rotem Oshman. 367-376 [doi]
- Brief announcement: linial's lower bound made easyJuhana Laurinharju, Jukka Suomela. 377-378 [doi]
- Brief announcement: Super-fast t-ruling setsTushar Bisht, Kishore Kothapalli, Sriram V. Pemmaraju. 379-381 [doi]
- Brief announcement: almost-tight approximation distributed algorithm for minimum cutDanupon Nanongkai. 382-384 [doi]
- Making objects writableZahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel. 385-395 [doi]
- Asynchronous convex hull consensus in the presence of crash faultsLewis Tseng, Nitin H. Vaidya. 396-405 [doi]
- Distributed computing building blocks for rational agentsYehuda Afek, Yehonatan Ginzberg, Shir Landau Feibish, Moshe Sulamy. 406-415 [doi]
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functionsYuda Zhao, Haifeng Yu, Binbin Chen. 416-426 [doi]