sirocco2003.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>Colloquium on Structural Information & Communication Complexity 2003</title><link href="../../../dblp.css" rel="stylesheet" type="text/css" /></head><body>
<table width="100%"><tr><td align="left"><a href="../../index.html"><img alt="dblp.uni-trier.de" src="../../Logo.gif" border=0 height=60 width=170></a></td>
<td align="right"><a href="http://www.uni-trier.de"><img alt="www.uni-trier.de" src="../../logo_universitaet-trier.gif" border=0 height=48 width=215></a></td></tr></table>
<h1>10. <a href="index.html">SIROCCO</a> 2003:
Umeå,
Sweden</h1> <a name="2003" href="../../indices/a-tree/s/Sibeyn:Jop_F=.html">Jop F. Sibeyn</a> (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 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/2003">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>: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}
}
</pre>
<ul>
<li><a name="AmbuhlCPRS03" href="../../indices/a-tree/a/Amb=uuml=hl:Christoph.html">Christoph Ambühl</a>, <a href="../../indices/a-tree/c/Clementi:Andrea_E=_F=.html">Andrea E. F. Clementi</a>, <a href="../../indices/a-tree/p/Penna:Paolo.html">Paolo Penna</a>, <a href="../../indices/a-tree/r/Rossi:Gianluca.html">Gianluca Rossi</a>, <a href="../../indices/a-tree/s/Silvestri:Riccardo.html">Riccardo Silvestri</a>:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
1-16 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/AmbuhlCPRS03">BibTeX</a></font>
<li><a name="BarriereFFS03" href="../../indices/a-tree/b/Barri=egrave=re:Lali.html">Lali Barrière</a>, <a href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a href="../../indices/a-tree/f/Fraigniaud:Pierre.html">Pierre Fraigniaud</a>, <a href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>:
Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.
17-32 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BarriereFFS03">BibTeX</a></font>
<li><a name="BoseKMT03" href="../../indices/a-tree/b/Bose:Prosenjit.html">Prosenjit Bose</a>, <a href="../../indices/a-tree/k/Kranakis:Evangelos.html">Evangelos Kranakis</a>, <a href="../../indices/a-tree/m/Morin:Pat.html">Pat Morin</a>, <a href="../../indices/a-tree/t/Tang:Yihui.html">Yihui Tang</a>:
Bounds for Frequency Estimation of Packet Streams.
33-42 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BoseKMT03">BibTeX</a></font>
<li><a name="BouklitCLPR03" href="../../indices/a-tree/b/Bouklit:Mohamed.html">Mohamed Bouklit</a>, <a href="../../indices/a-tree/c/Coudert:David.html">David Coudert</a>, <a href="../../indices/a-tree/l/Lalande:Jean=Fran=ccedil=ois.html">Jean-François Lalande</a>, <a href="../../indices/a-tree/p/Paul:Christophe.html">Christophe Paul</a>, <a href="../../indices/a-tree/r/Rivano:Herv=eacute=.html">Hervé Rivano</a>:
Approximate Multicommodity Flow for WDM Networks Design.
43-56 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BouklitCLPR03">BibTeX</a></font>
<li><a name="BuschMS03" href="../../indices/a-tree/b/Busch:Costas.html">Costas Busch</a>, <a href="../../indices/a-tree/m/Mavronicolas:Marios.html">Marios Mavronicolas</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>:
The Cost of Concurrent, Low-Contention Read-Modify-Write.
57-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BuschMS03">BibTeX</a></font>
<li><a name="ComellasFR03" href="../../indices/a-tree/c/Comellas:Francesc.html">Francesc Comellas</a>, <a href="../../indices/a-tree/f/Fertin:Guillaume.html">Guillaume Fertin</a>, <a href="../../indices/a-tree/r/Raspaud:Andr=eacute=.html">André Raspaud</a>:
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs.
73-87 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ComellasFR03">BibTeX</a></font>
<li><a name="ComellasM03" href="../../indices/a-tree/c/Comellas:Francesc.html">Francesc Comellas</a>, <a href="../../indices/a-tree/m/Mitjana:Margarida.html">Margarida Mitjana</a>:
Communication Properties of Cycle Prefix Digraphs.
89-99 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ComellasM03">BibTeX</a></font>
<li><a name="DestreLV03" href="../../indices/a-tree/d/Destr=eacute=:Christian.html">Christian Destré</a>, <a href="../../indices/a-tree/l/Laforest:Christian.html">Christian Laforest</a>, <a href="../../indices/a-tree/v/Vial:Sandrine.html">Sandrine Vial</a>:
The Broadcast Assignment Problem.
101-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DestreLV03">BibTeX</a></font>
<li><a name="FernandezG03" href="../../indices/a-tree/f/Fern=aacute=ndez:Antonio.html">Antonio Fernández</a>, <a href="../../indices/a-tree/g/Georgiou:Chryssis.html">Chryssis Georgiou</a>:
The Do-All Problem with Byzantine Processor Failures.
117-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FernandezG03">BibTeX</a></font>
<li><a name="FlamminiNP03" href="../../indices/a-tree/f/Flammini:Michele.html">Michele Flammini</a>, <a href="../../indices/a-tree/n/Navarra:Alfredo.html">Alfredo Navarra</a>, <a href="../../indices/a-tree/p/Proskurowski:Andrzej.html">Andrzej Proskurowski</a>:
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles.
133-145 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FlamminiNP03">BibTeX</a></font>
<li><a name="GavoilleN03" href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>, <a href="../../indices/a-tree/n/Neh=eacute=z:Martin.html">Martin Nehéz</a>:
Interval Routing in Reliability Networks.
147-162 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GavoilleN03">BibTeX</a></font>
<li><a name="ItoIOY03" href="../../indices/a-tree/i/Ito:Hiro.html">Hiro Ito</a>, <a href="../../indices/a-tree/i/Iwama:Kazuo.html">Kazuo Iwama</a>, <a href="../../indices/a-tree/o/Okabe:Yasuo.html">Yasuo Okabe</a>, <a href="../../indices/a-tree/y/Yoshihiro:Takuya.html">Takuya Yoshihiro</a>:
Polynomial-Time Computable Backup Tables for Shortest-Path Routing.
163-177 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ItoIOY03">BibTeX</a></font>
<li><a name="KoukopoulosMS03" href="../../indices/a-tree/k/Koukopoulos:Dimitrios.html">Dimitrios Koukopoulos</a>, <a href="../../indices/a-tree/m/Mavronicolas:Marios.html">Marios Mavronicolas</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>:
Instability of Networks with Quasi-Static Link Capacities.
179-194 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KoukopoulosMS03">BibTeX</a></font>
<li><a name="KowalskiP03" href="../../indices/a-tree/k/Kowalski:Dariusz_R=.html">Dariusz R. Kowalski</a>, <a href="../../indices/a-tree/p/Pelc:Andrzej.html">Andrzej Pelc</a>:
Time of Radio Broadcasting.
195-210 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KowalskiP03">BibTeX</a></font>
<li><a name="KralovicKR03" href="../../indices/a-tree/k/Kralovic:Rastislav.html">Rastislav Kralovic</a>, <a href="../../indices/a-tree/k/Kr=aacute=lovic:Richard.html">Richard Královic</a>, <a href="../../indices/a-tree/r/Ruzicka:Peter.html">Peter Ruzicka</a>:
Broadcasting with Many Faulty Links.
211-222 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KralovicKR03">BibTeX</a></font>
<li><a name="KranakisKS03" href="../../indices/a-tree/k/Kranakis:Evangelos.html">Evangelos Kranakis</a>, <a href="../../indices/a-tree/k/Krizanc:Danny.html">Danny Krizanc</a>, <a href="../../indices/a-tree/s/Shende:Sunil_M=.html">Sunil M. Shende</a>:
Tracking Users in Cellular Networks using Timing Information.
223-234 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KranakisKS03">BibTeX</a></font>
<li><a name="Luccio03" href="../../indices/a-tree/l/Luccio:Flaminia_L=.html">Flaminia L. Luccio</a>:
Minimum Feedback Vertex Set in Pyramid and Mesh of Trees Networks.
235-247 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Luccio03">BibTeX</a></font>
<li><a name="Marcelin-Jimenez03" href="../../indices/a-tree/m/Marcel=iacute=n=Jim=eacute=nez:Ricardo.html">Ricardo Marcelín-Jiménez</a>:
Distributed site partitioning.
249-257 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Marcelin-Jimenez03">BibTeX</a></font>
<li><a name="MetivierSZ03" href="../../indices/a-tree/m/M=eacute=tivier:Yves.html">Yves Métivier</a>, <a href="../../indices/a-tree/s/Saheb=Djahromi:Nasser.html">Nasser Saheb-Djahromi</a>, <a href="../../indices/a-tree/z/Zemmari:Akka.html">Akka Zemmari</a>:
A uniform randomized election in trees.
259-274 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MetivierSZ03">BibTeX</a></font>
<li><a name="Osterloh03" href="../../indices/a-tree/o/Osterloh:Andre.html">Andre Osterloh</a>:
Optimal Oblivious Routing On D-Dimensional Meshes.
275-290 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Osterloh03">BibTeX</a></font>
<li><a name="RoyM03" href="../../indices/a-tree/r/Roy:Matthieu.html">Matthieu Roy</a>, <a href="../../indices/a-tree/m/Most=eacute=faoui:Achour.html">Achour Mostéfaoui</a>:
Single-Write Safe Consensus using Constrained Inputs.
291-306 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/RoyM03">BibTeX</a></font>
</ul><p><div class="footer">
<a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div>
<small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:41:30 2009
by <a href="http://www.informatik.uni-trier.de/~ley/addr.html">Michael Ley</a> (<a href="mailto:ley@uni-trier.de">ley@uni-trier.de</a>)</small></p></body></html>
SIGMOD News
