sirocco2008.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 2008</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>15. <a href="index.html">SIROCCO</a> 2008: Villars-sur-Ollon, Switzerland</h1> <a name="2008" href="../../indices/a-tree/s/Shvartsman:Alexander_A=.html">Alexander A. Shvartsman</a>, <a href="../../indices/a-tree/f/Felber:Pascal.html">Pascal Felber</a> (Eds.): Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings. <a href="../../journals/lncs.html">Lecture Notes in Computer Science</a> 5058 Springer 2008, ISBN 978-3-540-69326-0 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/2008">BibTeX</a></font> <h2>Invited Talks</h2> <ul> <li><a name="Santoro08" href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>: <br><b>Mobile Entities Computing: Models and Problems. </b>1<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_1"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Santoro08">BibTeX</a></font> <li><a name="Patt-Shamir08" href="../../indices/a-tree/p/Patt=Shamir:Boaz.html">Boaz Patt-Shamir</a>: <br><b>Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems. </b>2-4<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_2"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Patt-Shamir08">BibTeX</a></font> </ul> <h2>Regular Papers</h2> <ul> <li><a name="InuzukaTIKW08" href="../../indices/a-tree/i/Inuzuka:Nobuhiro.html">Nobuhiro Inuzuka</a>, <a href="../../indices/a-tree/t/Tomida:Yuichi.html">Yuichi Tomida</a>, <a href="../../indices/a-tree/i/Izumi:Taisuke.html">Taisuke Izumi</a>, <a href="../../indices/a-tree/k/Katayama:Yoshiaki.html">Yoshiaki Katayama</a>, <a href="../../indices/a-tree/w/Wada:Koichi.html">Koichi Wada</a>: <br><b>Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. </b>5-19<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_3"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/InuzukaTIKW08">BibTeX</a></font> <li><a name="CooperKR08" href="../../indices/a-tree/c/Cooper:Colin.html">Colin Cooper</a>, <a href="../../indices/a-tree/k/Klasing:Ralf.html">Ralf Klasing</a>, <a href="../../indices/a-tree/r/Radzik:Tomasz.html">Tomasz Radzik</a>: <br><b>Locating and Repairing Faults in a Network with Mobile Agents. </b>20-32<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_4"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CooperKR08">BibTeX</a></font> <li><a name="FlocchiniIPS08" href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a href="../../indices/a-tree/i/Ilcinkas:David.html">David Ilcinkas</a>, <a href="../../indices/a-tree/p/Pelc:Andrzej.html">Andrzej Pelc</a>, <a href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>: <br><b>Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. </b>33-47<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_5"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FlocchiniIPS08">BibTeX</a></font> <li><a name="BeckerRRR08" href="../../indices/a-tree/b/Becker:Florent.html">Florent Becker</a>, <a href="../../indices/a-tree/r/Rajsbaum:Sergio.html">Sergio Rajsbaum</a>, <a href="../../indices/a-tree/r/Rapaport:Ivan.html">Ivan Rapaport</a>, <a href="../../indices/a-tree/r/R=eacute=mila:Eric.html">Eric Rémila</a>: <br><b>Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory. </b>48-60<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_6"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BeckerRRR08">BibTeX</a></font> <li><a name="BeaumontBDL08" href="../../indices/a-tree/b/Beaumont:Olivier.html">Olivier Beaumont</a>, <a href="../../indices/a-tree/b/Bonichon:Nicolas.html">Nicolas Bonichon</a>, <a href="../../indices/a-tree/d/Duchon:Philippe.html">Philippe Duchon</a>, <a href="../../indices/a-tree/l/Larchev=ecirc=que:Hubert.html">Hubert Larchevêque</a>: <br><b>Distributed Approximation Algorithm for Resource Clustering. </b>61-73<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_7"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BeaumontBDL08">BibTeX</a></font> <li><a name="Chaintreau08" href="../../indices/a-tree/c/Chaintreau:Augustin.html">Augustin Chaintreau</a>: <br><b>Sharpness: A Tight Condition for Scalability. </b>74-88<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_8"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Chaintreau08">BibTeX</a></font> <li><a name="BiloEMW08" href="../../indices/a-tree/b/Bil=ograve=:Davide.html">Davide Bilò</a>, <a href="../../indices/a-tree/e/Erlebach:Thomas.html">Thomas Erlebach</a>, <a href="../../indices/a-tree/m/Mihal=aacute=k:Mat=uacute=s.html">Matús Mihalák</a>, <a href="../../indices/a-tree/w/Widmayer:Peter.html">Peter Widmayer</a>: <br><b>Discovery of Network Properties with All-Shortest-Paths Queries. </b>89-103<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_9"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BiloEMW08">BibTeX</a></font> <li><a name="FraigniaudLL08" href="../../indices/a-tree/f/Fraigniaud:Pierre.html">Pierre Fraigniaud</a>, <a href="../../indices/a-tree/l/Lebhar:Emmanuelle.html">Emmanuelle Lebhar</a>, <a href="../../indices/a-tree/l/Lotker:Zvi.html">Zvi Lotker</a>: <br><b>Recovering the Long-Range Links in Augmented Graphs. </b>104-118<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_10"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FraigniaudLL08">BibTeX</a></font> <li><a name="LahiriT08" href="../../indices/a-tree/l/Lahiri:Bibudh.html">Bibudh Lahiri</a>, <a href="../../indices/a-tree/t/Tirthapura:Srikanta.html">Srikanta Tirthapura</a>: <br><b>Computing Frequent Elements Using Gossip. </b>119-130<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_11"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/LahiriT08">BibTeX</a></font> <li><a name="AvniS08" href="../../indices/a-tree/a/Avni:Hillel.html">Hillel Avni</a>, <a href="../../indices/a-tree/s/Shavit:Nir.html">Nir Shavit</a>: <br><b>Maintaining Consistent Transactional States without a Global Clock. </b>131-140<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_12"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/AvniS08">BibTeX</a></font> <li><a name="AdjiashviliP08" href="../../indices/a-tree/a/Adjiashvili:David.html">David Adjiashvili</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>: <br><b>Equal-Area Locus-Based Convex Polygon Decomposition. </b>141-155<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_13"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/AdjiashviliP08">BibTeX</a></font> <li><a name="Steinova08" href="../../indices/a-tree/s/Steinov=aacute=:Monika.html">Monika Steinová</a>: <br><b>On the Power of Local Orientations. </b>156-169<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_14"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Steinova08">BibTeX</a></font> <li><a name="KesselmanKS08" href="../../indices/a-tree/k/Kesselman:Alexander.html">Alexander Kesselman</a>, <a href="../../indices/a-tree/k/Kogan:Kirill.html">Kirill Kogan</a>, <a href="../../indices/a-tree/s/Segal:Michael.html">Michael Segal</a>: <br><b>Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. </b>170-184<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_15"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KesselmanKS08">BibTeX</a></font> <li><a name="KostkaOW08" href="../../indices/a-tree/k/Kostka:Jan.html">Jan Kostka</a>, <a href="../../indices/a-tree/o/Oswald:Yvonne_Anne.html">Yvonne Anne Oswald</a>, <a href="../../indices/a-tree/w/Wattenhofer:Roger.html">Roger Wattenhofer</a>: <br><b>Word of Mouth: Rumor Dissemination in Social Networks. </b>185-196<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_16"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KostkaOW08">BibTeX</a></font> <li><a name="Kollias08" href="../../indices/a-tree/k/Kollias:Konstantinos.html">Konstantinos Kollias</a>: <br><b>Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games. </b>197-208<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_17"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Kollias08">BibTeX</a></font> <li><a name="FeldmannRV08" href="../../indices/a-tree/f/Feldmann:Andreas_Emil.html">Andreas Emil Feldmann</a>, <a href="../../indices/a-tree/r/R=ouml=glin:Heiko.html">Heiko Röglin</a>, <a href="../../indices/a-tree/v/V=ouml=cking:Berthold.html">Berthold Vöcking</a>: <br><b>Computing Approximate Nash Equilibria in Network Congestion Games. </b>209-220<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_18"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FeldmannRV08">BibTeX</a></font> <li><a name="ChernoySZ08" href="../../indices/a-tree/c/Chernoy:Viacheslav.html">Viacheslav Chernoy</a>, <a 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>On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. </b>221-233<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_19"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ChernoySZ08">BibTeX</a></font> <li><a name="SauerwaldS08" href="../../indices/a-tree/s/Sauerwald:Thomas.html">Thomas Sauerwald</a>, <a href="../../indices/a-tree/s/Sudholt:Dirk.html">Dirk Sudholt</a>: <br><b>Self-stabilizing Cuts in Synchronous Networks. </b>234-246<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_20"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SauerwaldS08">BibTeX</a></font> <li><a name="MasuzawaT08" href="../../indices/a-tree/m/Masuzawa:Toshimitsu.html">Toshimitsu Masuzawa</a>, <a href="../../indices/a-tree/t/Tixeuil:S=eacute=bastien.html">Sébastien Tixeuil</a>: <br><b>Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs. </b>247-261<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_21"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MasuzawaT08">BibTeX</a></font> <li><a name="BermondGR08" href="../../indices/a-tree/b/Bermond:Jean=Claude.html">Jean-Claude Bermond</a>, <a href="../../indices/a-tree/g/Gargano:Luisa.html">Luisa Gargano</a>, <a href="../../indices/a-tree/r/Rescigno:Adele_A=.html">Adele A. Rescigno</a>: <br><b>Gathering with Minimum Delay in Tree Sensor Networks. </b>262-276<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_22"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BermondGR08">BibTeX</a></font> <li><a name="Galcik08" href="../../indices/a-tree/g/Galc=iacute=k:Frantisek.html">Frantisek Galcík</a>: <br><b>Centralized Communication in Radio Networks with Strong Interference. </b>277-290<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_23"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Galcik08">BibTeX</a></font> <li><a name="IlcinkasKP08" href="../../indices/a-tree/i/Ilcinkas:David.html">David Ilcinkas</a>, <a 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>: <br><b>Fast Radio Broadcasting with Advice. </b>291-305<br><a href="http://dx.doi.org/10.1007/978-3-540-69355-0_24"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/IlcinkasKP08">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
