sirocco2004.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 2004</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>11. <a href="index.html">SIROCCO</a> 2004:
Smolenice Castle,
Slovakia</h1> <a name="2004" href="../../indices/a-tree/k/Kralovic:Rastislav.html">Rastislav Kralovic</a>, <a href="../../indices/a-tree/s/S=yacute=kora:Ondrej.html">Ondrej Sýkora</a> (Eds.):
Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings.
<a href="../../journals/lncs.html">Lecture Notes in Computer Science</a> 3104 Springer 2004, ISBN 3-540-22230-8 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/2004">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/sirocco/2004,
editor = {Rastislav Kralovic and
Ondrej S{\'y}kora},
title = {Structural Information and Communication Complexity, 11th International
Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23,
2004, Proceedings},
booktitle = {SIROCCO},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {3104},
year = {2004},
isbn = {3-540-22230-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
<ul>
<li><a name="AngelBP04" href="../../indices/a-tree/a/Angel:Eric.html">Eric Angel</a>, <a href="../../indices/a-tree/b/Bampis:Evripidis.html">Evripidis Bampis</a>, <a href="../../indices/a-tree/p/Pascual:Fanny.html">Fanny Pascual</a>:
<br><b>Traffic Grooming in a Passive Star WDM Network.
</b>1-12<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=1"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/AngelBP04">BibTeX</a></font>
<li><a name="BiloM04" href="../../indices/a-tree/b/Bil=ograve=:Vittorio.html">Vittorio Bilò</a>, <a href="../../indices/a-tree/m/Moscardelli:Luca.html">Luca Moscardelli</a>:
<br><b>The Price of Anarchy in All-Optical Networks.
</b>13-22<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=13"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BiloM04">BibTeX</a></font>
<li><a name="BooneCGKOSU04" href="../../indices/a-tree/b/Boone:Paul.html">Paul Boone</a>, <a href="../../indices/a-tree/c/Ch=aacute=vez:Edgar.html">Edgar Chávez</a>, <a href="../../indices/a-tree/g/Gleitzky:Lev.html">Lev Gleitzky</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/s/Salazar:Gelasio.html">Gelasio Salazar</a>, <a href="../../indices/a-tree/u/Urrutia:Jorge.html">Jorge Urrutia</a>:
<br><b>Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks.
</b>23-34<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=23"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BooneCGKOSU04">BibTeX</a></font>
<li><a name="Bremler-BarrE04" href="../../indices/a-tree/b/Bremler=Barr:Anat.html">Anat Bremler-Barr</a>, <a href="../../indices/a-tree/e/Epstein:Leah.html">Leah Epstein</a>:
<br><b>Path Layout on Tree Networks: Bounds in Different Label Switching Models.
</b>35-46<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=35"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Bremler-BarrE04">BibTeX</a></font>
<li><a name="ChlebikC04" href="../../indices/a-tree/c/Chleb=iacute=k:Miroslav.html">Miroslav Chlebík</a>, <a href="../../indices/a-tree/c/Chleb=iacute=kov=aacute=:Janka.html">Janka Chlebíková</a>:
<br><b>On Approximability of the Independent Set Problem for Low Degree Graphs.
</b>47-56<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=47"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ChlebikC04">BibTeX</a></font>
<li><a name="ChlebusR04" href="../../indices/a-tree/c/Chlebus:Bogdan_S=.html">Bogdan S. Chlebus</a>, <a href="../../indices/a-tree/r/Rokicki:Mariusz_A=.html">Mariusz A. Rokicki</a>:
<br><b>Asynchronous Broadcast in Radio Networks.
</b>57-68<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=57"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ChlebusR04">BibTeX</a></font>
<li><a name="ChoplinNO04" href="../../indices/a-tree/c/Choplin:S=eacute=bastien.html">Sébastien Choplin</a>, <a href="../../indices/a-tree/n/Narayanan:Lata.html">Lata Narayanan</a>, <a href="../../indices/a-tree/o/Opatrny:Jaroslav.html">Jaroslav Opatrny</a>:
<br><b>Two-Hop Virtual Path Layout in Tori.
</b>69-78<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=69"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ChoplinNO04">BibTeX</a></font>
<li><a name="CohenP04" 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>Robot Convergence via Center-of-Gravity Algorithms.
</b>79-88<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=79"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CohenP04">BibTeX</a></font>
<li><a name="CordascoGHNS04" href="../../indices/a-tree/c/Cordasco:Gennaro.html">Gennaro Cordasco</a>, <a href="../../indices/a-tree/g/Gargano:Luisa.html">Luisa Gargano</a>, <a href="../../indices/a-tree/h/Hammar:Mikael.html">Mikael Hammar</a>, <a href="../../indices/a-tree/n/Negro:Alberto.html">Alberto Negro</a>, <a href="../../indices/a-tree/s/Scarano:Vittorio.html">Vittorio Scarano</a>:
<br><b>F-Chord: Improved Uniform Routing on Chord: (Extended Abstract).
</b>89-98<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=89"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CordascoGHNS04">BibTeX</a></font>
<li><a name="SalvoP04" href="../../indices/a-tree/s/Salvo:Aleksej_Di.html">Aleksej Di Salvo</a>, <a href="../../indices/a-tree/p/Proietti:Guido.html">Guido Proietti</a>:
<br><b>Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor.
</b>99-110<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=99"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SalvoP04">BibTeX</a></font>
<li><a name="DobrevFS04" href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</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>:
<br><b>Improved Bounds for Optimal Black Hole Search with a Network Map.
</b>111-122<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=111"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DobrevFS04">BibTeX</a></font>
<li><a name="DourisboureG04" href="../../indices/a-tree/d/Dourisboure:Yon.html">Yon Dourisboure</a>, <a href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>:
<br><b>Sparse Additive Spanners for Bounded Tree-Length Graphs.
</b>123-137<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=123"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DourisboureG04">BibTeX</a></font>
<li><a name="FertinRS04" href="../../indices/a-tree/f/Fertin:Guillaume.html">Guillaume Fertin</a>, <a href="../../indices/a-tree/r/Raspaud:Andr=eacute=.html">André Raspaud</a>, <a href="../../indices/a-tree/s/S=yacute=kora:Ondrej.html">Ondrej Sýkora</a>:
<br><b>No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes.
</b>138-148<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=138"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FertinRS04">BibTeX</a></font>
<li><a name="FerranteP04" href="../../indices/a-tree/f/Ferrante:Alessandro.html">Alessandro Ferrante</a>, <a href="../../indices/a-tree/p/Parente:Mimmo.html">Mimmo Parente</a>:
<br><b>Existence of Nash Equilibria in Selfish Routing Problems.
</b>149-160<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=149"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FerranteP04">BibTeX</a></font>
<li><a name="FlocchiniKKLSS04" href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a 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/l/Luccio:Flaminia_L=.html">Flaminia L. Luccio</a>, <a href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>, <a href="../../indices/a-tree/s/Sawchuk:Cindy.html">Cindy Sawchuk</a>:
<br><b>Mobile Agents Rendezvous When Tokens Fail.
</b>161-172<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=161"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FlocchiniKKLSS04">BibTeX</a></font>
<li><a name="GasieniecPX04" href="../../indices/a-tree/g/Gasieniec:Leszek.html">Leszek Gasieniec</a>, <a href="../../indices/a-tree/p/Potapov:Igor.html">Igor Potapov</a>, <a href="../../indices/a-tree/x/Xin:Qin.html">Qin Xin</a>:
<br><b>Time Efficient Gossiping in Known Radio Networks.
</b>173-184<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=173"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GasieniecPX04">BibTeX</a></font>
<li><a name="GeorgiouMS04" href="../../indices/a-tree/g/Georgiou:Chryssis.html">Chryssis Georgiou</a>, <a href="../../indices/a-tree/m/Musial:Peter_M=.html">Peter M. Musial</a>, <a href="../../indices/a-tree/s/Shvartsman:Alexander_A=.html">Alexander A. Shvartsman</a>:
<br><b>Long-Lived Rambo: Trading Knowledge for Communication.
</b>185-196<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=185"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GeorgiouMS04">BibTeX</a></font>
<li><a name="GuptaMS04" href="../../indices/a-tree/g/Gupta:Arvind.html">Arvind Gupta</a>, <a href="../../indices/a-tree/m/Manuch:J=aacute=n.html">Ján Manuch</a>, <a href="../../indices/a-tree/s/Stacho:Ladislav.html">Ladislav Stacho</a>:
<br><b>Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach.
</b>197-208<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=197"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GuptaMS04">BibTeX</a></font>
<li><a name="LuccioS04" href="../../indices/a-tree/l/Luccio:Flaminia_L=.html">Flaminia L. Luccio</a>, <a href="../../indices/a-tree/s/Sibeyn:Jop_F=.html">Jop F. Sibeyn</a>:
<br><b>Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.
</b>209-220<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=209"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/LuccioS04">BibTeX</a></font>
<li><a name="MargaraPV04" href="../../indices/a-tree/m/Margara:Luciano.html">Luciano Margara</a>, <a href="../../indices/a-tree/p/Pistocchi:Alessandro.html">Alessandro Pistocchi</a>, <a href="../../indices/a-tree/v/Vassura:Marco.html">Marco Vassura</a>:
<br><b>Perfect Token Distribution on Trees.
</b>221-232<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=221"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MargaraPV04">BibTeX</a></font>
<li><a name="MatichinP04" href="../../indices/a-tree/m/Matichin:Rachel.html">Rachel Matichin</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>:
<br><b>Approximation Algorithm for Hotlink Assignment in the Greedy Model.
</b>233-244<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=233"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MatichinP04">BibTeX</a></font>
<li><a name="PaquetteP04" href="../../indices/a-tree/p/Paquette:Michel.html">Michel Paquette</a>, <a href="../../indices/a-tree/p/Pelc:Andrzej.html">Andrzej Pelc</a>:
<br><b>Optimal Decision Strategies in Byzantine Environments.
</b>245-254<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=245"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/PaquetteP04">BibTeX</a></font>
<li><a name="PennaV04" 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>Sharing the Cost of Multicast Transmissions in Wireless Networks.
</b>255-266<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=255"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/PennaV04">BibTeX</a></font>
<li><a name="WangLL04" 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>, <a href="../../indices/a-tree/l/Liu:Yan_Yan.html">Yan Yan Liu</a>:
<br><b>NP-Completeness Results for All-Shortest-Path Interval Routing.
</b>267-278<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=267"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/WangLL04">BibTeX</a></font>
<li><a name="YeZ04" href="../../indices/a-tree/y/Ye:Deshi.html">Deshi Ye</a>, <a href="../../indices/a-tree/z/Zhang:Guochuan.html">Guochuan Zhang</a>:
<br><b>On-Line Scheduling of Parallel Jobs.
</b>279-290<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=279"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/YeZ04">BibTeX</a></font>
<li><a name="YeZ04a" href="../../indices/a-tree/y/Ye:Deshi.html">Deshi Ye</a>, <a href="../../indices/a-tree/z/Zhang:Hu.html">Hu Zhang</a>:
<br><b>The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces.
</b>291-302<br><a href="http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3104&spage=291"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/YeZ04a">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
