sirocco2002.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 2002</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>9. <a href="index.html">SIROCCO</a> 2002:
Andros,
Greece</h1> <a name="2002" href="../../indices/a-tree/k/Kaklamanis:Christos.html">Christos Kaklamanis</a>, <a href="../../indices/a-tree/k/Kirousis:Lefteris_M=.html">Lefteris M. Kirousis</a> (Eds.):
SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002.
Proceedings in Informatics 13 Carleton Scientific 2002 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/2002">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/sirocco/2002,
editor = {Christos Kaklamanis and
Lefteris M. Kirousis},
title = {SIROCCO 9, Proceedings of the 9th International Colloquium on
Structural Information and Communication Complexity, Andros,
Greece, June 10-12, 2002},
booktitle = {SIROCCO},
publisher = {Carleton Scientific},
series = {Proceedings in Informatics},
volume = {13},
year = {2002},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
<ul>
<li><a name="BermondCP02" href="../../indices/a-tree/b/Bermond:Jean=Claude.html">Jean-Claude Bermond</a>, <a href="../../indices/a-tree/c/Choplin:S=eacute=bastien.html">Sébastien Choplin</a>, <a href="../../indices/a-tree/p/Perennes:Stephane.html">Stephane Perennes</a>:
Hierarchical Ring Network Design.
1-16 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BermondCP02">BibTeX</a></font>
<li><a name="BerthiaumePSS02" href="../../indices/a-tree/b/Berthiaume:Andr=eacute=.html">André Berthiaume</a>, <a href="../../indices/a-tree/p/Perkovic:Ljubomir.html">Ljubomir Perkovic</a>, <a href="../../indices/a-tree/s/Settle:Amber.html">Amber Settle</a>, <a href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>:
New Bounds for the Firing Squad Problem on a Ring.
17-31 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BerthiaumePSS02">BibTeX</a></font>
<li><a name="BoseKLM02" href="../../indices/a-tree/b/Bose:Prosenjit.html">Prosenjit Bose</a>, <a href="../../indices/a-tree/k/Krizanc:Danny.html">Danny Krizanc</a>, <a href="../../indices/a-tree/l/Langerman:Stefan.html">Stefan Langerman</a>, <a href="../../indices/a-tree/m/Morin:Pat.html">Pat Morin</a>:
Asymmetric Communication Protocols via Hotlink Assignments.
33-39 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BoseKLM02">BibTeX</a></font>
<li><a name="ChlebusGK02" href="../../indices/a-tree/c/Chlebus:Bogdan_S=.html">Bogdan S. Chlebus</a>, <a href="../../indices/a-tree/g/Golab:Karol.html">Karol Golab</a>, <a href="../../indices/a-tree/k/Kowalski:Dariusz_R=.html">Dariusz R. Kowalski</a>:
Finding Spanning Forests by Broadcasting.
41-56 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ChlebusGK02">BibTeX</a></font>
<li><a name="CieliebakP02" href="../../indices/a-tree/c/Cieliebak:Mark.html">Mark Cieliebak</a>, <a href="../../indices/a-tree/p/Prencipe:Giuseppe.html">Giuseppe Prencipe</a>:
Gathering Autonomous Mobile Robots.
57-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CieliebakP02">BibTeX</a></font>
<li><a name="ComellasMP02" href="../../indices/a-tree/c/Comellas:Francesc.html">Francesc Comellas</a>, <a href="../../indices/a-tree/m/Mitjana:Margarida.html">Margarida Mitjana</a>, <a href="../../indices/a-tree/p/Peters:Joseph_G=.html">Joseph G. Peters</a>:
Broadcasting in Small-world Communication Networks.
73-85 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ComellasMP02">BibTeX</a></font>
<li><a name="Delporte-GalletF02" href="../../indices/a-tree/d/Delporte=Gallet:Carole.html">Carole Delporte-Gallet</a>, <a href="../../indices/a-tree/f/Fauconnier:Hugues.html">Hugues Fauconnier</a>:
Latency Measures and Lower Bounds for Consensus with Failure Detectors.
87-100 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Delporte-GalletF02">BibTeX</a></font>
<li><a name="Dobrev02" href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</a>:
Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults.
101-113 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Dobrev02">BibTeX</a></font>
<li><a name="GiesenWZ02" href="../../indices/a-tree/g/Giesen:Joachim.html">Joachim Giesen</a>, <a href="../../indices/a-tree/w/Wattenhofer:Roger.html">Roger Wattenhofer</a>, <a href="../../indices/a-tree/z/Zollinger:Aaron.html">Aaron Zollinger</a>:
Towards a Theory of Peer-to-Peer Computability.
115-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GiesenWZ02">BibTeX</a></font>
<li><a name="GlinosHNS02" href="../../indices/a-tree/g/Glinos:Nikolaos.html">Nikolaos Glinos</a>, <a href="../../indices/a-tree/h/Hoang:Doan_B=.html">Doan B. Hoang</a>, <a href="../../indices/a-tree/n/Nguyen:Chi.html">Chi Nguyen</a>, <a href="../../indices/a-tree/s/Symvonis:Antonios.html">Antonios Symvonis</a>:
Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol.
133-148 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GlinosHNS02">BibTeX</a></font>
<li><a name="GodardM02" href="../../indices/a-tree/g/Godard:Emmanuel.html">Emmanuel Godard</a>, <a href="../../indices/a-tree/m/M=eacute=tivier:Yves.html">Yves Métivier</a>:
Equivalence of Structural Knowledges in Distributed Algorithms.
149-164 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GodardM02">BibTeX</a></font>
<li><a name="Havet02" href="../../indices/a-tree/h/Havet:Fr=eacute=d=eacute=ric.html">Frédéric Havet</a>:
Design of Fault Tolerant Satellite Networks with Priorities via Selectors.
165-179 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Havet02">BibTeX</a></font>
<li><a name="HouleSW02" href="../../indices/a-tree/h/Houle:Michael_E=.html">Michael E. Houle</a>, <a href="../../indices/a-tree/s/Symvonis:Antonios.html">Antonios Symvonis</a>, <a href="../../indices/a-tree/w/Wood:David_R=.html">David R. Wood</a>:
Dimension-Exchange Algorithms for Load Balancing on Trees.
181-196 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/HouleSW02">BibTeX</a></font>
<li><a name="ItoIOY02" 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>:
Avoiding Routing Loops on the Internet.
197-210 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ItoIOY02">BibTeX</a></font>
<li><a name="JarryP02" href="../../indices/a-tree/j/Jarry:Aubin.html">Aubin Jarry</a>, <a href="../../indices/a-tree/p/Perennes:Stephane.html">Stephane Perennes</a>:
Disjoint Paths in Symmetric Digraphs.
211-222 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/JarryP02">BibTeX</a></font>
<li><a name="KoutsoupiasMS02" href="../../indices/a-tree/k/Koutsoupias:Elias.html">Elias Koutsoupias</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>:
Approximate Equilibria and Ball Fusion.
223-235 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KoutsoupiasMS02">BibTeX</a></font>
<li><a name="KralovicR02" href="../../indices/a-tree/k/Kralovic:Rastislav.html">Rastislav Kralovic</a>, <a href="../../indices/a-tree/r/Ruzicka:Peter.html">Peter Ruzicka</a>:
Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks.
237-245 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KralovicR02">BibTeX</a></font>
<li><a name="LuccioP02" href="../../indices/a-tree/l/Luccio:Fabrizio.html">Fabrizio Luccio</a>, <a href="../../indices/a-tree/p/Pagli:Linda.html">Linda Pagli</a>:
Two New Applications of Dynamos.
247-258 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/LuccioP02">BibTeX</a></font>
<li><a name="SchludeSW02" href="../../indices/a-tree/s/Schlude:Konrad.html">Konrad Schlude</a>, <a href="../../indices/a-tree/s/Soisalon=Soininen:Eljas.html">Eljas Soisalon-Soininen</a>, <a href="../../indices/a-tree/w/Widmayer:Peter.html">Peter Widmayer</a>:
Distributed Highly Available Search Trees.
259-274 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SchludeSW02">BibTeX</a></font>
<li><a name="TrompV02" href="../../indices/a-tree/t/Tromp:John.html">John Tromp</a>, <a href="../../indices/a-tree/v/Vit=aacute=nyi:Paul_M=_B=.html">Paul M. B. Vitányi</a>:
A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification.
275-291 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/TrompV02">BibTeX</a></font>
<li><a name="TseL02" href="../../indices/a-tree/t/Tse:Savio_S=_H=.html">Savio S. H. Tse</a>, <a href="../../indices/a-tree/l/Lau:Francis_C=_M=.html">Francis C. M. Lau</a>:
An Upper Bound Result for Multi-label Interval Routing on Planar Graphs.
293-308 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/TseL02">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
