Skip to content

International Colloquium on Structural Information and Communication Complexity

SIROCCO

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

795

1994–2026

Papers per year

199432 peak2026

SIROCCO papers

795 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2002Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol.Nikolaos Glinos, Doan B. Hoang, Chi Nguyen, Antonios Symvonis
2002Towards a Theory of Peer-to-Peer Computability.Joachim Giesen, Roger Wattenhofer, Aaron Zollinger
2002Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults.Stefan Dobrev
2002Latency Measures and Lower Bounds for Consensus with Failure Detectors.Carole Delporte-Gallet, Hugues Fauconnier
2002Broadcasting in Small-world Communication Networks.Francesc Comellas, Margarida Mitjana, Joseph G. Peters
2002Gathering Autonomous Mobile Robots.Mark Cieliebak, Giuseppe Prencipe
2002Finding Spanning Forests by Broadcasting.Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski
2002Asymmetric Communication Protocols via Hotlink Assignments.Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin
2002New Bounds for the Firing Squad Problem on a Ring.Andr Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon
2002Hierarchical Ring Network Design.Jean-Claude Bermond, Sbastien Choplin, Stephane Perennes
2001On Finding Minimum Deadly Sets for Directed Networks.Norbert Zeh, Nicola Santoro
2001New Protocols for Asymmetric Communication Channels.John Watkinson, Micah Adler, Faith E. Fich
2001Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing.Petr Salinger, Pavel Tvrdk
2001Oblivious Routing on d-Dimensional Meshes.Andre Osterloh
2001Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game.Toshio Nakata, Masafumi Yamashita
2001Efficient Condition-Based Consensus.Achour Mostfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy
2001Optimal Scheduling for Distributed Cooperation Without Communication.Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
2001On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks.Martin Makuch, Peter Ruzicka
2001On Immunity and Catastrophic Indices of Graphs.Rastislav Kralovic, Peter Ruzicka
2001QoS-Competitive Video Buffering.Alexander Kesselman, Yishay Mansour
2001On the graphs of McKay-Miller-Sirn.Paul R. Hafner
2001Modelling Links in Inclined LEO Satellite Networks.Peter Gvozdjak, Joseph G. Peters
2001A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge.Emmanuel Godard, Yves Mtivier
2001Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes.Yashar Ganjali
2001Pattern Formation by Anonymous Robots Without Chirality.Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
626650 of 795← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.