sirocco2001.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 2001</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>8. <a href="index.html">SIROCCO</a> 2001:
Val de Nuria,
Spain</h1> <a name="2001" href="../../indices/a-tree/c/Comellas:Francesc.html">Francesc Comellas</a>, <a href="../../indices/a-tree/f/F=agrave=brega:Josep.html">Josep Fàbrega</a>, <a href="../../indices/a-tree/f/Fraigniaud:Pierre.html">Pierre Fraigniaud</a> (Eds.):
SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001.
Proceedings in Informatics 8 Carleton Scientific 2001, ISBN 1-894145-10-0 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/2001">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/sirocco/2001,
editor = {Francesc Comellas and
Josep F{\`a}brega and
Pierre Fraigniaud},
title = {SIROCCO 8, Proceedings of the 8th International Colloquium on
Structural Information and Communication Complexity, Vall de
N{\'u}ria, Girona-Barcelona, Catalonia, Spain, 27-29 June,
2001},
booktitle = {SIROCCO},
publisher = {Carleton Scientific},
series = {Proceedings in Informatics},
volume = {8},
year = {2001},
isbn = {1-894145-10-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
<ul>
<li><a name="BarriereD01" href="../../indices/a-tree/b/Barri=egrave=re:Lali.html">Lali Barrière</a>, <a href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</a>:
Leader Election in Abelian Cayley Graphs.
5-20 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BarriereD01">BibTeX</a></font>
<li><a name="BermondCCT01" href="../../indices/a-tree/b/Bermond:Jean=Claude.html">Jean-Claude Bermond</a>, <a href="../../indices/a-tree/c/Chacon:Lilian.html">Lilian Chacon</a>, <a href="../../indices/a-tree/c/Coudert:David.html">David Coudert</a>, <a href="../../indices/a-tree/t/Tillerot:Fran=ccedil=ois.html">François Tillerot</a>:
Cycle Covering.
21-34 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BermondCCT01">BibTeX</a></font>
<li><a name="BoseM01" href="../../indices/a-tree/b/Bose:Prosenjit.html">Prosenjit Bose</a>, <a href="../../indices/a-tree/m/Morin:Pat.html">Pat Morin</a>:
Competitive Online Routing in Geometric Graphs.
35-44 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BoseM01">BibTeX</a></font>
<li><a name="BrudaA01" href="../../indices/a-tree/b/Bruda:Stefan_D=.html">Stefan D. Bruda</a>, <a href="../../indices/a-tree/a/Akl:Selim_G=.html">Selim G. Akl</a>:
Parallel Real-Time Complexity A Strong Infinite Hierarchy.
45-60 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BrudaA01">BibTeX</a></font>
<li><a name="CantarellDPV01" href="../../indices/a-tree/c/Cantarell:S=eacute=bastien.html">Sébastien Cantarell</a>, <a href="../../indices/a-tree/d/Datta:Ajoy_Kumar.html">Ajoy Kumar Datta</a>, <a href="../../indices/a-tree/p/Petit:Franck.html">Franck Petit</a>, <a href="../../indices/a-tree/v/Villain:Vincent.html">Vincent Villain</a>:
Group Mutual Exclusion in Token Rings.
61-76 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CantarellDPV01">BibTeX</a></font>
<li><a name="CaragiannisKK01" href="../../indices/a-tree/c/Caragiannis:Ioannis.html">Ioannis Caragiannis</a>, <a href="../../indices/a-tree/k/Kaklamanis:Christos.html">Christos Kaklamanis</a>, <a href="../../indices/a-tree/k/Kanellopoulos:Panagiotis.html">Panagiotis Kanellopoulos</a>:
New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies.
77-88 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CaragiannisKK01">BibTeX</a></font>
<li><a name="ChepoiR01" href="../../indices/a-tree/c/Chepoi:Victor.html">Victor Chepoi</a>, <a href="../../indices/a-tree/r/Rollin:Alexis.html">Alexis Rollin</a>:
Interval Routing in Some Planar Quadrangulations.
89-104 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ChepoiR01">BibTeX</a></font>
<li><a name="Damaschke01" href="../../indices/a-tree/d/Damaschke:Peter.html">Peter Damaschke</a>:
Worst-case bounds for blind broadcasting in small-degree networks.
105-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Damaschke01">BibTeX</a></font>
<li><a name="ElkinP01" href="../../indices/a-tree/e/Elkin:Michael.html">Michael Elkin</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>:
The Client-Server 2-Spanner Problem with Applications to Network Design.
117-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ElkinP01">BibTeX</a></font>
<li><a name="FertinR01" href="../../indices/a-tree/f/Fertin:Guillaume.html">Guillaume Fertin</a>, <a href="../../indices/a-tree/r/Raspaud:Andr=eacute=.html">André Raspaud</a>:
k-Neighborhood Broadcasting.
133-146 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FertinR01">BibTeX</a></font>
<li><a name="FlocchiniPSW01" href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a href="../../indices/a-tree/p/Prencipe:Giuseppe.html">Giuseppe Prencipe</a>, <a href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>, <a href="../../indices/a-tree/w/Widmayer:Peter.html">Peter Widmayer</a>:
Pattern Formation by Anonymous Robots Without Chirality.
147-162 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FlocchiniPSW01">BibTeX</a></font>
<li><a name="Ganjali01" href="../../indices/a-tree/g/Ganjali:Yashar.html">Yashar Ganjali</a>:
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes.
163-178 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Ganjali01">BibTeX</a></font>
<li><a name="GodardM01" href="../../indices/a-tree/g/Godard:Emmanuel.html">Emmanuel Godard</a>, <a href="../../indices/a-tree/m/M=eacute=tivier:Yves.html">Yves Métivier</a>:
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge.
179-194 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GodardM01">BibTeX</a></font>
<li><a name="GvozdjakP01" href="../../indices/a-tree/g/Gvozdjak:Peter.html">Peter Gvozdjak</a>, <a href="../../indices/a-tree/p/Peters:Joseph_G=.html">Joseph G. Peters</a>:
Modelling Links in Inclined LEO Satellite Networks.
195-208 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GvozdjakP01">BibTeX</a></font>
<li><a name="Hafner01" href="../../indices/a-tree/h/Hafner:Paul_R=.html">Paul R. Hafner</a>:
On the graphs of McKay-Miller-Sirán.
209-216 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Hafner01">BibTeX</a></font>
<li><a name="KesselmanM01" href="../../indices/a-tree/k/Kesselman:Alexander.html">Alexander Kesselman</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>:
QoS-Competitive Video Buffering.
217-230 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KesselmanM01">BibTeX</a></font>
<li><a name="KralovicR01" href="../../indices/a-tree/k/Kralovic:Rastislav.html">Rastislav Kralovic</a>, <a href="../../indices/a-tree/r/Ruzicka:Peter.html">Peter Ruzicka</a>:
On Immunity and Catastrophic Indices of Graphs.
231-242 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KralovicR01">BibTeX</a></font>
<li><a name="MakuchR01" href="../../indices/a-tree/m/Makuch:Martin.html">Martin Makuch</a>, <a href="../../indices/a-tree/r/Ruzicka:Peter.html">Peter Ruzicka</a>:
On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks.
243-258 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MakuchR01">BibTeX</a></font>
<li><a name="MalewiczRS01" href="../../indices/a-tree/m/Malewicz:Grzegorz.html">Grzegorz Malewicz</a>, <a href="../../indices/a-tree/r/Russell:Alexander.html">Alexander Russell</a>, <a href="../../indices/a-tree/s/Shvartsman:Alexander_A=.html">Alexander A. Shvartsman</a>:
Optimal Scheduling for Distributed Cooperation Without Communication.
259-274 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MalewiczRS01">BibTeX</a></font>
<li><a name="MostefaouiRRR01" href="../../indices/a-tree/m/Most=eacute=faoui:Achour.html">Achour Mostéfaoui</a>, <a href="../../indices/a-tree/r/Rajsbaum:Sergio.html">Sergio Rajsbaum</a>, <a href="../../indices/a-tree/r/Raynal:Michel.html">Michel Raynal</a>, <a href="../../indices/a-tree/r/Roy:Matthieu.html">Matthieu Roy</a>:
Efficient Condition-Based Consensus.
275-292 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MostefaouiRRR01">BibTeX</a></font>
<li><a name="NakataY01" href="../../indices/a-tree/n/Nakata:Toshio.html">Toshio Nakata</a>, <a href="../../indices/a-tree/y/Yamashita:Masafumi.html">Masafumi Yamashita</a>:
Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game.
293-304 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/NakataY01">BibTeX</a></font>
<li><a name="Osterloh01" href="../../indices/a-tree/o/Osterloh:Andre.html">Andre Osterloh</a>:
Oblivious Routing on d-Dimensional Meshes.
305-320 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Osterloh01">BibTeX</a></font>
<li><a name="SalingerT01" href="../../indices/a-tree/s/Salinger:Petr.html">Petr Salinger</a>, <a href="../../indices/a-tree/t/Tvrd=iacute=k:Pavel.html">Pavel Tvrdík</a>:
Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing.
321-336 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SalingerT01">BibTeX</a></font>
<li><a name="WatkinsonAF01" href="../../indices/a-tree/w/Watkinson:John.html">John Watkinson</a>, <a href="../../indices/a-tree/a/Adler:Micah.html">Micah Adler</a>, <a href="../../indices/a-tree/f/Fich:Faith_E=.html">Faith E. Fich</a>:
New Protocols for Asymmetric Communication Channels.
337-350 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/WatkinsonAF01">BibTeX</a></font>
<li><a name="ZehS01" href="../../indices/a-tree/z/Zeh:Norbert.html">Norbert Zeh</a>, <a href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>:
On Finding Minimum Deadly Sets for Directed Networks.
351-366 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/ZehS01">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:30 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
