Revisiting asynchronous fault tolerant computation with optimal resilience Ittai AbrahamDanny DolevGilad Stern OriginalPaper 03 February 2022 Pages: 333 - 355
Byzantine gathering in polynomial time Sébastien BouchardYoann DieudonnéAnissa Lamani OriginalPaper 21 January 2022 Pages: 235 - 263
Equivalence classes and conditional hardness in massively parallel computations Danupon NanongkaiMichele Scquizzato OriginalPaper Open access 20 January 2022 Pages: 165 - 183
Unbeatable consensus Armando CastañedaYannai A. GonczarowskiYoram Moses OriginalPaper 12 January 2022 Pages: 123 - 143
Strong eventual consistency of the collaborative editing framework WOOT Emin KarayelEdgar Gonzàlez OriginalPaper Open access 04 January 2022 Pages: 145 - 164
Distributed computation and reconfiguration in actively dynamic networks Othon MichailGeorge SkretasPaul G. Spirakis OriginalPaper Open access 19 December 2021 Pages: 185 - 206
Single-source shortest paths in the CONGEST model with improved bounds Shiri ChechikDoron Mukhtar OriginalPaper 27 November 2021 Pages: 357 - 374
Sublinear-time distributed algorithms for detecting small cliques and even cycles Talya EdenNimrod FiatRotem Oshman OriginalPaper 26 November 2021 Pages: 207 - 234
Distributed bare-bones communication in wireless networks Bogdan S. ChlebusDariusz R. KowalskiShailesh Vaya OriginalPaper 25 November 2021 Pages: 59 - 80
Dynamic scheduling in distributed transactional memory Costas BuschMaurice HerlihyGokarna Sharma OriginalPaper 20 November 2021 Pages: 19 - 36
Synthesizing optimal bias in randomized self-stabilization Matthias VolkBorzoo BonakdarpourSaba Aflaki OriginalPaper Open access 08 November 2021 Pages: 37 - 57
On atomic registers and randomized consensus in M&M systems Vassos HadzilacosXing HuSam Toueg OriginalPaper 27 October 2021 Pages: 81 - 103
Distributed computation with continual population growth Da-Jung ChoMatthias FüggerQuentin Soubeyran OriginalPaper Open access 23 October 2021 Pages: 547 - 569
The consensus number of a cryptocurrency Rachid GuerraouiPetr KuznetsovDragos-Adrian Seredinschi OriginalPaper Open access 23 October 2021 Pages: 1 - 15
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications Giuseppe A. Di LunaPaola FlocchiniGiovanni Viglietta OriginalPaper 23 October 2021 Pages: 105 - 122
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals William C. AndertonTrisha ChakrabortyMaxwell Young OriginalPaper 13 September 2021 Pages: 367 - 393
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs Duong NguyenSorrachai YingchareonthawornchaiMurat Demirbas OriginalPaper 13 September 2021 Pages: 319 - 348
Low-congestion shortcut and graph parameters Naoki KitamuraHirotaka KitagawaTaisuke Izumi OriginalPaper Open access 28 August 2021 Pages: 349 - 365
Improved distributed \(\Delta \)-coloring Mohsen GhaffariJuho HirvonenYannic Maus OriginalPaper Open access 09 July 2021 Pages: 239 - 258
A distributed algorithm for directed minimum-weight spanning tree Orr FischerRotem Oshman OriginalPaper 29 June 2021 Pages: 57 - 87
Optimistically tuning synchronous byzantine consensus: another win for null messages Guy GorenYoram Moses OriginalPaper 10 June 2021 Pages: 395 - 410
Phase transition of the 2-Choices dynamics on core–periphery networks Emilio CrucianiEmanuele NataleGiacomo Scornavacca OriginalPaper Open access 26 May 2021 Pages: 207 - 225
Lower bounds for in-network computation of arbitrary functions Iqra Altaf GillaniPooja VyavahareAmitabha Bagchi OriginalPaper 25 April 2021 Pages: 181 - 193
Concurrent disjoint set union Siddhartha V. JayantiRobert E. Tarjan OriginalPaper Open access 23 April 2021 Pages: 413 - 436
MinMax algorithms for stabilizing consensus Bernadette Charron-BostShlomo Moran OriginalPaper 12 April 2021 Pages: 195 - 206
Optimal distributed covering algorithms Ran Ben-BasatGuy EvenGregory Schwartzman OriginalPaper Open access 11 April 2021 Pages: 45 - 55
Multi-shot distributed transaction commit Gregory ChocklerAlexey Gotsman OriginalPaper 24 March 2021 Pages: 301 - 318
The complexity of verifying population protocols Javier EsparzaStefan JaaxChana Weil-Kennedy OriginalPaper Open access 24 March 2021 Pages: 133 - 177
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model Ali MashreghiValerie King OriginalPaper 08 February 2021 Pages: 283 - 299
Redundancy in distributed proofs Laurent FeuilloleyPierre FraigniaudMor Perry OriginalPaper Open access 07 October 2020 Pages: 113 - 132
Time-space trade-offs in population protocols for the majority problem Petra BerenbrinkRobert ElsässerTomasz Radzik OriginalPaper Open access 05 August 2020 Pages: 91 - 111
Optimal extension protocols for byzantine broadcast and agreement Chaya GaneshArpita Patra OriginalPaper 26 July 2020 Pages: 59 - 77
Low-Congestion shortcuts without embedding Bernhard HaeuplerTaisuke IzumiGoran Zuzic OriginalPaper 24 July 2020 Pages: 79 - 90
Property testing of planarity in the CONGEST model Reut LeviMoti MedinaDana Ron OriginalPaper 13 July 2020 Pages: 15 - 32
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions Vittorio BilòMichele FlamminiLuca Moscardelli OriginalPaper 22 June 2020 Pages: 1 - 14
Fast approximate shortest paths in the congested clique Keren Censor-HillelMichal DoryDean Leitersdorf OriginalPaper Open access 28 May 2020 Pages: 463 - 487
Tractable low-delay atomic memory Antonio Fernández AntaTheophanis HadjistasiAlexander A. Schwarzmann OriginalPaper 26 May 2020 Pages: 33 - 58
Composable computation in discrete chemical reaction networks Eric E. SeversonDavid HaleyDavid Doty OriginalPaper 06 May 2020 Pages: 437 - 461
Fault-tolerant simulation of population protocols Giuseppe A. Di LunaPaola FlocchiniGiovanni Viglietta OriginalPaper 25 April 2020 Pages: 561 - 578
Life beyond set agreement David Yu Cheng ChanVassos HadzilacosSam Toueg OriginalPaper 21 April 2020 Pages: 255 - 277
Derandomizing local distributed algorithms under bandwidth restrictions Keren Censor-HillelMerav ParterGregory Schwartzman OriginalPaper 18 April 2020 Pages: 349 - 366
Almost global problems in the LOCAL model Alkida BalliuSebastian BrandtJukka Suomela OriginalPaper Open access 18 April 2020 Pages: 259 - 281
Fooling views: a new lower bound technique for distributed computations under congestion Amir AbboudKeren Censor-HillelChristoph Lenzen OriginalPaper 09 April 2020 Pages: 545 - 559
Editorial: Special issue of PODC 2017 and DISC 2017 Hagit Attiya EditorialNotes 04 April 2020 Pages: 207 - 207
The RedBlue family of universal constructions Panagiota FatourouNikolaos D. Kallimanis OriginalPaper 22 February 2020 Pages: 485 - 513
Communication complexity of approximate maximum matching in the message-passing model Zengfeng HuangBozidar RadunovicQin Zhang OriginalPaper 20 February 2020 Pages: 515 - 531
A tight lower bound for semi-synchronous collaborative grid exploration Sebastian BrandtJara UittoRoger Wattenhofer OriginalPaper Open access 03 February 2020 Pages: 471 - 484
