sirocco2005.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 2005</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>12. <a href="index.html">SIROCCO</a> 2005: Mont Saint-Michel, France</h1> <a name="2005" href="../../indices/a-tree/p/Pelc:Andrzej.html">Andrzej Pelc</a>, <a href="../../indices/a-tree/r/Raynal:Michel.html">Michel Raynal</a> (Eds.): Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings. <a href="../../journals/lncs.html">Lecture Notes in Computer Science</a> 3499 Springer 2005, ISBN 3-540-26052-8 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/2005">BibTeX</a></font> <ul> <li><a name="Bar-Noy05" href="../../indices/a-tree/b/Bar=Noy:Amotz.html">Amotz Bar-Noy</a>: <br><b>Cellular Networks: Where Are the Mobile Users? </b>1<br><a href="http://dx.doi.org/10.1007/11429647_1"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Bar-Noy05">BibTeX</a></font> <li><a name="Gavoille05" href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>: <br><b>Distributed Data Structures: A Survey. </b>2<br><a href="http://dx.doi.org/10.1007/11429647_2"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Gavoille05">BibTeX</a></font> <li><a name="AulettaPPP05" href="../../indices/a-tree/a/Auletta:Vincenzo.html">Vincenzo Auletta</a>, <a href="../../indices/a-tree/p/Prisco:Roberto_De.html">Roberto De Prisco</a>, <a href="../../indices/a-tree/p/Penna:Paolo.html">Paolo Penna</a>, <a href="../../indices/a-tree/p/Persiano:Giuseppe.html">Giuseppe Persiano</a>: <br><b>On Designing Truthful Mechanisms for Online Scheduling. </b>3-17<br><a href="http://dx.doi.org/10.1007/11429647_3"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/AulettaPPP05">BibTeX</a></font> <li><a name="Beimel05" href="../../indices/a-tree/b/Beimel:Amos.html">Amos Beimel</a>: <br><b>On Private Computation in Incomplete Networks. </b>18-33<br><a href="http://dx.doi.org/10.1007/11429647_4"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Beimel05">BibTeX</a></font> <li><a name="BermondBC05" href="../../indices/a-tree/b/Bermond:Jean=Claude.html">Jean-Claude Bermond</a>, <a href="../../indices/a-tree/b/Braud:Laurent.html">Laurent Braud</a>, <a href="../../indices/a-tree/c/Coudert:David.html">David Coudert</a>: <br><b>Traffic Grooming on the Path. </b>34-48<br><a href="http://dx.doi.org/10.1007/11429647_5"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BermondBC05">BibTeX</a></font> <li><a name="BiloP05" href="../../indices/a-tree/b/Bil=ograve=:Davide.html">Davide Bilò</a>, <a href="../../indices/a-tree/p/Proietti:Guido.html">Guido Proietti</a>: <br><b>Range Augmentation Problems in Static Ad-Hoc Wireless Networks. </b>49-64<br><a href="http://dx.doi.org/10.1007/11429647_6"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BiloP05">BibTeX</a></font> <li><a name="CalamoneriV05" href="../../indices/a-tree/c/Calamoneri:Tiziana.html">Tiziana Calamoneri</a>, <a href="../../indices/a-tree/v/Vocca:Paola.html">Paola Vocca</a>: <br><b>On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). </b>65-77<br><a href="http://dx.doi.org/10.1007/11429647_7"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CalamoneriV05">BibTeX</a></font> <li><a name="CaragiannisFKP05" href="../../indices/a-tree/c/Caragiannis:Ioannis.html">Ioannis Caragiannis</a>, <a href="../../indices/a-tree/f/Fishkin:Aleksei_V=.html">Aleksei V. Fishkin</a>, <a href="../../indices/a-tree/k/Kaklamanis:Christos.html">Christos Kaklamanis</a>, <a href="../../indices/a-tree/p/Papaioannou:Evi.html">Evi Papaioannou</a>: <br><b>A Tight Bound for Online Coloring of Disk Graphs. </b>78-88<br><a href="http://dx.doi.org/10.1007/11429647_8"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CaragiannisFKP05">BibTeX</a></font> <li><a name="ClementiIMLRS05" 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/m/Monti:Angelo.html">Angelo Monti</a>, <a href="../../indices/a-tree/l/Lauria:Massimo.html">Massimo Lauria</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>: <br><b>Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. </b>89-98<br><a href="http://dx.doi.org/10.1007/11429647_9"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ClementiIMLRS05">BibTeX</a></font> <li><a name="DasFNS05" href="../../indices/a-tree/d/Das:Shantanu.html">Shantanu Das</a>, <a href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a href="../../indices/a-tree/n/Nayak:Amiya.html">Amiya Nayak</a>, <a href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>: <br><b>Distributed Exploration of an Unknown Graph. </b>99-114<br><a href="http://dx.doi.org/10.1007/11429647_10"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DasFNS05">BibTeX</a></font> <li><a name="DinitzS05" href="../../indices/a-tree/d/Dinitz:Yefim.html">Yefim Dinitz</a>, <a href="../../indices/a-tree/s/Solomon:Noam.html">Noam Solomon</a>: <br><b>Two Absolute Bounds for Distributed Bit Complexity. </b>115-126<br><a href="http://dx.doi.org/10.1007/11429647_11"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DinitzS05">BibTeX</a></font> <li><a name="DobrevJSS05" href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</a>, <a href="../../indices/a-tree/j/Jansson:Jesper.html">Jesper Jansson</a>, <a href="../../indices/a-tree/s/Sadakane:Kunihiko.html">Kunihiko Sadakane</a>, <a href="../../indices/a-tree/s/Sung:Wing=Kin.html">Wing-Kin Sung</a>: <br><b>Finding Short Right-Hand-on-the-Wall Walks in Graphs. </b>127-139<br><a href="http://dx.doi.org/10.1007/11429647_12"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DobrevJSS05">BibTeX</a></font> <li><a name="FraigniaudIRT05" href="../../indices/a-tree/f/Fraigniaud:Pierre.html">Pierre Fraigniaud</a>, <a href="../../indices/a-tree/i/Ilcinkas:David.html">David Ilcinkas</a>, <a href="../../indices/a-tree/r/Rajsbaum:Sergio.html">Sergio Rajsbaum</a>, <a href="../../indices/a-tree/t/Tixeuil:S=eacute=bastien.html">Sébastien Tixeuil</a>: <br><b>Space Lower Bounds for Graph Exploration via Reduced Automata. </b>140-154<br><a href="http://dx.doi.org/10.1007/11429647_13"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FraigniaudIRT05">BibTeX</a></font> <li><a name="HinkelmannJ05" href="../../indices/a-tree/h/Hinkelmann:Markus.html">Markus Hinkelmann</a>, <a href="../../indices/a-tree/j/Jakoby:Andreas.html">Andreas Jakoby</a>: <br><b>Communications in Unknown Networks: Preserving the Secret of Topology. </b>155-169<br><a href="http://dx.doi.org/10.1007/11429647_14"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/HinkelmannJ05">BibTeX</a></font> <li><a name="IzumiM05" href="../../indices/a-tree/i/Izumi:Taisuke.html">Taisuke Izumi</a>, <a href="../../indices/a-tree/m/Masuzawa:Toshimitsu.html">Toshimitsu Masuzawa</a>: <br><b>An Improved Algorithm for Adaptive Condition-Based Consensus. </b>170-184<br><a href="http://dx.doi.org/10.1007/11429647_15"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/IzumiM05">BibTeX</a></font> <li><a name="Katreniak05" href="../../indices/a-tree/k/Katreniak:Branislav.html">Branislav Katreniak</a>: <br><b>Biangular Circle Formation by Asynchronous Mobile Robots. </b>185-199<br><a href="http://dx.doi.org/10.1007/11429647_16"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Katreniak05">BibTeX</a></font> <li><a name="KlasingMRS05" href="../../indices/a-tree/k/Klasing:Ralf.html">Ralf Klasing</a>, <a href="../../indices/a-tree/m/Markou:Euripides.html">Euripides Markou</a>, <a href="../../indices/a-tree/r/Radzik:Tomasz.html">Tomasz Radzik</a>, <a href="../../indices/a-tree/s/Sarracco:Fabiano.html">Fabiano Sarracco</a>: <br><b>Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. </b>200-215<br><a href="http://dx.doi.org/10.1007/11429647_17"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KlasingMRS05">BibTeX</a></font> <li><a name="KralovicK05" 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>: <br><b>On Semi-perfect 1-Factorizations. </b>216-230<br><a href="http://dx.doi.org/10.1007/11429647_18"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KralovicK05">BibTeX</a></font> <li><a name="PennaV05" href="../../indices/a-tree/p/Penna:Paolo.html">Paolo Penna</a>, <a href="../../indices/a-tree/v/Ventre:Carmine.html">Carmine Ventre</a>: <br><b>Free-Riders in Steiner Tree Cost-Sharing Games. </b>231-245<br><a href="http://dx.doi.org/10.1007/11429647_19"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/PennaV05">BibTeX</a></font> <li><a name="Prencipe05" href="../../indices/a-tree/p/Prencipe:Giuseppe.html">Giuseppe Prencipe</a>: <br><b>On the Feasibility of Gathering by Autonomous Mobile Robots. </b>246-261<br><a href="http://dx.doi.org/10.1007/11429647_20"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Prencipe05">BibTeX</a></font> <li><a name="SantoroW05" href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>, <a href="../../indices/a-tree/w/Widmayer:Peter.html">Peter Widmayer</a>: <br><b>Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. </b>262-276<br><a href="http://dx.doi.org/10.1007/11429647_21"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SantoroW05">BibTeX</a></font> <li><a name="ShalomZ05" href="../../indices/a-tree/s/Shalom:Mordechai.html">Mordechai Shalom</a>, <a href="../../indices/a-tree/z/Zaks:Shmuel.html">Shmuel Zaks</a>: <br><b>Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. </b>277-291<br><a href="http://dx.doi.org/10.1007/11429647_22"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ShalomZ05">BibTeX</a></font> <li><a name="WangL05" href="../../indices/a-tree/w/Wang:Rui.html">Rui Wang</a>, <a href="../../indices/a-tree/l/Lau:Francis_C=_M=.html">Francis C. M. Lau</a>: <br><b>Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets. </b>292-306<br><a href="http://dx.doi.org/10.1007/11429647_23"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/WangL05">BibTeX</a></font> <li><a name="WattenhoferWW05" href="../../indices/a-tree/w/Wattenhofer:Mirjam.html">Mirjam Wattenhofer</a>, <a href="../../indices/a-tree/w/Wattenhofer:Roger.html">Roger Wattenhofer</a>, <a href="../../indices/a-tree/w/Widmayer:Peter.html">Peter Widmayer</a>: <br><b>Geometric Routing Without Geometry. </b>307-322<br><a href="http://dx.doi.org/10.1007/11429647_24"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/WattenhoferWW05">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
