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
2007A Simple Optimistic Skiplist Algorithm.Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit
2007Fast Periodic Graph Exploration with Constant Memory.Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang
2007Time Optimal Gathering in Sensor Networks.Luisa Gargano
2007Optimal Conclusive Sets for Comparator Networks.Guy Even, Tamir Levi, Ami Litman
2007Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots.Asaf Efrima, David Peleg
2007Why Robots Need Maps.Miroslaw Dynia, Jakub Lopuszanski, Christian Schindelhauer
2007Swing Words to Make Circle Formation Quiescent.Yoann Dieudonn, Franck Petit
2007Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents.Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita
2007Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs.Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia
2007Location Oblivious Distributed Unit Disk Graph Coloring.Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis
2007A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxs
2007Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers.Tiziana Calamoneri, Emanuele G. Fusco, Anil M. Shende, Sunil M. Shende
2007Upper Bounds and Algorithms for Parallel Knock-Out Numbers.Hajo Broersma, Matthew Johnson, Danil Paulusma
2007Treewidth: Structure and Algorithms.Hans L. Bodlaender
2007Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions.Jean-Claude Bermond, Frdric Giroire, Stphane Prennes
2007Edge Fault-Diameter of Cartesian Product of Graphs.Iztok Banic, Janez Zerovnik
2006Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?.Roger Wattenhofer
2006An Optimal Rebuilding Strategy for a Decremental Tree Problem.Nicolas Thibault, Christian Laforest
2006Approximate Top-k Queries in Sensor Networks.Boaz Patt-Shamir, Allon Shafrir
2006Strongly Terminating Early-StoppingPhilippe Raipin Parvdy, Michel Raynal, Corentin Travers
2006Discovering Network Topology in the Presence of Byzantine Faults.Mikhail Nesterenko, Sbastien Tixeuil
20063-D Minimum Energy Broadcasting.Alfredo Navarra
2006Mobile Agent Rendezvous: A Survey.Evangelos Kranakis, Danny Krizanc, Sergio Rajsbaum
2006How to Meet in Anonymous Network.Dariusz R. Kowalski, Adam Malinowski
2006Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs.Adrian Kosowski
501525 of 795← PreviousNext →

Comparable venues

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