default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st SIROCCO 2024: Vietri sul Mare, Italy
- Yuval Emek:
Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27-29, 2024, Proceedings. Lecture Notes in Computer Science 14662, Springer 2024, ISBN 978-3-031-60602-1
Invited Paper
- Giovanni Viglietta:
History Trees and Their Applications. 3-23
Regular Papers
- Ignacio Amores-Sesar
, Christian Cachin, Philipp Schneider:
An Analysis of Avalanche Consensus. 27-44 - John Augustine, William K. Moses Jr., Gopal Pandurangan:
Awake Complexity of Distributed Minimum Spanning Tree. 45-63 - Tugkan Batu, Amitabh Trehan, Chhaya Trehan:
All You Need are Random Walks: Fast and Simple Distributed Conductance Testing. 64-82 - Leyla Biabani, Ami Paz:
k-Center Clustering in Distributed Models. 83-100 - Lélia Blin, Gabriel Le Bouder, Franck Petit:
Optimal Memory Requirement for Self-stabilizing Token Circulation. 101-118 - Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Rings. 119-137 - Arnaud Casteigts, Timothée Corsini:
In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs. 138-155 - Keren Censor-Hillel, Yuka Machino, Pedro Soto:
Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens. 156-173 - Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Leader Election for Stationary Programmable Matter with Common Direction. 174-191 - Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli:
Mutual Visibility in Hypercube-Like Graphs. 192-207 - Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Non-negotiating Distributed Computing. 208-225 - Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Better Sooner Rather Than Later. 226-237 - Panagiota Fatourou, Nikos Giachoudis, George Mallis:
Highly-Efficient Persistent FIFO Queues. 238-261 - Costas Busch, Pawel Garncarek, Dariusz R. Kowalski:
Locally Balanced Allocations Under Strong Byzantine Influence. 262-280 - Magnús M. Halldórsson, Dror Rawitz:
Distributed Fractional Local Ratio and Independent Set Approximation. 281-299 - Hongyan Ji, Sriram V. Pemmaraju:
Towards Singular Optimality in the Presence of Local Initial Knowledge. 300-317 - Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch:
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. 318-335 - Keren Censor-Hillel, Majd Khoury:
On Distributed Computation of the Minimum Triangle Edge Transversal. 336-358 - Lucianna Kiffer, Rajmohan Rajaraman:
Stability of P2P Networks Under Greedy Peering. 359-383 - Irina Kostitsyna, David Liedtke, Christian Scheideler:
Universal Coating by 3D Hybrid Programmable Matter. 384-401 - Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Distributed Binary Labeling Problems in High-Degree Graphs. 402-419 - Vignesh Manoharan, Vijaya Ramachandran:
Computing Replacement Paths in the CONGEST Model. 420-437 - Gadi Taubenfeld:
Reaching Agreement Among k out of n Processes. 438-455 - Guillermo Toyos-Marfurt, Petr Kuznetsov:
On the Bit Complexity of Iterated Memory. 456-477
Brief Announcements
- Emmanuelle Anceaume, Davide Frey, Arthur Rauch:
Sharding in Permissionless Systems in Presence of an Adaptive Adversary. 481-487 - Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal:
Online Drone Scheduling for Last-Mile Delivery. 488-493 - Keita Nakajima, Kaito Takase, Koichi Wada:
Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. 494-500 - Hugo Rincon Galeana, Ulrich Schmid:
Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems. 501-506 - Vasiliki Liagkou, Panagiotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
On the Existence of Consensus Converging Organized Groups in Large Social Networks. 507-512 - Erik van den Akker, Kevin Buchin, Klaus-Tycho Foerster:
Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs. 513-519
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-02-20 19:48 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:
