Journal: Distributed Computing

Volume 33, Issue 6

471 -- 484Sebastian Brandt 0002, Jara Uitto, Roger Wattenhofer. A tight lower bound for semi-synchronous collaborative grid exploration
485 -- 513Panagiota Fatourou, Nikolaos D. Kallimanis. The RedBlue family of universal constructions
515 -- 531Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang 0001. Communication complexity of approximate maximum matching in the message-passing model
533 -- 543Artur Czumaj, Christian Konrad. Detecting cliques in CONGEST networks
545 -- 559Amir Abboud, Keren Censor Hillel, Seri Khoury, Christoph Lenzen. Fooling views: a new lower bound technique for distributed computations under congestion
561 -- 578Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta. Fault-tolerant simulation of population protocols

Volume 33, Issue 5

367 -- 392Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski. Confidential gossip
393 -- 421Xavier Défago, Maria Potop-Butucaru, Philippe Raipin Parvédy. Self-stabilizing gathering of mobile robots under crash or Byzantine faults
423 -- 443Vidhya Tekken Valapil, Sandeep S. Kulkarni. Preserving stabilization while practically bounding state space using incorruptible partially synchronized clocks
445 -- 469Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita. Meeting in a polygon by anonymous oblivious robots

Volume 33, Issue 3

207 -- 0Hagit Attiya. Editorial: Special issue of PODC 2017 and DISC 2017
209 -- 225Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen. Adding concurrency to smart contracts
227 -- 253Weiming Feng, Yuxin Sun, Yitong Yin. What can be sampled locally?
255 -- 277David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg. Life beyond set agreement
279 -- 291Manuela Fischer. Improved deterministic distributed matching via rounding
293 -- 310Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto. Improved distributed degree splitting and edge coloring
311 -- 325Chen Avin, Kaushik Mondal 0001, Stefan Schmid 0001. Demand-aware network designs of bounded degree
327 -- 348Shady Issa, Pascal Felber, Alexander Matveev, Paolo Romano 0002. Extending hardware transactional memory capacity via rollback-only transactions and suspend/resume
349 -- 366Keren Censor Hillel, Merav Parter, Gregory Schwartzman. Derandomizing local distributed algorithms under bandwidth restrictions

Volume 33, Issue 2

103 -- 123Gadi Taubenfeld. The computational structure of progress conditions and shared objects
125 -- 144Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu. A complexity-based classification for multiprocessor synchronization
145 -- 168Keren Censor Hillel, Michal Dory. Fast distributed approximation for TAP and 2-edge-connectivity
169 -- 187Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc. Deciding and verifying network properties locally with few output bits
189 -- 205Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson 0002. The complexity of leader election in diameter-two networks

Volume 33, Issue 1

1 -- 40Irvan Jahja, Haifeng Yu, Yuda Zhao. Some lower bounds in dynamic networks with oblivious adversaries
41 -- 67Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro. Distributed exploration of dynamic rings
69 -- 101Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi. Shape formation by programmable particles