Abstract is missing.
- Faster randomized consensus with an oblivious adversaryJames Aspnes. 1-8 [doi]
- On the liveness of transactional memoryVictor Bushkov, Rachid Guerraoui, Michal Kapalka. 9-18 [doi]
- On the time and space complexity of randomized test-and-setGeorge Giakkoupis, Philipp Woelfel. 19-28 [doi]
- Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear timePetra Berenbrink, Colin Cooper, Tom Friedetzky. 29-36 [doi]
- Information spreading in dynamic graphsAndrea E. F. Clementi, Riccardo Silvestri, Luca Trevisan. 37-46 [doi]
- Coalescing random walks and voting on graphsColin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik. 47-56 [doi]
- The cost of fault tolerance in multi-party communication complexityBinbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gibbons. 57-66 [doi]
- The communication complexity of distributed task allocationAndrew Drucker, Fabian Kuhn, Rotem Oshman. 67-76 [doi]
- Collaborative search on the plane without communicationOfer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni. 77-86 [doi]
- Brief announcement: what can be computed without communication?Heger Arfaoui, Pierre Fraigniaud. 87-88 [doi]
- Brief announcement: distributed algorithms for throughput performance in wireless networksEyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra. 89-90 [doi]
- Brief announcement: distributed cryptography using trincMichael Backes, Fabian Bendun, Aniket Kate. 91-92 [doi]
- Brief announcement: reconfigurable state machine replication from non-reconfigurable building blocksVita Bortnikov, Gregory Chockler, Dmitri Perelman, Alexey Roytman, Shlomit Shachor, Ilya Shnayderman. 93-94 [doi]
- Brief announcement: all-to-all gradecast using coding with byzantine failuresJohn Bridgman, Vijay K. Garg. 95-96 [doi]
- Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreementArmando Castañeda, Sergio Rajsbaum, Michel Raynal. 97-98 [doi]
- Brief announcement: waiting in dynamic networksArnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita. 99-100 [doi]
- Brief announcement: optimal amortized secret sharing with cheater identificationAshish Choudhury. 101-102 [doi]
- Brief announcement: efficient optimally resilient statistical AVSS and its applicationsAshish Choudhury, Arpita Patra. 103-104 [doi]
- Wait-freedom with adviceCarole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov. 105-114 [doi]
- Universal constructions that ensure disjoint-access parallelism and wait-freedomFaith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers. 115-124 [doi]
- Generalized lattice agreementJose M. Falerio, Sriram K. Rajamani, Kaushik Rajan, G. Ramalingam, Kapil Vaswani. 125-134 [doi]
- Distributed selfish load balancing with weights and speedsClemens P. J. Adolphs, Petra Berenbrink. 135-144 [doi]
- Making evildoers pay: resource-competitive broadcast in sensor networksSeth Gilbert, Maxwell Young. 145-154 [doi]
- Distributed public key schemes secure against continual leakageAdi Akavia, Shafi Goldwasser, Carmit Hazay. 155-164 [doi]
- Distributed maximal matching: greedy is optimalJuho Hirvonen, Jukka Suomela. 165-174 [doi]
- Lower bounds for local approximationMika Göös, Juho Hirvonen, Jukka Suomela. 175-184 [doi]
- Weak models of distributed computing, with connections to modal logicLauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema. 185-194 [doi]
- Aggregation in dynamic networksAlejandro Cornejo, Seth Gilbert, Calvin C. Newport. 195-204 [doi]
- Distributed connectivity of wireless networksMagnús M. Halldórsson, Pradipta Mitra. 205-214 [doi]
- Leader election in shared spectrum radio networksSebastian Daum, Seth Gilbert, Fabian Kuhn, Calvin C. Newport. 215-224 [doi]
- Brief announcement: achieving reliability in master-worker computing via evolutionary dynamicsEvgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Angel Sanchez. 225-226 [doi]
- Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversaryVarsha Dani, Valerie King, Mahnush Movahedi, Jared Saia. 227-228 [doi]
- Brief announcement: maintaining large dense subgraphs on dynamic networksAtish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan. 229-230 [doi]
- Brief announcement: decentralized network supercomputing in the presence of malicious and crash-prone workersSeda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman. 231-232 [doi]
- Brief announcement: order-preserving renaming in synchronous message passing systems with byzantine faultsOksana Denysyuk, Luís Rodrigues. 233-234 [doi]
- Brief announcement: an obstacle to scalability in wireless networksAndrás Faragó. 235-236 [doi]
- Brief announcement: on the resilience of routing tablesJoan Feigenbaum, Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, Ankit Singla. 237-238 [doi]
- Brief announcement: a tight RMR lower bound for randomized mutual exclusionGeorge Giakkoupis, Philipp Woelfel. 239-240 [doi]
- Brief announcement: From sequential to concurrent: correctness and relative efficiencyVincent Gramoli, Petr Kuznetsov, Srivatsan Ravi. 241-242 [doi]
- Asynchronous failure detectorsAlejandro Cornejo, Nancy A. Lynch, Srikanth Sastry. 243-252 [doi]
- Simulations and reductions for colorless tasksMaurice Herlihy, Sergio Rajsbaum. 253-260 [doi]
- A closer look at fault toleranceGadi Taubenfeld. 261-270 [doi]
- A simple approach for adapting continuous load balancing processes to discrete settingsHoda Akbari, Petra Berenbrink, Thomas Sauerwald. 271-280 [doi]
- Dynamic packet scheduling in wireless networksThomas Kesselheim. 281-290 [doi]
- Competitive and fair throughput for co-existing networks under adversarial interferenceAndréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang. 291-300 [doi]
- On the (limited) power of non-equivocationAllen Clement, Flavio Junqueira, Aniket Kate, Rodrigo Rodrigues. 301-308 [doi]
- On the price of equivocation in byzantine agreementAlexander Jaffe, Thomas Moscibroda, Siddhartha Sen. 309-318 [doi]
- Byzantine broadcast in point-to-point networks using local linear codingGuanfeng Liang, Nitin H. Vaidya. 319-328 [doi]
- Brief announcement: network formation games can give rise to realistic networksAndrás Gulyás, Attila Korösi, Gábor Rétvári, József Bíró, Dávid Szabó. 329-330 [doi]
- Brief announcement: network-destabilizing attacksRobert Lychev, Sharon Goldberg, Michael Schapira. 331-332 [doi]
- Brief announcement: tolerating permanent and transient value faultsZarko Milosevic 0001, Martin Hutle, André Schiper. 333-334 [doi]
- Brief announcement: efficient causality tracking in distributed storage systems with dotted version vectorsNuno M. Preguiça, Carlos Baquero, Paulo Sérgio Almeida, Victor Fonte, Ricardo Gonçalves. 335-336 [doi]
- Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectorsMichel Raynal, Julien Stainer. 337-338 [doi]
- Brief announcement: delay or deliver dilemma in organization networksShailesh Vaya. 339-340 [doi]
- Brief announcement: live streaming with utilities, quality and costYmir Vigfusson, Ken Birman, Daniel A. Freedman, Qi Huang, Kristján V. Jónsson, Gunnar Sigurbjörnsson. 341-342 [doi]
- Brief announcement: a calculus of policy-based routing systemsAnduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov. 343-344 [doi]
- Distributed algorithms for scheduling on line and tree networksVenkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal. 345-354 [doi]
- Optimal distributed all pairs shortest paths and applicationsStephan Holzer, Roger Wattenhofer. 355-364 [doi]
- Iterative approximate byzantine consensus in arbitrary directed graphsNitin H. Vaidya, Lewis Tseng, Guanfeng Liang. 365-374 [doi]
- Faster than optimal snapshots (for a while): preliminary versionJames Aspnes, Hagit Attiya, Keren Censor Hillel, Faith Ellen. 375-384 [doi]
- Strongly linearizable implementations: possibilities and impossibilitiesMaryam Helmi, Lisa Higham, Philipp Woelfel. 385-394 [doi]