default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed Computing, Volume 34
Volume 34, Number 1, February 2021
- Vittorio Bilò
, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. 1-14 - Reut Levi, Moti Medina, Dana Ron:
Property testing of planarity in the CONGEST model. 15-32 - Antonio Fernández Anta, Theophanis Hadjistasi, Nicolas Nicolaou, Alexandru Popa, Alexander A. Schwarzmann:
Tractable low-delay atomic memory. 33-58 - Chaya Ganesh, Arpita Patra:
Optimal extension protocols for byzantine broadcast and agreement. 59-77 - Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion shortcuts without embedding. 79-90
Volume 34, Number 2, April 2021
- Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
Time-space trade-offs in population protocols for the majority problem. 91-111 - Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in distributed proofs. 113-132 - Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy:
The complexity of verifying population protocols. 133-177
Volume 34, Number 3, June 2021
- Reviewer Acknowledgement (2020). 179
- Iqra Altaf Gillani, Pooja Vyavahare, Amitabha Bagchi:
Lower bounds for in-network computation of arbitrary functions. 181-193 - Bernadette Charron-Bost, Shlomo Moran:
MinMax algorithms for stabilizing consensus. 195-206 - Emilio Cruciani, Emanuele Natale, André Nusser, Giacomo Scornavacca:
Phase transition of the 2-Choices dynamics on core-periphery networks. 207-225
Volume 34, Number 4, August 2021
- Hagit Attiya:
Special issue on PODC 2018 and DISC 2018. 227 - Andrey Kupavskii, Emo Welzl:
Lower bounds for searching robots, some faulty. 229-237 - Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved distributed Δ-coloring. 239-258 - Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
Almost global problems in the LOCAL model. 259-281 - Ali Mashreghi, Valerie King:
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model. 283-299 - Gregory V. Chockler, Alexey Gotsman:
Multi-shot distributed transaction commit. 301-318
Volume 34, Number 5, October 2021
- Duong N. Nguyen, Sorrachai Yingchareonthawornchai, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Murat Demirbas:
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs. 319-348 - Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-congestion shortcut and graph parameters. 349-365 - William C. Anderton, Trisha Chakraborty, Maxwell Young:
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals. 367-393 - Guy Goren, Yoram Moses:
Optimistically tuning synchronous byzantine consensus: another win for null messages. 395-410
Volume 34, Number 6, December 2021
- Hagit Attiya:
Special issue on PODC 2019. 411 - Siddhartha V. Jayanti, Robert E. Tarjan:
Concurrent disjoint set union. 413-436 - Eric E. Severson, David Haley, David Doty:
Composable computation in discrete chemical reaction networks. 437-461 - Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast approximate shortest paths in the congested clique. 463-487
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
