sirocco2000.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 2000</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>7. <a href="index.html">SIROCCO</a> 2000:
Laquila,
Italy</h1> <a name="2000" href="../../indices/a-tree/f/Flammini:Michele.html">Michele Flammini</a>, <a href="../../indices/a-tree/n/Nardelli:Enrico.html">Enrico Nardelli</a>, <a href="../../indices/a-tree/p/Proietti:Guido.html">Guido Proietti</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a> (Eds.):
SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000.
Carleton Scientific 2000 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/2000">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/sirocco/2000,
editor = {Michele Flammini and
Enrico Nardelli and
Guido Proietti and
Paul G. Spirakis},
title = {SIROCCO 7, Proceedings of the 7th International Colloquium on
Structural Information and Communication Complexity, Laquila,
Italy, June 20-22, 2000},
booktitle = {SIROCCO},
publisher = {Carleton Scientific},
year = {2000},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
<ul>
<li><a name="BaldoniHRT00" href="../../indices/a-tree/b/Baldoni:Roberto.html">Roberto Baldoni</a>, <a href="../../indices/a-tree/h/H=eacute=lary:Jean=Michel.html">Jean-Michel Hélary</a>, <a href="../../indices/a-tree/r/Raynal:Michel.html">Michel Raynal</a>, <a href="../../indices/a-tree/t/Tanguy:L=eacute=naick.html">Lénaick Tanguy</a>:
Consensus in byzantine asynchronous systems.
1-15 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BaldoniHRT00">BibTeX</a></font>
<li><a name="BeierS00" href="../../indices/a-tree/b/Beier:Ren=eacute=.html">René Beier</a>, <a href="../../indices/a-tree/s/Sibeyn:Jop_F=.html">Jop F. Sibeyn</a>:
A powerful heuristic for telephone gossiping.
17-35 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BeierS00">BibTeX</a></font>
<li><a name="BoldiV00" href="../../indices/a-tree/b/Boldi:Paolo.html">Paolo Boldi</a>, <a href="../../indices/a-tree/v/Vigna:Sebastiano.html">Sebastiano Vigna</a>:
Lower bounds for (weak) sense of direction.
37-46 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BoldiV00">BibTeX</a></font>
<li><a name="BuiDDN00" href="../../indices/a-tree/b/Bui:Marc.html">Marc Bui</a>, <a href="../../indices/a-tree/d/Das:Sajal_K=.html">Sajal K. Das</a>, <a href="../../indices/a-tree/d/Datta:Ajoy_Kumar.html">Ajoy Kumar Datta</a>, <a href="../../indices/a-tree/n/Nguyen:Dai_Tho.html">Dai Tho Nguyen</a>:
Randomized mobile agent based routing in wireless networks.
47-61 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BuiDDN00">BibTeX</a></font>
<li><a name="DinitzMR00" href="../../indices/a-tree/d/Dinitz:Yefim.html">Yefim Dinitz</a>, <a href="../../indices/a-tree/m/Moran:Shlomo.html">Shlomo Moran</a>, <a href="../../indices/a-tree/r/Rajsbaum:Sergio.html">Sergio Rajsbaum</a>:
Exact communication costs for consensus and leader in a tree.
63-77 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DinitzMR00">BibTeX</a></font>
<li><a name="Dobrev00" href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</a>:
Efficient wakeup in anonymous oriented complete graphs.
79-93 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Dobrev00">BibTeX</a></font>
<li><a name="DucourthialT00" href="../../indices/a-tree/d/Ducourthial:Bertrand.html">Bertrand Ducourthial</a>, <a href="../../indices/a-tree/t/Tixeuil:S=eacute=bastien.html">Sébastien Tixeuil</a>:
Self-stabilization with path algebra.
95-109 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DucourthialT00">BibTeX</a></font>
<li><a name="FlocchiniKRRS00" href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a href="../../indices/a-tree/k/Kralovic:Rastislav.html">Rastislav Kralovic</a>, <a href="../../indices/a-tree/r/Roncato:Alessandro.html">Alessandro Roncato</a>, <a href="../../indices/a-tree/r/Ruzicka:Peter.html">Peter Ruzicka</a>, <a href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>:
On time versus size for monotone dynamic monopolies in regular topologies.
111-125 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FlocchiniKRRS00">BibTeX</a></font>
<li><a name="GavoilleZ00" href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>, <a href="../../indices/a-tree/z/Zemmari:Akka.html">Akka Zemmari</a>:
The compactness of adaptive routing tables.
127-139 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GavoilleZ00">BibTeX</a></font>
<li><a name="GeorgiouS00" href="../../indices/a-tree/g/Georgiou:Chryssis.html">Chryssis Georgiou</a>, <a href="../../indices/a-tree/s/Shvartsman:Alexander_A=.html">Alexander A. Shvartsman</a>:
Cooperative computing with fragmentable and mergeable groups.
141-156 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GeorgiouS00">BibTeX</a></font>
<li><a name="Harutyunyan00" href="../../indices/a-tree/h/Harutyunyan:Hovhannes_A=.html">Hovhannes A. Harutyunyan</a>:
Multiple message broadcasting in modified Knödel graph.
157-165 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Harutyunyan00">BibTeX</a></font>
<li><a name="HassinP00" href="../../indices/a-tree/h/Hassin:Yehuda.html">Yehuda Hassin</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>:
Extremal bounds for probabilistic polling in graphs.
167-180 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/HassinP00">BibTeX</a></font>
<li><a name="HelaryMR00" href="../../indices/a-tree/h/H=eacute=lary:Jean=Michel.html">Jean-Michel Hélary</a>, <a href="../../indices/a-tree/m/Melideo:Giovanna.html">Giovanna Melideo</a>, <a href="../../indices/a-tree/r/Raynal:Michel.html">Michel Raynal</a>:
Tracking causality in distributed systems: a suite of efficient protocols.
181-195 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/HelaryMR00">BibTeX</a></font>
<li><a name="IrlaneKL00" href="../../indices/a-tree/i/Irlande:Alexis.html">Alexis Irlande</a>, <a href="../../indices/a-tree/k/K=ouml=nig:Jean=Claude.html">Jean-Claude König</a>, <a href="../../indices/a-tree/l/Laforest:Christian.html">Christian Laforest</a>:
Construction of low-cost and low-diameter Steiner trees for multipoint groups.
197-210 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/IrlaneKL00">BibTeX</a></font>
<li><a name="JuurlinkKHR00" href="../../indices/a-tree/j/Juurlink:Ben_H=_H=.html">Ben H. H. Juurlink</a>, <a href="../../indices/a-tree/k/Kolman:Petr.html">Petr Kolman</a>, <a href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>, <a href="../../indices/a-tree/r/Rieping:Ingo.html">Ingo Rieping</a>:
Optimal broadcast on parallel locality models.
221-225 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/JuurlinkKHR00">BibTeX</a></font>
<li><a name="LuccioP00" href="../../indices/a-tree/l/Luccio:Fabrizio.html">Fabrizio Luccio</a>, <a href="../../indices/a-tree/p/Pagli:Linda.html">Linda Pagli</a>:
An algorithmic definition of interval with applications to routing.
227-236 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/LuccioP00">BibTeX</a></font>
<li><a name="MetivierT00" href="../../indices/a-tree/m/M=eacute=tivier:Yves.html">Yves Métivier</a>, <a href="../../indices/a-tree/t/Tel:Gerard.html">Gerard Tel</a>:
Termination detection and universal graph reconstruction.
237-251 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MetivierT00">BibTeX</a></font>
<li><a name="NakanoO00" href="../../indices/a-tree/n/Nakano:Koji.html">Koji Nakano</a>, <a href="../../indices/a-tree/o/Olariu:Stephan.html">Stephan Olariu</a>:
A randomized leader election protocol for ad-hoc networks.
253-267 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/NakanoO00">BibTeX</a></font>
<li><a name="RaspaudSV00" 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>, <a href="../../indices/a-tree/v/Vrto:Imrich.html">Imrich Vrto</a>:
Congestion and dilation, similarities and differences: A survey.
269-280 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/RaspaudSV00">BibTeX</a></font>
<li><a name="RobertsSW00" href="../../indices/a-tree/r/Roberts:Alan.html">Alan Roberts</a>, <a href="../../indices/a-tree/s/Symvonis:Antonios.html">Antonios Symvonis</a>, <a href="../../indices/a-tree/w/Wood:David_R=.html">David R. Wood</a>:
Lower bounds for hot-potato permutation routing on trees.
281-295 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/RobertsSW00">BibTeX</a></font>
<li><a name="HwangC00" href="../../indices/a-tree/h/Hwang:Frank_K=.html">Frank K. Hwang</a>, <a href="../../indices/a-tree/c/Chen:S=_K=.html">S. K. Chen</a>:
The 1.5-loop network and the mixed 1.5-loop network.
297-306 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/HwangC00">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
