sirocco1997.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 1997</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>4. <a href="index.html">SIROCCO</a> 1997:
Monte Veritá,
Ascona,
Switzerland</h1> <a name="1997" href="../../indices/a-tree/k/Krizanc:Danny.html">Danny Krizanc</a>, <a href="../../indices/a-tree/w/Widmayer:Peter.html">Peter Widmayer</a> (Eds.):
SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997.
Carleton Scientific 1997 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/1997">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/sirocco/1997,
editor = {Danny Krizanc and
Peter Widmayer},
title = {SIROCCO'97, 4th International Colloquium on Structural Information
{\&} Communication Complexity, Monte Verita, Ascona, Switzerland,
July 24-26, 1997},
booktitle = {SIROCCO},
publisher = {Carleton Scientific},
year = {1997},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
<ul>
<li><a name="Peleg97" href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>:
Approximating Minimum Communication Spanning Trees.
1-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Peleg97">BibTeX</a></font>
<li><a name="AnnexsteinBS97" href="../../indices/a-tree/a/Annexstein:Fred_S=.html">Fred S. Annexstein</a>, <a href="../../indices/a-tree/b/Berman:Kenneth_A=.html">Kenneth A. Berman</a>, <a href="../../indices/a-tree/s/Swaminathan:Ramjee_P=.html">Ramjee P. Swaminathan</a>:
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings.
12-23 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/AnnexsteinBS97">BibTeX</a></font>
<li><a name="AulettaCKP97" href="../../indices/a-tree/a/Auletta:Vincenzo.html">Vincenzo Auletta</a>, <a 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>:
Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters.
24-39 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/AulettaCKP97">BibTeX</a></font>
<li><a name="BerthomeCF97" href="../../indices/a-tree/b/Berthom=eacute=:Pascal.html">Pascal Berthomé</a>, <a href="../../indices/a-tree/c/Cohen:Johanne.html">Johanne Cohen</a>, <a href="../../indices/a-tree/f/Ferreira:Afonso.html">Afonso Ferreira</a>:
Embedding Tori in Partitioned Optical Passive Star Networks.
40-52 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BerthomeCF97">BibTeX</a></font>
<li><a name="DobrevR97" href="../../indices/a-tree/d/Dobrev:Stefan.html">Stefan Dobrev</a>, <a href="../../indices/a-tree/r/Ruzicka:Peter.html">Peter Ruzicka</a>:
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes.
53-68 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DobrevR97">BibTeX</a></font>
<li><a name="DiksLP97" href="../../indices/a-tree/d/Diks:Krzysztof.html">Krzysztof Diks</a>, <a href="../../indices/a-tree/l/Lingas:Andrzej.html">Andrzej Lingas</a>, <a href="../../indices/a-tree/p/Pelc:Andrzej.html">Andrzej Pelc</a>:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees.
69-80 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DiksLP97">BibTeX</a></font>
<li><a name="FaloutsosPS97" href="../../indices/a-tree/f/Faloutsos:Michalis.html">Michalis Faloutsos</a>, <a href="../../indices/a-tree/p/Pankaj:Rajesh.html">Rajesh Pankaj</a>, <a href="../../indices/a-tree/s/Sevcik:Kenneth_C=.html">Kenneth C. Sevcik</a>:
Bounds for the On-line Multicast Problem in Directed Graphs.
81-98 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FaloutsosPS97">BibTeX</a></font>
<li><a name="EilamMZ97" href="../../indices/a-tree/e/Eilam:Tamar.html">Tamar Eilam</a>, <a href="../../indices/a-tree/m/Moran:Shlomo.html">Shlomo Moran</a>, <a href="../../indices/a-tree/z/Zaks:Shmuel.html">Shmuel Zaks</a>:
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing.
99-111 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/EilamMZ97">BibTeX</a></font>
<li><a name="TseL97" 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>:
An Optimal Lower Bound for Interval Routing in General Networks.
112-124 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/TseL97">BibTeX</a></font>
<li><a name="NarayananO97" href="../../indices/a-tree/n/Narayanan:Lata.html">Lata Narayanan</a>, <a href="../../indices/a-tree/o/Opatrny:Jaroslav.html">Jaroslav Opatrny</a>:
Compact Routing on Chordal Rings.
125-137 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/NarayananO97">BibTeX</a></font>
<li><a name="Schoning97" href="../../indices/a-tree/s/Sch=ouml=ning:Uwe.html">Uwe Schöning</a>:
Better Expanders and Superconcentrators by Kolmogorov Complexity.
138-150 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Schoning97">BibTeX</a></font>
<li><a name="Peleg97a" href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>:
Size Bounds for Dynamic Monopolies.
151-161 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Peleg97a">BibTeX</a></font>
<li><a name="GavoilleG97" href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>, <a href="../../indices/a-tree/g/Gengler:Marc.html">Marc Gengler</a>:
An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three.
162-175 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GavoilleG97">BibTeX</a></font>
<li><a name="AnnexsteinG97" href="../../indices/a-tree/a/Annexstein:Fred_S=.html">Fred S. Annexstein</a>, <a href="../../indices/a-tree/g/Giannella:Chris.html">Chris Giannella</a>:
An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks.
176-187 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/AnnexsteinG97">BibTeX</a></font>
<li><a name="MetivierMW97" href="../../indices/a-tree/m/M=eacute=tivier:Yves.html">Yves Métivier</a>, <a href="../../indices/a-tree/m/Muscholl:Anca.html">Anca Muscholl</a>, <a href="../../indices/a-tree/w/Wacrenier:Pierre=Andr=eacute=.html">Pierre-André Wacrenier</a>:
About the local detection of termination of local computations in graphs.
188-200 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/MetivierMW97">BibTeX</a></font>
<li><a name="BoldiV97" href="../../indices/a-tree/b/Boldi:Paolo.html">Paolo Boldi</a>, <a href="../../indices/a-tree/v/Vigna:Sebastiano.html">Sebastiano Vigna</a>:
Computing Vector Functions on Anonymous Networks.
201-214 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BoldiV97">BibTeX</a></font>
<li><a name="NarayananS97" href="../../indices/a-tree/n/Narayanan:Lata.html">Lata Narayanan</a>, <a href="../../indices/a-tree/s/Shende:Sunil_M=.html">Sunil M. Shende</a>:
Static Frequency Assignment in Cellular Networks.
215-227 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/NarayananS97">BibTeX</a></font>
<li><a name="FeighelsteinZ97" href="../../indices/a-tree/f/Feighelstein:Marcelo.html">Marcelo Feighelstein</a>, <a href="../../indices/a-tree/z/Zaks:Shmuel.html">Shmuel Zaks</a>:
Duality in Chain ATM Virtual Path Layouts.
228-239 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FeighelsteinZ97">BibTeX</a></font>
<li><a name="FraigniaudV97" href="../../indices/a-tree/f/Fraigniaud:Pierre.html">Pierre Fraigniaud</a>, <a href="../../indices/a-tree/v/Vial:Sandrine.html">Sandrine Vial</a>:
Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks.
240-252 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FraigniaudV97">BibTeX</a></font>
<li><a name="SochT97" 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>:
Optimal gossip in noncombining 2D-meshes.
253-265 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SochT97">BibTeX</a></font>
<li><a name="FatourouMS97" 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>:
Advances in Rate-Based Flow Control.
266-281 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FatourouMS97">BibTeX</a></font>
<li><a name="Rosenberg97" href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>:
Theoretical research on networks: models and methodology.
282-293 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Rosenberg97">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
