default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th SIROCCO 2023: Alcalá de Henares, Spain
- Sergio Rajsbaum
, Alkida Balliu, Joshua J. Daymude, Dennis Olivetti:
Structural Information and Communication Complexity - 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023, Proceedings. Lecture Notes in Computer Science 13892, Springer 2023, ISBN 978-3-031-32732-2
30th Anniversary and Special Models of Computations
- Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Degree Realization by Bipartite Multigraphs. 3-17 - Pierluigi Crescenzi:
Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution. 18-32 - Michel Raynal:
About Informatics, Distributed Computing, and Our Job: A Personal View. 33-45 - Nancy A. Lynch, Frederik Mallmann-Trenn:
Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks with Feedback. 46-86
SIROCCO Main Track
- Duncan Adamson, Magnús M. Halldórsson, Alexandre Nolin:
Distributed Coloring of Hypergraphs. 89-111 - Ramesh Adhikari, Costas Busch:
Lockless Blockchain Sharding with Multiversion Control. 112-131 - Vitaly Aksenov, Anton Paramonov, Iosif Salem, Stefan Schmid:
Self-adjusting Linear Networks with Ladder Demand Graph. 132-148 - Yuichi Asahiro, Masafumi Yamashita:
Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). 149-164 - Zeta Avarikioti, Lioba Heimbach, Roland Schmid, Laurent Vanbever, Roger Wattenhofer, Patrick Wintermeyer:
FnF-BFT: A BFT Protocol with Provable Performance Under Attack. 165-198 - Zeta Avarikioti, Antoine Desjardins, Lefteris Kokoris-Kogias, Roger Wattenhofer:
Divide & Scale: Formalization and Roadmap to Robust Sharding. 199-245 - Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner:
Zero-Memory Graph Exploration with Unknown Inports. 246-261 - Yi-Jun Chang:
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks. 262-296 - Jared Ray Coleman, Lorand Cheng, Bhaskar Krishnamachari:
Search and Rescue on the Line. 297-316 - Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann:
Routing Schemes for Hybrid Communication Networks. 317-338 - Sameep Dahal, Jukka Suomela:
Distributed Half-Integral Matching and Beyond. 339-356 - Varsha Dani, Abir Islam, Jared Saia:
Boundary Sketching with Asymptotically Optimal Distance and Rotation. 357-385 - Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro, Frédéric Simard:
Cops & Robber on Periodic Temporal Graphs: Characterization and Improved Bounds. 386-405 - Tijn de Vos:
Minimum Cost Flow in the CONGEST Model. 406-426 - Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin:
The Communication Complexity of Functions with Large Outputs. 427-458 - Pierre Fraigniaud, Maël Luce, Ioan Todinca:
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. 459-481 - Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Energy-Efficient Distributed Algorithms for Synchronous Networks. 482-501 - Luisa Gargano, Adele A. Rescigno:
Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity. 502-519 - Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis:
Overcoming Probabilistic Faults in Disoriented Linear Search. 520-535 - Cameron Matsui, Will Rosenbaum:
Packet Forwarding with Swaps. 536-557 - Sriram V. Pemmaraju, Joshua Z. Sobel:
Exact Distributed Sampling. 558-575 - Stefan Schmid, Jakub Svoboda, Michelle Yeo:
Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation. 576-594
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-10 18:41 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:
