sirocco2007.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 2007</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>14. <a href="index.html">SIROCCO</a> 2007: Castiglioncello, Italy</h1> <a name="2007" href="../../indices/a-tree/p/Prencipe:Giuseppe.html">Giuseppe Prencipe</a>, <a href="../../indices/a-tree/z/Zaks:Shmuel.html">Shmuel Zaks</a> (Eds.): Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings. <a href="../../journals/lncs.html">Lecture Notes in Computer Science</a> 4474 Springer 2007, ISBN 978-3-540-72918-1 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/2007">BibTeX</a></font> <h2>Invited Talks</h2> <ul> <li><a name="Panconesi07" href="../../indices/a-tree/p/Panconesi:Alessandro.html">Alessandro Panconesi</a>: <br><b>Fast Distributed Algorithms Via Primal-Dual (Extended Abstract). </b>1-6<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_1"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Panconesi07">BibTeX</a></font> <li><a name="Gargano07" href="../../indices/a-tree/g/Gargano:Luisa.html">Luisa Gargano</a>: <br><b>Time Optimal Gathering in Sensor Networks. </b>7-10<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_2"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Gargano07">BibTeX</a></font> <li><a name="Bodlaender07" href="../../indices/a-tree/b/Bodlaender:Hans_L=.html">Hans L. Bodlaender</a>: <br><b>Treewidth: Structure and Algorithms. </b>11-25<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_3"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Bodlaender07">BibTeX</a></font> </ul> <h2>Autonomous Systems: Graph Exploration</h2> <ul> <li><a name="GasieniecKMNZ07" href="../../indices/a-tree/g/Gasieniec:Leszek.html">Leszek Gasieniec</a>, <a href="../../indices/a-tree/k/Klasing:Ralf.html">Ralf Klasing</a>, <a href="../../indices/a-tree/m/Martin:Russell_A=.html">Russell A. Martin</a>, <a href="../../indices/a-tree/n/Navarra:Alfredo.html">Alfredo Navarra</a>, <a href="../../indices/a-tree/z/Zhang:Xiaohui.html">Xiaohui Zhang</a>: <br><b>Fast Periodic Graph Exploration with Constant Memory. </b>26-40<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_4"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GasieniecKMNZ07">BibTeX</a></font> <li><a name="DyniaLS07" href="../../indices/a-tree/d/Dynia:Miroslaw.html">Miroslaw Dynia</a>, <a href="../../indices/a-tree/l/Lopuszanski:Jakub.html">Jakub Lopuszanski</a>, <a href="../../indices/a-tree/s/Schindelhauer:Christian.html">Christian Schindelhauer</a>: <br><b>Why Robots Need Maps. </b>41-50<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_5"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DyniaLS07">BibTeX</a></font> <li><a name="NisseS07" href="../../indices/a-tree/n/Nisse:Nicolas.html">Nicolas Nisse</a>, <a href="../../indices/a-tree/s/Soguet:David.html">David Soguet</a>: <br><b>Graph Searching with Advice. </b>51-65<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_6"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/NisseS07">BibTeX</a></font> </ul> <h2>Distributed Algorithms: Fault Tolerance</h2> <ul> <li><a name="MostefaouiRT07" href="../../indices/a-tree/m/Most=eacute=faoui:Achour.html">Achour Mostéfaoui</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>From Renaming to Set Agreement. </b>66-80<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_7"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MostefaouiRT07">BibTeX</a></font> <li><a name="ChepoiFGV07" href="../../indices/a-tree/c/Chepoi:Victor.html">Victor Chepoi</a>, <a href="../../indices/a-tree/f/Fevat:Tristan.html">Tristan Fevat</a>, <a href="../../indices/a-tree/g/Godard:Emmanuel.html">Emmanuel Godard</a>, <a href="../../indices/a-tree/v/Vax=egrave=s:Yann.html">Yann Vaxès</a>: <br><b>A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. </b>81-95<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_8"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ChepoiFGV07">BibTeX</a></font> <li><a name="ManneMPT07" href="../../indices/a-tree/m/Manne:Fredrik.html">Fredrik Manne</a>, <a href="../../indices/a-tree/m/Mjelde:Morten.html">Morten Mjelde</a>, <a href="../../indices/a-tree/p/Pilard:Laurence.html">Laurence Pilard</a>, <a href="../../indices/a-tree/t/Tixeuil:S=eacute=bastien.html">Sébastien Tixeuil</a>: <br><b>A New Self-stabilizing Maximal Matching Algorithm. </b>96-108<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_9"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ManneMPT07">BibTeX</a></font> </ul> <h2>Distributed Algorithms and Data Structures</h2> <ul> <li><a name="KormanK07" href="../../indices/a-tree/k/Korman:Amos.html">Amos Korman</a>, <a href="../../indices/a-tree/k/Kutten:Shay.html">Shay Kutten</a>: <br><b>Labeling Schemes with Queries. </b>109-123<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_10"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KormanK07">BibTeX</a></font> <li><a name="HerlihyLLS07" href="../../indices/a-tree/h/Herlihy:Maurice.html">Maurice Herlihy</a>, <a href="../../indices/a-tree/l/Lev:Yossi.html">Yossi Lev</a>, <a href="../../indices/a-tree/l/Luchangco:Victor.html">Victor Luchangco</a>, <a href="../../indices/a-tree/s/Shavit:Nir.html">Nir Shavit</a>: <br><b>A Simple Optimistic Skiplist Algorithm. </b>124-138<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_11"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/HerlihyLLS07">BibTeX</a></font> <li><a name="KortewegMSV07" href="../../indices/a-tree/k/Korteweg:Peter.html">Peter Korteweg</a>, <a href="../../indices/a-tree/m/Marchetti=Spaccamela:Alberto.html">Alberto Marchetti-Spaccamela</a>, <a href="../../indices/a-tree/s/Stougie:Leen.html">Leen Stougie</a>, <a href="../../indices/a-tree/v/Vitaletti:Andrea.html">Andrea Vitaletti</a>: <br><b>Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. </b>139-150<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_12"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KortewegMSV07">BibTeX</a></font> </ul> <h2>Autonomous Systems: Location Problems</h2> <ul> <li><a name="SuzukiIOKM07" href="../../indices/a-tree/s/Suzuki:Tomoko.html">Tomoko Suzuki</a>, <a href="../../indices/a-tree/i/Izumi:Taisuke.html">Taisuke Izumi</a>, <a href="../../indices/a-tree/o/Ooshita:Fukuhito.html">Fukuhito Ooshita</a>, <a href="../../indices/a-tree/k/Kakugawa:Hirotsugu.html">Hirotsugu Kakugawa</a>, <a href="../../indices/a-tree/m/Masuzawa:Toshimitsu.html">Toshimitsu Masuzawa</a>: <br><b>Optimal Moves for Gossiping Among Mobile Agents. </b>151-165<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_13"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SuzukiIOKM07">BibTeX</a></font> <li><a name="DieudonneP07" href="../../indices/a-tree/d/Dieudonn=eacute=:Yoann.html">Yoann Dieudonné</a>, <a href="../../indices/a-tree/p/Petit:Franck.html">Franck Petit</a>: <br><b>Swing Words to Make Circle Formation Quiescent. </b>166-179<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_14"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DieudonneP07">BibTeX</a></font> <li><a name="EfrimaP07" href="../../indices/a-tree/e/Efrima:Asaf.html">Asaf Efrima</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>: <br><b>Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots. </b>180-194<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_15"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/EfrimaP07">BibTeX</a></font> </ul> <h2>Wireless Networks</h2> <ul> <li><a name="CzyzowiczDKOU07" href="../../indices/a-tree/c/Czyzowicz:Jurek.html">Jurek Czyzowicz</a>, <a href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</a>, <a href="../../indices/a-tree/k/Kranakis:Evangelos.html">Evangelos Kranakis</a>, <a href="../../indices/a-tree/o/Opatrny:Jaroslav.html">Jaroslav Opatrny</a>, <a href="../../indices/a-tree/u/Urrutia:Jorge.html">Jorge Urrutia</a>: <br><b>Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. </b>195-207<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_16"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CzyzowiczDKOU07">BibTeX</a></font> <li><a name="CalamoneriFSS07" 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/s/Shende:Anil_M=.html">Anil M. Shende</a>, <a href="../../indices/a-tree/s/Shende:Sunil_M=.html">Sunil M. Shende</a>: <br><b>Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers. </b>208-221<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_17"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CalamoneriFSS07">BibTeX</a></font> <li><a name="CoutureBBCK07" href="../../indices/a-tree/c/Couture:Mathieu.html">Mathieu Couture</a>, <a href="../../indices/a-tree/b/Barbeau:Michel.html">Michel Barbeau</a>, <a href="../../indices/a-tree/b/Bose:Prosenjit.html">Prosenjit Bose</a>, <a href="../../indices/a-tree/c/Carmi:Paz.html">Paz Carmi</a>, <a href="../../indices/a-tree/k/Kranakis:Evangelos.html">Evangelos Kranakis</a>: <br><b>Location Oblivious Distributed Unit Disk Graph Coloring. </b>222-233<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_18"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CoutureBBCK07">BibTeX</a></font> </ul> <h2>Communication Networks: Fault Tolerance</h2> <ul> <li><a name="BanicZ07" href="../../indices/a-tree/b/Banic:Iztok.html">Iztok Banic</a>, <a href="../../indices/a-tree/z/Zerovnik:Janez.html">Janez Zerovnik</a>: <br><b>Edge Fault-Diameter of Cartesian Product of Graphs. </b>234-245<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_19"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BanicZ07">BibTeX</a></font> <li><a name="KralovicK07" 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>Rapid Almost-Complete Broadcasting in Faulty Networks. </b>246-260<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_20"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KralovicK07">BibTeX</a></font> <li><a name="BermondGP07" href="../../indices/a-tree/b/Bermond:Jean=Claude.html">Jean-Claude Bermond</a>, <a href="../../indices/a-tree/g/Giroire:Fr=eacute=d=eacute=ric.html">Frédéric Giroire</a>, <a href="../../indices/a-tree/p/P=eacute=rennes:St=eacute=phane.html">Stéphane Pérennes</a>: <br><b>Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions. </b>261-273<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_21"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BermondGP07">BibTeX</a></font> </ul> <h2>Autonomous Systems: Fault Tolerance</h2> <ul> <li><a name="KatayamaTIIW07" href="../../indices/a-tree/k/Katayama:Yoshiaki.html">Yoshiaki Katayama</a>, <a href="../../indices/a-tree/t/Tomida:Yuichi.html">Yuichi Tomida</a>, <a href="../../indices/a-tree/i/Imazu:Hiroyuki.html">Hiroyuki Imazu</a>, <a href="../../indices/a-tree/i/Inuzuka:Nobuhiro.html">Nobuhiro Inuzuka</a>, <a href="../../indices/a-tree/w/Wada:Koichi.html">Koichi Wada</a>: <br><b>Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots. </b>274-288<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_22"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KatayamaTIIW07">BibTeX</a></font> <li><a name="DasFSY07" 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/s/Santoro:Nicola.html">Nicola Santoro</a>, <a href="../../indices/a-tree/y/Yamashita:Masafumi.html">Masafumi Yamashita</a>: <br><b>Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. </b>289-303<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_23"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DasFSY07">BibTeX</a></font> </ul> <h2>Communication Networks: Parallel Computing and Selfish Routing</h2> <ul> <li><a name="EvenLL07" href="../../indices/a-tree/e/Even:Guy.html">Guy Even</a>, <a href="../../indices/a-tree/l/Levi:Tamir.html">Tamir Levi</a>, <a href="../../indices/a-tree/l/Litman:Ami.html">Ami Litman</a>: <br><b>Optimal Conclusive Sets for Comparator Networks. </b>304-317<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_24"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/EvenLL07">BibTeX</a></font> <li><a name="KarakostasKVX07" href="../../indices/a-tree/k/Karakostas:George.html">George Karakostas</a>, <a href="../../indices/a-tree/k/Kim:Taeyon.html">Taeyon Kim</a>, <a href="../../indices/a-tree/v/Viglas:Anastasios.html">Anastasios Viglas</a>, <a href="../../indices/a-tree/x/Xia:Hao.html">Hao Xia</a>: <br><b>Selfish Routing with Oblivious Users. </b>318-327<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_25"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KarakostasKVX07">BibTeX</a></font> <li><a name="BroersmaJP07" href="../../indices/a-tree/b/Broersma:Hajo.html">Hajo Broersma</a>, <a href="../../indices/a-tree/j/Johnson_0002:Matthew.html">Matthew Johnson</a>, <a href="../../indices/a-tree/p/Paulusma:Dani=euml=l.html">Daniël Paulusma</a>: <br><b>Upper Bounds and Algorithms for Parallel Knock-Out Numbers. </b>328-340<br><a href="http://dx.doi.org/10.1007/978-3-540-72951-8_26"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BroersmaJP07">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
