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
1997Approximating Minimum Communication Spanning Trees.David Peleg
1997Static Frequency Assignment in Cellular Networks.Lata Narayanan, Sunil M. Shende
1997Compact Routing on Chordal Rings.Lata Narayanan, Jaroslav Opatrny
1997About the local detection of termination of local computations in graphs.Yves Mtivier, Anca Muscholl, Pierre-Andr Wacrenier
1997An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three.Cyril Gavoille, Marc Gengler
1997Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks.Pierre Fraigniaud, Sandrine Vial
1997Duality in Chain ATM Virtual Path Layouts.Marcelo Feighelstein, Shmuel Zaks
1997Advances in Rate-Based Flow Control.Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
1997Bounds for the On-line Multicast Problem in Directed Graphs.Michalis Faloutsos, Rajesh Pankaj, Kenneth C. Sevcik
1997The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing.Tamar Eilam, Shlomo Moran, Shmuel Zaks
1997Linear Broadcasting and N loglog N Election in Unoriented Hypercubes.Stefan Dobrev, Peter Ruzicka
1997An Optimal Algorithm for Broadcasting Multiple Messages in Trees.Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
1997Computing Vector Functions on Anonymous Networks.Paolo Boldi, Sebastiano Vigna
1997Embedding Tori in Partitioned Optical Passive Star Networks.Pascal Berthom, Johanne Cohen, Afonso Ferreira
1997Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters.Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
1997An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks.Fred S. Annexstein, Chris Giannella
1997On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings.Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
1996Necklace-based Factorization of de Bruijn Digraphs.Pavel Tvrdk
1996Exact Bandwith of Parallel-Processor Networks.Pilar de la Torre, Clyde P. Kruskal
1996Distributed Anonymous Mobile Robots.Ichiro Suzuki, Masafumi Yamashita
1996A Routing Algorithm for Networks Based on Distance-Hereditary Topologies.Gabriele Di Stefano
1996Virtual Path Layout for Some Bounded Degree Networks.Ladislav Stacho, Imrich Vrto
1996Systolic Gossip in Complete Trees.Alessandro Roncato, Walter Unger
1996Majority Voting, Coalitions and Monopolies in Graphs.David Peleg
1996Efficient fault location with small risk.Andrzej Pelc
726750 of 795← PreviousNext →

Comparable venues

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