default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd SIROCCO 2025: Delphi, Greece
- Ulrich Schmid
, Roman Kuznets:
Structural Information and Communication Complexity - 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2-4, 2025, Proceedings. Lecture Notes in Computer Science 15671, Springer 2025, ISBN 978-3-031-91735-6
Regular Papers
- Alessandro Aldini, Agata Ciabattoni, Dominik Pichler, Mirko Tagliaferri:
Support + Belief = Decision Trust. 3-22 - Yackolley Amoussou-Guenou, Maurice Herlihy, Maria Potop-Butucaru:
Asynchronous Byzantine Consensus with Trusted Monotonic Counters. 23-38 - Takumi Araya, Yuichi Sudo:
Sublinear-Time Collision Detection with a Polynomial Number of States in Population Protocols. 39-55 - Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement. 56-73 - Mohamed Anouar Baaziz, Andrzej Pelc:
Exploration of Convex Terrains by a Deterministic Automaton with Pebbles. 74-91 - Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Explicit Token-Based Communication for Mobile Entities. 92-108 - Toni Böhnlein, Pál András Papp, Albert-Jan Nicholas Yzelman:
Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-Offs. 109-126 - François Bonnet, Quentin Bramas, Pierre Courtieu, Xavier Défago, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Deterministic Color-Optimal Self-stabilizing Semi-synchronous Gathering: A Certified Algorithm. 127-143 - Ravi B. Boppana, Magnús M. Halldórsson:
Approximating Independent Sets in Constant Distributed Rounds. 144-158 - Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil:
A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines. 159-175 - Christian Cachin, David Lehnherr, Thomas Studer:
Simplicial Belief. 176-193 - Keren Censor-Hillel, Tomer Even, Maxime Flin, Magnús M. Halldórsson:
When MIS and Maximal Matching are Easy in the Congested Clique. 194-210 - Trisha Chakraborty, Abir Islam, Valerie King, Daniel Rayborn, Jared Saia, Maxwell Young:
Bankrupting DoS Attackers. 211-227 - Yi-Jun Chang, Varsha Dani, Thomas P. Hayes:
Low-Distortion Clustering in Bounded Growth Graphs. 228-244 - Jared Ray Coleman, Dmitry Ivanov, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce:
Multimodal Search on a Line. 245-261 - James Conley, Konstantinos Georgiou:
Multi-agent Disk Inspection. 262-280 - Orr Fischer, Rotem Oshman, Adi Rosén, Tal Roth:
Pointer Chasing with Unlimited Interaction. 281-296 - Paola Flocchini, Alfredo Navarra, Debasish Pattanayak, Francesco Piselli, Nicola Santoro:
Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation. 297-314 - Raphael Gerlach, Sören von der Gracht, Michael Dellnitz:
On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies. 315-332 - Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi:
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. 333-349 - Nikos Leonardos:
Lower Bounds for Uniform Read-Once Threshold Formulae in the Randomized Decision Tree Model. 350-365 - Vignesh Manoharan, Vijaya Ramachandran:
Distributed Distance Sensitivity Oracles. 366-383 - Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei:
Self-stabilizing Graph Exploration by a Single Agent. 384-400 - Borna Simic, Roger Wattenhofer:
Labeling Embeddings of Planar Graphs for Face-Adjacency. 401-415
Brief Announcements
- Samuel Baldwin, Cole Hausman, Mohamed Bakr, Edward Talmage:
Brief Announcement: Relaxation for Efficient Asynchronous Queues. 419-424 - Stephan Felber, Bernardo Hummes Flores, Hugo Rincon Galeana:
Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems. 425-430 - Yuki Kawashima, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model. 431-436 - Hugo Mirault, Peter Robinson, Ming Ming Tan, Xianbin Zhu:
Brief Announcement: Perfect Matching with Few Link Activations. 437-443
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-10-02 00:57 CEST 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:
