8. SIROCCO 2001:
Val de Nuria,
Spain
Francesc Comellas, Josep Fàbrega, Pierre Fraigniaud (Eds.):
SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001.
Proceedings in Informatics 8 Carleton Scientific 2001, ISBN 1-894145-10-0 
@proceedings{DBLP:conf/sirocco/2001,
editor = {Francesc Comellas and
Josep F{\`a}brega and
Pierre Fraigniaud},
title = {SIROCCO 8, Proceedings of the 8th International Colloquium on
Structural Information and Communication Complexity, Vall de
N{\'u}ria, Girona-Barcelona, Catalonia, Spain, 27-29 June,
2001},
booktitle = {SIROCCO},
publisher = {Carleton Scientific},
series = {Proceedings in Informatics},
volume = {8},
year = {2001},
isbn = {1-894145-10-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Lali Barrière, Stefan Dobrev:
Leader Election in Abelian Cayley Graphs.
5-20
- Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot:
Cycle Covering.
21-34
- Prosenjit Bose, Pat Morin:
Competitive Online Routing in Geometric Graphs.
35-44
- Stefan D. Bruda, Selim G. Akl:
Parallel Real-Time Complexity A Strong Infinite Hierarchy.
45-60
- Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Group Mutual Exclusion in Token Rings.
61-76
- Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies.
77-88
- Victor Chepoi, Alexis Rollin:
Interval Routing in Some Planar Quadrangulations.
89-104
- Peter Damaschke:
Worst-case bounds for blind broadcasting in small-degree networks.
105-116
- Michael Elkin, David Peleg:
The Client-Server 2-Spanner Problem with Applications to Network Design.
117-132
- Guillaume Fertin, André Raspaud:
k-Neighborhood Broadcasting.
133-146
- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Pattern Formation by Anonymous Robots Without Chirality.
147-162
- Yashar Ganjali:
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes.
163-178
- Emmanuel Godard, Yves Métivier:
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge.
179-194
- Peter Gvozdjak, Joseph G. Peters:
Modelling Links in Inclined LEO Satellite Networks.
195-208
- Paul R. Hafner:
On the graphs of McKay-Miller-Sirán.
209-216
- Alexander Kesselman, Yishay Mansour:
QoS-Competitive Video Buffering.
217-230
- Rastislav Kralovic, Peter Ruzicka:
On Immunity and Catastrophic Indices of Graphs.
231-242
- Martin Makuch, Peter Ruzicka:
On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks.
243-258
- Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman:
Optimal Scheduling for Distributed Cooperation Without Communication.
259-274
- Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy:
Efficient Condition-Based Consensus.
275-292
- Toshio Nakata, Masafumi Yamashita:
Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game.
293-304
- Andre Osterloh:
Oblivious Routing on d-Dimensional Meshes.
305-320
- Petr Salinger, Pavel Tvrdík:
Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing.
321-336
- John Watkinson, Micah Adler, Faith E. Fich:
New Protocols for Asymmetric Communication Channels.
337-350
- Norbert Zeh, Nicola Santoro:
On Finding Minimum Deadly Sets for Directed Networks.
351-366
Last update Fri May 25 08:39:37 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
