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
2012Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring.Henning Hasemann, Juho Hirvonen, Joel Rybicki, Jukka Suomela
2012Improved Approximation for Orienting Mixed Graphs.Iftah Gamzu, Moti Medina
2012Mobile Network Creation Games.Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli
2012Notions of Connectivity in Overlay Networks.Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg
2012Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization.Samir Elouasbi, Andrzej Pelc
2012Online Graph Exploration with Advice.Stefan Dobrev, Rastislav Krlovic, Euripides Markou
2012Homonyms with Forgeable Identifiers.Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The
2012Gathering of Robots on Anonymous Grids without Multiplicity Detection.Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
2012The Fault Tolerant Capacitated k-Center Problem.Shiri Chechik, David Peleg
2012On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract).Jrmie Chalopin, Yves Mtivier, Thomas Morsellino
2012Space Lower Bounds for Low-Stretch Greedy Embeddings.Ioannis Caragiannis, Christos Kalaitzis
2012On Bidimensional Congestion Games.Vittorio Bil, Michele Flammini, Vasco Gallotti
2012Agreement in Directed Dynamic Networks.Martin Biely, Peter Robinson, Ulrich Schmid
2012Changing of the Guards: Strip Cover with Duty Cycling.Amotz Bar-Noy, Ben Baumer, Dror Rawitz
2012Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles.Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro
2012Wireless Network Stability in the SINR Model.Eyjolfur Ingi Asgeirsson, Magns M. Halldrsson, Pradipta Mitra
2012What Can Be Computed without Communications?Heger Arfaoui, Pierre Fraigniaud
2012Analysis of Random Walks Using Tabu Lists.Karine Altisen, Stphane Devismes, Antoine Gerbaud, Pascal Lafourcade
2012Early Deciding Synchronous Renaming in O( logf ) Rounds or Less.Dan Alistarh, Hagit Attiya, Rachid Guerraoui, Corentin Travers
2011Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth.Johannes Schneider, Roger Wattenhofer
2011Network Synchronization and Localization Based on Stolen Signals.Christian Schindelhauer, Zvi Lotker, Johannes Wendeberg
2011A Survey on Some Recent Advances in Shared Memory Models.Sergio Rajsbaum, Michel Raynal
2011SINR Maps: Properties and Applications.David Peleg
2011On the Performance of a Retransmission-Based Synchronizer.Thomas Nowak, Matthias Fgger, Alexander Kler
2011Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing - (Extended Abstract).Heinrich Moser, Ulrich Schmid
376400 of 795← PreviousNext →

Comparable venues

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