default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed Computing, Volume 33
Volume 33, Number 1, February 2020
- Irvan Jahja, Haifeng Yu, Yuda Zhao:
Some lower bounds in dynamic networks with oblivious adversaries. 1-40 - Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro
:
Distributed exploration of dynamic rings. 41-67 - Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Shape formation by programmable particles. 69-101
Volume 33, Number 2, April 2020
- Gadi Taubenfeld:
The computational structure of progress conditions and shared objects. 103-123 - Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A complexity-based classification for multiprocessor synchronization. 125-144 - Keren Censor-Hillel, Michal Dory:
Fast distributed approximation for TAP and 2-edge-connectivity. 145-168 - Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc:
Deciding and verifying network properties locally with few output bits. 169-187 - Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson:
The complexity of leader election in diameter-two networks. 189-205
Volume 33, Number 3-4, June 2020
- Hagit Attiya:
Editorial: Special issue of PODC 2017 and DISC 2017. 207 - Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Adding concurrency to smart contracts. 209-225 - Weiming Feng, Yuxin Sun, Yitong Yin:
What can be sampled locally? 227-253 - David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Life beyond set agreement. 255-277 - Manuela Fischer:
Improved deterministic distributed matching via rounding. 279-291 - Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved distributed degree splitting and edge coloring. 293-310 - Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-aware network designs of bounded degree. 311-325 - Shady Issa, Pascal Felber, Alexander Matveev, Paolo Romano:
Extending hardware transactional memory capacity via rollback-only transactions and suspend/resume. 327-348 - Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing local distributed algorithms under bandwidth restrictions. 349-366
Volume 33, Number 5, October 2020
- Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski:
Confidential gossip. 367-392 - Xavier Défago, Maria Potop-Butucaru, Philippe Raipin Parvédy:
Self-stabilizing gathering of mobile robots under crash or Byzantine faults. 393-421 - Vidhya Tekken Valapil, Sandeep S. Kulkarni:
Preserving stabilization while practically bounding state space using incorruptible partially synchronized clocks. 423-443 - Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Meeting in a polygon by anonymous oblivious robots. 445-469
Volume 33, Number 6, December 2020
- Sebastian Brandt, Jara Uitto, Roger Wattenhofer:
A tight lower bound for semi-synchronous collaborative grid exploration. 471-484 - Panagiota Fatourou, Nikolaos D. Kallimanis:
The RedBlue family of universal constructions. 485-513 - Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang:
Communication complexity of approximate maximum matching in the message-passing model. 515-531 - Artur Czumaj, Christian Konrad:
Detecting cliques in CONGEST networks. 533-543 - Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen:
Fooling views: a new lower bound technique for distributed computations under congestion. 545-559 - Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Fault-tolerant simulation of population protocols. 561-578
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-01-23 20:32 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:
