2. SIROCCO 1995:
Olympia,
Greece
Lefteris M. Kirousis, Christos Kaklamanis (Eds.):
Structure, Information and Communication Complexity, SIROCCO '95, Proceedings of the 2nd Colloquium on Structural Information and Communication Complexity, Olympia Greece, June 12-14, 1995.
Proceedings in Informatics 2 Carleton Scientific 1996 
- Miriam Di Ianni, Michele Flammini, Rossella Flammini, Sandro Salomone:
Systolic Acyclic Orientations for Deadlock Prevention.
1-12
- Paola Flocchini, Bernard Mans, Nicola Santoro:
Translation Capabilities of Sense of Direction.
13-25
- Paola Flocchini, Nicola Santoro:
Topological Constraints for Sense of Direction.
27-38
- Paolo Boldi, Sebastiano Vigna:
On the Complexity of Deciding Sense of Direction.
39-51
- Nancy Norris:
Computing Functions on Partially Wireless Networks.
53-64
- Alessandro Roncato:
Gap Theorems for Anonymous Rings.
65-76
- Bram Verweij, Gerard Tel:
A Monte Carlo Algorithm for Election.
77-88
- Danny Krizanc, Flaminia L. Luccio:
Boolean Routing on Chordal Rings.
89-100
- Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Implicit Routing and Shortest Path Information (Extended Abstract).
101-112
- Cyril Gavoille, Eric Guévremont:
On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing.
113-121
- Savio S. H. Tse, Francis C. M. Lau:
Lower Bounds for Multi-label Interval Routing.
123-134
- Johan Vounckx, Geert Deconinck, Rudy Lauwereins:
A Compact Fault-tolerant, Deadlock-free, Minimal Routing Algorithm for n-Dimensional Wormhole Switching Based Meshes.
135-146
- Efstratios Karaivazoglou, Paul G. Spirakis, Vasilis Triantafilou:
Wormhole Routing Simulation on a Mesh.
147-158
- Andrzej Pelc:
Fast Fault-tolerant Broadcasting and Gossiping.
159-172
- Jean-Claude Bermond, David Peleg:
The Power of Small Coalitions in Graphs.
173-184
- Nick D. Dendris, Lefteris M. Kirousis:
Linear-time Parallel Arc Consistency with Reduced Communication Requirements.
185-198
- Jean-Claude Bermond, Stephane Perennes:
Efficient Broadcasting Protocols on the de Bruijn and Similar Networks.
199-209
- José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto:
Bisecting de Bruijn and Kautz Graphs.
211-222
Copyright © Wed Dec 16 19:46:45 2009
by Michael Ley (ley@uni-trier.de)
