default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th SIROCCO 2021: Wrocław, Poland
- Tomasz Jurdzinski
, Stefan Schmid:
Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings. Lecture Notes in Computer Science 12810, Springer 2021, ISBN 978-3-030-79526-9
Keynote Talk
- Dan Alistarh, Peter Davies:
Collecting Coupons is Faster with Friends. 3-12
Distributed Graph Algorithms
- Nicolas Bousquet, Louis Esperet, François Pirot:
Distributed Algorithms for Fractional Coloring. 15-30 - Yi-Jun Chang, Jan Studený, Jukka Suomela:
Distributed Graph Problems Through an Automata-Theoretic Lens. 31-49 - Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin:
Near-Optimal Scheduling in the Congested Clique. 50-67 - Magnús M. Halldórsson, Alexandre Nolin:
Superfast Coloring in CONGEST via Efficient Color Sampling. 68-83
Concurrency, Consensus and Dynamics
- Dan Alistarh, Faith Ellen, Joel Rybicki:
Wait-Free Approximate Agreement on Graphs. 87-105 - Antonio Fernández Anta, Chryssis Georgiou, Theophanis Hadjistasi, Nicolas Nicolaou, Efstathios Stavrakis, Andria Trigeorgi:
Fragmented Objects: Boosting Concurrency of Shared Large Objects. 106-126 - Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas:
Threshold-Based Network Structural Dynamics. 127-145 - Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph:
The Epigenetic Consensus Problem. 146-163
Mobile Robots and Agents
- Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. 167-184 - Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Graph Exploration by Energy-Sharing Mobile Agents. 185-203 - Henri Devillez, Béni Egressy, Robin Fritsch, Roger Wattenhofer:
Two-Agent Tree Evacuation. 204-221 - Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. 222-239
Security and Efficiency of Network Communication
- Giacomo Giuliari, Marc Wyss, Markus Legner, Adrian Perrig:
GMA: A Pareto Optimal Distributed Resource-Allocation Algorithm. 243-261 - Muhammad Samir Khan, Nitin H. Vaidya:
Testing Equality Under the Local Broadcast Model. 262-276 - Sergio Rajsbaum:
A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems. 277-295 - Volker Turau:
Synchronous Concurrent Broadcasts for Intermittent Channels with Bounded Capacities. 296-312
Network and Graph Structures
- Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-Tolerant Distance Labeling for Planar Graphs. 315-333 - Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny:
Constant Round Distributed Domination on Graph Classes with Bounded Expansion. 334-351 - Christoph Lenzen, Hossein Vahidi:
Approximate Minimum Directed Spanning Trees Under Congestion. 352-369 - Bogdan-Adrian Manghiuc:
Distributed Detection of Clusters of Arbitrary Size. 370-387
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:37 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:
