1 option
Structural information and communication complexity 33rd International Colloquium, SIROCCO 2026, Durham, UK, June 9-11, 2026 proceedings Chryssis Georgiou, editor
Springer Nature - Springer Computer Science eBooks 2026 English International Available online
View online- Format:
- Book
- Conference/Event
- Conference Name:
- Colloquium on Structural Information and Communication Complexity (33rd : 2026 : Durham, England)
- Series:
- Lecture notes in computer science ; 16488.
- Lecture notes in computer science 1611-3349 16488
- Language:
- English
- Subjects (All):
- Electronic data processing--Distributed processing.
- Computer networks.
- Genre:
- proceedings (reports)
- Conference papers and proceedings
- Conference papers and proceedings.
- Physical Description:
- 1 online resource
- Place of Publication:
- Cham, Switzerland Springer [2026]
- Summary:
- "This book constitutes the refereed proceedings of the 33rd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2026, held in Durham, UK, during June 9–11, 2026.The 28 full papers included in this book were carefully reviewed and selected from 65 submissions. They focus on innovative methodological and solution approaches in structural knowledge, communication, and computing in decentralized systems of multiple communicating entities"-- Springer Nature Link
- Contents:
- A simple distributed deterministic planar separator / Yaseen Abd‑Elhaleem, Michal Dory, and Oren Weimann
- Maintaining bipartite colourings on temporal graphs on a budget / Duncan Adamson, George B. Mertzios, and Paul G. Spirakis
- Formal certification of async protocols : the case of gathering in R2 using Weber points / Maria‑Virginia Aponte, Mathis Bouverot‑Dupuis, Quentin Bramas, Pierre Courtieu, Lionel Rieg, and Xavier Urbain
- Equivalence and separation between heard‑of and asynchronous message‑passing models / Hagit Attiya, Armando Castañeda, Dhrubajyoti Ghosh, and Thomas Nowak
- Minimum deviation distance realization / Amotz Bar‑Noy, David Peleg, Mor Perry, Yingli Ran, and Dror Rawitz
- Online bisection with ring demands / Mateusz Basiak, Marcin Bienkowski, Guy Even, and Agnieszka Tatarczuk
- On the solvability of Byzantine‑tolerant reliable communication in dynamic networks / Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil
- A lightweight approach for state machine replication / Christian Cachin, Jinfeng Dou, Christian Scheideler, and Philipp Schneider
- Silent self‑stabilising leader election in programmable matter systems with holes / Jérémie Chalopin, Shantanu Das, and Maria Kokkou
- Leveraging structural knowledge for solving election in anonymous networks with shared randomness / Jérémie Chalopin and Emmanuel Godard
- Maintaining a bounded degree expander in dynamic peer‑to‑peer networks / Antonio Cruciani
- Fast distributed sampling of colorings of trees with few colors / Varsha Dani and Asya Vitko
- Distributed sparsest cut via eigenvalue estimation / Yannic Maus and Tijn de Vos
- Cow path by finite agent : time vs pebbles / Stefan Dobrev, Rastislav Královič, Richard Královič, Dana Pardubská, and Peter Rossmanith
- Multiparty equality in the local broadcast model / Louis Esperet and Jean‑Florent Raymond
- Universal dancing by luminous robots under sequential schedulers / Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, and Nicola Santoro
- Polynomial time local decision revisited / Laurent Feuilloley, Soumyadeep Paul, and Ami Paz
- Proving there is a leader without naming it / Laurent Feuilloley, Josef Erik Sedláček, and Martin Slávik
- Fast distributed computation of compact routing schemes / Jinfeng Dou, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann
- Online exploration of grid graphs with multiple searchers / Yuya Higashikawa, Shuichi Miyazaki, and Daiki Okayama
- Towards optimal distributed delta coloring / Manuel Jakob and Yannic Maus
- Extending the writing distance : the R(dr)W(dw) communication model for self‑stabilizing distributed algorithms / Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, and Fukuhito Ooshita
- Indirect coflow scheduling / Alexander Lindermayr, Kirk Pruhs, Andréa W. Richa, and Tegan Wilson
- Byzantine approximate agreement cross‑chain task / Maurice Herlihy, Bo Pan, Maria Potop‑Butucaru, and Liuba Shrira
- Asynchronous fault‑tolerant mutual visibility / Subhajit Pramanick, Saswata Jana, and Partha Sarathi Mandal
- Distributed MIS algorithms for rational agents using games / Nithin Salevemula and Shreyas Pai
- Uniform deployment of myopic luminous robots in rings / Masahiro Shibata, Sayaka Kamei, Fukuhito Ooshita, and Hirotsugu Kakugawa
- A formalization of knowledge in fault tolerant distributed algorithms / Ron van der Meyden and Godfrey Wong
- Notes:
- Includes bibliographical references and index
- Online resource; title from PDF title page (Springer Nature Link, viewed May 28, 2026)
- Other Format:
- Print version Colloquium on Structural Information and Communication Complexity (33rd : 2026 : Durham, England) Structural information and communication complexity
- ISBN:
- 9783032264657
- 3032264650
- OCLC:
- 1592832785
- Access Restriction:
- Restricted for use by site license
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.