10. SIROCCO 2003:
Umeå,
Sweden
Jop F. Sibeyn (Ed.):
SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Umeå Sweden.
Proceedings in Informatics 17 Carleton Scientific 2003, ISBN 1-894145-16-X
@proceedings{DBLP:conf/sirocco/2003,
editor = {Jop F. Sibeyn},
title = {SIROCCO 10: Proceedings of the 10th Internaltional Colloquium
on Structural Information Complexity, June 18-20, 2003, Ume{\aa}
Sweden},
booktitle = {SIROCCO},
publisher = {Carleton Scientific},
series = {Proceedings in Informatics},
volume = {17},
year = {2003},
isbn = {1-894145-16-X},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
1-16
- Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.
17-32
- Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang:
Bounds for Frequency Estimation of Packet Streams.
33-42
- Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano:
Approximate Multicommodity Flow for WDM Networks Design.
43-56
- Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
The Cost of Concurrent, Low-Contention Read-Modify-Write.
57-72
- Francesc Comellas, Guillaume Fertin, André Raspaud:
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs.
73-87
- Francesc Comellas, Margarida Mitjana:
Communication Properties of Cycle Prefix Digraphs.
89-99
- Christian Destré, Christian Laforest, Sandrine Vial:
The Broadcast Assignment Problem.
101-116
- Antonio Fernández, Chryssis Georgiou:
The Do-All Problem with Byzantine Processor Failures.
117-132
- Michele Flammini, Alfredo Navarra, Andrzej Proskurowski:
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles.
133-145
- Cyril Gavoille, Martin Nehéz:
Interval Routing in Reliability Networks.
147-162
- Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
Polynomial-Time Computable Backup Tables for Shortest-Path Routing.
163-177
- Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
Instability of Networks with Quasi-Static Link Capacities.
179-194
- Dariusz R. Kowalski, Andrzej Pelc:
Time of Radio Broadcasting.
195-210
- Rastislav Kralovic, Richard Královic, Peter Ruzicka:
Broadcasting with Many Faulty Links.
211-222
- Evangelos Kranakis, Danny Krizanc, Sunil M. Shende:
Tracking Users in Cellular Networks using Timing Information.
223-234
- Flaminia L. Luccio:
Minimum Feedback Vertex Set in Pyramid and Mesh of Trees Networks.
235-247
- Ricardo Marcelín-Jiménez:
Distributed site partitioning.
249-257
- Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari:
A uniform randomized election in trees.
259-274
- Andre Osterloh:
Optimal Oblivious Routing On D-Dimensional Meshes.
275-290
- Matthieu Roy, Achour Mostéfaoui:
Single-Write Safe Consensus using Constrained Inputs.
291-306
Copyright © Wed Dec 9 20:15:47 2009
by Michael Ley (ley@uni-trier.de)