sirocco2006.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 2006</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>13. <a href="index.html">SIROCCO</a> 2006: Chester, UK</h1> <a name="2006" href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a href="../../indices/a-tree/g/Gasieniec:Leszek.html">Leszek Gasieniec</a> (Eds.): Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings. <a href="../../journals/lncs.html">Lecture Notes in Computer Science</a> 4056 Springer 2006, ISBN 3-540-35474-3 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/2006">BibTeX</a></font> <ul> <li><a name="KranakisKR06" 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/r/Rajsbaum:Sergio.html">Sergio Rajsbaum</a>: <br><b>Mobile Agent Rendezvous: A Survey. </b>1-9<br><a href="http://dx.doi.org/10.1007/11780823_1"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KranakisKR06">BibTeX</a></font> <li><a name="Attiya06" href="../../indices/a-tree/a/Attiya:Hagit.html">Hagit Attiya</a>: <br><b>Adapting to Point Contention with Long-Lived Safe Agreement . </b>10-23<br><a href="http://dx.doi.org/10.1007/11780823_2"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Attiya06">BibTeX</a></font> <li><a name="Wattenhofer06" href="../../indices/a-tree/w/Wattenhofer:Roger.html">Roger Wattenhofer</a>: <br><b>Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?. </b>24-28<br><a href="http://dx.doi.org/10.1007/11780823_3"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Wattenhofer06">BibTeX</a></font> <li><a name="CohenP06" href="../../indices/a-tree/c/Cohen:Reuven.html">Reuven Cohen</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>: <br><b>Local Algorithms for Autonomous Robot Systems. </b>29-43<br><a href="http://dx.doi.org/10.1007/11780823_4"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CohenP06">BibTeX</a></font> <li><a name="KowalskiM06" href="../../indices/a-tree/k/Kowalski:Dariusz_R=.html">Dariusz R. Kowalski</a>, <a href="../../indices/a-tree/m/Malinowski:Adam.html">Adam Malinowski</a>: <br><b>How to Meet in Anonymous Network. </b>44-58<br><a href="http://dx.doi.org/10.1007/11780823_5"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KowalskiM06">BibTeX</a></font> <li><a name="Ilcinkas06" href="../../indices/a-tree/i/Ilcinkas:David.html">David Ilcinkas</a>: <br><b>Setting Port Numbers for Fast Graph Exploration. </b>59-69<br><a href="http://dx.doi.org/10.1007/11780823_6"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Ilcinkas06">BibTeX</a></font> <li><a name="BlinFNV06" href="../../indices/a-tree/b/Blin:L=eacute=lia.html">Lélia Blin</a>, <a href="../../indices/a-tree/f/Fraigniaud:Pierre.html">Pierre Fraigniaud</a>, <a href="../../indices/a-tree/n/Nisse:Nicolas.html">Nicolas Nisse</a>, <a href="../../indices/a-tree/v/Vial:Sandrine.html">Sandrine Vial</a>: <br><b>Distributed Chasing of Network Intruders. </b>70-84<br><a href="http://dx.doi.org/10.1007/11780823_7"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BlinFNV06">BibTeX</a></font> <li><a name="Chalopin06" href="../../indices/a-tree/c/Chalopin:J=eacute=r=eacute=mie.html">Jérémie Chalopin</a>: <br><b>Election in the Qualitative World. </b>85-99<br><a href="http://dx.doi.org/10.1007/11780823_8"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Chalopin06">BibTeX</a></font> <li><a name="DerbelG06" href="../../indices/a-tree/d/Derbel:Bilel.html">Bilel Derbel</a>, <a href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>: <br><b>Fast Deterministic Distributed Algorithms for Sparse Spanners. </b>100-114<br><a href="http://dx.doi.org/10.1007/11780823_9"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DerbelG06">BibTeX</a></font> <li><a name="HoepmanKL06" href="../../indices/a-tree/h/Hoepman:Jaap=Henk.html">Jaap-Henk Hoepman</a>, <a href="../../indices/a-tree/k/Kutten:Shay.html">Shay Kutten</a>, <a href="../../indices/a-tree/l/Lotker:Zvi.html">Zvi Lotker</a>: <br><b>Efficient Distributed Weighted Matchings on Trees. </b>115-129<br><a href="http://dx.doi.org/10.1007/11780823_10"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/HoepmanKL06">BibTeX</a></font> <li><a name="Kosowski06" href="../../indices/a-tree/k/Kosowski:Adrian.html">Adrian Kosowski</a>: <br><b>Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. </b>130-142<br><a href="http://dx.doi.org/10.1007/11780823_11"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Kosowski06">BibTeX</a></font> <li><a name="BonichonGL06" href="../../indices/a-tree/b/Bonichon:Nicolas.html">Nicolas Bonichon</a>, <a href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>, <a href="../../indices/a-tree/l/Labourel:Arnaud.html">Arnaud Labourel</a>: <br><b>Short Labels by Traversal and Jumping. </b>143-156<br><a href="http://dx.doi.org/10.1007/11780823_12"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BonichonGL06">BibTeX</a></font> <li><a name="ThibaultL06" href="../../indices/a-tree/t/Thibault:Nicolas.html">Nicolas Thibault</a>, <a href="../../indices/a-tree/l/Laforest:Christian.html">Christian Laforest</a>: <br><b>An Optimal Rebuilding Strategy for a Decremental Tree Problem. </b>157-170<br><a href="http://dx.doi.org/10.1007/11780823_13"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ThibaultL06">BibTeX</a></font> <li><a name="Bar-NoyLT06" href="../../indices/a-tree/b/Bar=Noy:Amotz.html">Amotz Bar-Noy</a>, <a href="../../indices/a-tree/l/Ladner:Richard_E=.html">Richard E. Ladner</a>, <a href="../../indices/a-tree/t/Tamir:Tami.html">Tami Tamir</a>: <br><b>Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. </b>171-181<br><a href="http://dx.doi.org/10.1007/11780823_14"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Bar-NoyLT06">BibTeX</a></font> <li><a name="ParvedyRT06" href="../../indices/a-tree/p/Parv=eacute=dy:Philippe_Raipin.html">Philippe Raipin Parvédy</a>, <a href="../../indices/a-tree/r/Raynal:Michel.html">Michel Raynal</a>, <a href="../../indices/a-tree/t/Travers:Corentin.html">Corentin Travers</a>: <br><b>Strongly Terminating Early-Stopping <i>k</i>-Set Agreement in Synchronous Systems with General Omission Failures. </b>182-196<br><a href="http://dx.doi.org/10.1007/11780823_15"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ParvedyRT06">BibTeX</a></font> <li><a name="DobrevKKS06" href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</a>, <a 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/s/Santoro:Nicola.html">Nicola Santoro</a>: <br><b>On Fractional Dynamic Faults with Threshold. </b>197-211<br><a href="http://dx.doi.org/10.1007/11780823_16"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DobrevKKS06">BibTeX</a></font> <li><a name="NesterenkoT06" href="../../indices/a-tree/n/Nesterenko:Mikhail.html">Mikhail Nesterenko</a>, <a href="../../indices/a-tree/t/Tixeuil:S=eacute=bastien.html">Sébastien Tixeuil</a>: <br><b>Discovering Network Topology in the Presence of Byzantine Faults. </b>212-226<br><a href="http://dx.doi.org/10.1007/11780823_17"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/NesterenkoT06">BibTeX</a></font> <li><a name="CalamoneriCILMS06" href="../../indices/a-tree/c/Calamoneri:Tiziana.html">Tiziana Calamoneri</a>, <a href="../../indices/a-tree/c/Clementi:Andrea_E=_F=.html">Andrea E. F. Clementi</a>, <a href="../../indices/a-tree/i/Ianni:Miriam_Di.html">Miriam Di Ianni</a>, <a href="../../indices/a-tree/l/Lauria:Massimo.html">Massimo Lauria</a>, <a href="../../indices/a-tree/m/Monti:Angelo.html">Angelo Monti</a>, <a href="../../indices/a-tree/s/Silvestri:Riccardo.html">Riccardo Silvestri</a>: <br><b>Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. </b>227-239<br><a href="http://dx.doi.org/10.1007/11780823_18"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CalamoneriCILMS06">BibTeX</a></font> <li><a name="Navarra06" href="../../indices/a-tree/n/Navarra:Alfredo.html">Alfredo Navarra</a>: <br><b>3-D Minimum Energy Broadcasting. </b>240-252<br><a href="http://dx.doi.org/10.1007/11780823_19"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Navarra06">BibTeX</a></font> <li><a name="ChlebusKR06" href="../../indices/a-tree/c/Chlebus:Bogdan_S=.html">Bogdan S. Chlebus</a>, <a href="../../indices/a-tree/k/Kowalski:Dariusz_R=.html">Dariusz R. Kowalski</a>, <a href="../../indices/a-tree/r/Rokicki:Mariusz_A=.html">Mariusz A. Rokicki</a>: <br><b>Average-Time Complexity of Gossiping in Radio Networks. </b>253-267<br><a href="http://dx.doi.org/10.1007/11780823_20"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ChlebusKR06">BibTeX</a></font> <li><a name="CalamoneriFTV06" href="../../indices/a-tree/c/Calamoneri:Tiziana.html">Tiziana Calamoneri</a>, <a href="../../indices/a-tree/f/Fusco:Emanuele_G=.html">Emanuele G. Fusco</a>, <a href="../../indices/a-tree/t/Tan:Richard_B=.html">Richard B. Tan</a>, <a href="../../indices/a-tree/v/Vocca:Paola.html">Paola Vocca</a>: <br><b>L(h, 1, 1)-Labeling of Outerplanar Graphs. </b>268-279<br><a href="http://dx.doi.org/10.1007/11780823_21"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CalamoneriFTV06">BibTeX</a></font> <li><a name="CormodeM06" href="../../indices/a-tree/c/Cormode:Graham.html">Graham Cormode</a>, <a href="../../indices/a-tree/m/Muthukrishnan:S=.html">S. Muthukrishnan</a>: <br><b>Combinatorial Algorithms for Compressed Sensing. </b>280-294<br><a href="http://dx.doi.org/10.1007/11780823_22"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CormodeM06">BibTeX</a></font> <li><a name="BiloGP06" href="../../indices/a-tree/b/Bil=ograve=:Davide.html">Davide Bilò</a>, <a href="../../indices/a-tree/g/Gual=agrave=:Luciano.html">Luciano Gualà</a>, <a href="../../indices/a-tree/p/Proietti:Guido.html">Guido Proietti</a>: <br><b>On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. </b>295-309<br><a href="http://dx.doi.org/10.1007/11780823_23"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BiloGP06">BibTeX</a></font> <li><a name="Gagie06" href="../../indices/a-tree/g/Gagie:Travis.html">Travis Gagie</a>: <br><b>Dynamic Asymmetric Communication. </b>310-318<br><a href="http://dx.doi.org/10.1007/11780823_24"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Gagie06">BibTeX</a></font> <li><a name="Patt-ShamirS06" href="../../indices/a-tree/p/Patt=Shamir:Boaz.html">Boaz Patt-Shamir</a>, <a href="../../indices/a-tree/s/Shafrir:Allon.html">Allon Shafrir</a>: <br><b>Approximate Top-k Queries in Sensor Networks. </b>319-333<br><a href="http://dx.doi.org/10.1007/11780823_25"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Patt-ShamirS06">BibTeX</a></font> <li><a name="BeinDL06" href="../../indices/a-tree/b/Bein:Doina.html">Doina Bein</a>, <a href="../../indices/a-tree/d/Datta:Ajoy_Kumar.html">Ajoy Kumar Datta</a>, <a href="../../indices/a-tree/l/Larmore:Lawrence_L=.html">Lawrence L. Larmore</a>: <br><b>Self-stabilizing Space Optimal Synchronization Algorithms on Trees. </b>334-348<br><a href="http://dx.doi.org/10.1007/11780823_26"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BeinDL06">BibTeX</a></font> <li><a name="GoddardHJT06" href="../../indices/a-tree/g/Goddard:Wayne.html">Wayne Goddard</a>, <a href="../../indices/a-tree/h/Hedetniemi:Stephen_T=.html">Stephen T. Hedetniemi</a>, <a href="../../indices/a-tree/j/Jacobs:David_Pokrass.html">David Pokrass Jacobs</a>, <a href="../../indices/a-tree/t/Trevisan:Vilmar.html">Vilmar Trevisan</a>: <br><b>Distance-<i>k</i> Information in Self-stabilizing Algorithms. </b>349-356<br><a href="http://dx.doi.org/10.1007/11780823_27"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GoddardHJT06">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:31 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
