sirocco1998.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 1998</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>5. <a href="index.html">SIROCCO</a> 1998:
Amalfi,
Italy</h1> <a name="1998" href="../../indices/a-tree/g/Gargano:Luisa.html">Luisa Gargano</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a> (Eds.):
SIROCCO'98, 5th International Colloquium on Structural Information & Communication Complexity, Amalfi, Italy, June 22-24, 1998.
Carleton Scientific 1998 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/1998">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/sirocco/1998,
editor = {Luisa Gargano and
David Peleg},
title = {SIROCCO'98, 5th International Colloquium on Structural Information
{\&} Communication Complexity, Amalfi, Italy, June 22-24, 1998},
booktitle = {SIROCCO},
publisher = {Carleton Scientific},
year = {1998},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
<ul>
<li><a name="PatersonSSV98" href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>, <a href="../../indices/a-tree/s/Schr=ouml=der:Heiko.html">Heiko Schröder</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>:
On permutation communications in all-optical rings.
1-9 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/PatersonSSV98">BibTeX</a></font>
<li><a name="CaragiannisKP98" 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/p/Persiano:Pino.html">Pino Persiano</a>:
Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees.
10-19 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/CaragiannisKP98">BibTeX</a></font>
<li><a name="TseL98" href="../../indices/a-tree/t/Tse:Savio_S=_H=.html">Savio S. H. Tse</a>, <a href="../../indices/a-tree/l/Lau:Francis_C=_M=.html">Francis C. M. Lau</a>:
Adaptive broadcast-confirm algorithms in general networks and their analysis.
20-35 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/TseL98">BibTeX</a></font>
<li><a name="Delmas98" href="../../indices/a-tree/d/Delmas:Olivier.html">Olivier Delmas</a>:
Trade-off for broadcast protocols.
36-50 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Delmas98">BibTeX</a></font>
<li><a name="Ducourthial98" href="../../indices/a-tree/d/Ducourthial:Bertrand.html">Bertrand Ducourthial</a>:
New operators for computing with associative nets.
51-65 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Ducourthial98">BibTeX</a></font>
<li><a name="SettleS98" href="../../indices/a-tree/s/Settle:Amber.html">Amber Settle</a>, <a href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>:
Improved bounds for the firing synchronization problem.
66-81 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SettleS98">BibTeX</a></font>
<li><a name="KranakisPS98" href="../../indices/a-tree/k/Kranakis:Evangelos.html">Evangelos Kranakis</a>, <a href="../../indices/a-tree/p/Pelc:Andrzej.html">Andrzej Pelc</a>, <a href="../../indices/a-tree/s/Spatharis:Anthony.html">Anthony Spatharis</a>:
Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems.
82-97 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KranakisPS98">BibTeX</a></font>
<li><a name="FraigniaudG98" href="../../indices/a-tree/f/Fraigniaud:Pierre.html">Pierre Fraigniaud</a>, <a href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>:
A Theoretical Model for Routing Complexity.
98-113 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FraigniaudG98">BibTeX</a></font>
<li><a name="Dobrev98" href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</a>:
An Alternative View on Sense of Direction (Position paper).
114-128 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Dobrev98">BibTeX</a></font>
<li><a name="JenningsC98" href="../../indices/a-tree/j/Jennings:Esther.html">Esther Jennings</a>, <a href="../../indices/a-tree/c/Carlsson:Svante.html">Svante Carlsson</a>:
An optimal distributed 3-edge-connected component algorithm.
129-144 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/JenningsC98">BibTeX</a></font>
<li><a name="WattenhoferW98" href="../../indices/a-tree/w/Wattenhofer:Roger.html">Roger Wattenhofer</a>, <a href="../../indices/a-tree/w/Widmayer:Peter.html">Peter Widmayer</a>:
The counting pyramid: an adaptive distributed counting scheme.
145-157 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/WattenhoferW98">BibTeX</a></font>
<li><a name="Fujita98" href="../../indices/a-tree/f/Fujita:Satoshi.html">Satoshi Fujita</a>:
Neighbourhood Information Dissemination in the Star Graph.
158-172 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Fujita98">BibTeX</a></font>
<li><a name="DobrevRT98" href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</a>, <a href="../../indices/a-tree/r/Ruzicka:Peter.html">Peter Ruzicka</a>, <a href="../../indices/a-tree/t/Tel:Gerard.html">Gerard Tel</a>:
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes.
173-187 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DobrevRT98">BibTeX</a></font>
<li><a name="LuccioMAP98" href="../../indices/a-tree/l/Luccio:Fabrizio.html">Fabrizio Luccio</a>, <a href="../../indices/a-tree/m/Mahafzah:Mohammed.html">Mohammed Mahafzah</a>, <a href="../../indices/a-tree/a/Al=Omari:Mahmoud.html">Mahmoud Al-Omari</a>, <a href="../../indices/a-tree/p/Pagli:Linda.html">Linda Pagli</a>:
Routing with the use of masks.
188-200 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/LuccioMAP98">BibTeX</a></font>
<li><a name="FlamminiGNT98" href="../../indices/a-tree/f/Flammini:Michele.html">Michele Flammini</a>, <a href="../../indices/a-tree/g/Gambosi:Giorgio.html">Giorgio Gambosi</a>, <a href="../../indices/a-tree/n/Nanni:Umberto.html">Umberto Nanni</a>, <a href="../../indices/a-tree/t/Tan:Richard_B=.html">Richard B. Tan</a>:
Characterization results of all shortest paths interval routing schemes.
201-213 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FlamminiGNT98">BibTeX</a></font>
<li><a name="TorreNP98" href="../../indices/a-tree/t/Torre:Pilar_de_la.html">Pilar de la Torre</a>, <a href="../../indices/a-tree/n/Narayanan:Lata.html">Lata Narayanan</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>:
Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper).
214-228 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/TorreNP98">BibTeX</a></font>
<li><a name="DattaJPV98" href="../../indices/a-tree/d/Datta:Ajoy_Kumar.html">Ajoy Kumar Datta</a>, <a href="../../indices/a-tree/j/Johnen:Colette.html">Colette Johnen</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>:
Self-stabilizing depth-first token circulation in arbitrary rooted networks.
229-243 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DattaJPV98">BibTeX</a></font>
<li><a name="FatourouMS98" href="../../indices/a-tree/f/Fatourou:Panagiota.html">Panagiota Fatourou</a>, <a href="../../indices/a-tree/m/Mavronicolas:Marios.html">Marios Mavronicolas</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
244-258 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FatourouMS98">BibTeX</a></font>
<li><a name="SochT98" href="../../indices/a-tree/s/Soch:Michal.html">Michal Soch</a>, <a href="../../indices/a-tree/t/Tvrd=iacute=k:Pavel.html">Pavel Tvrdík</a>:
Time-optimal gossip in noncombining 3-D tori.
259-271 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SochT98">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
