sirocco1996.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 1996</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>3. <a href="index.html">SIROCCO</a> 1996:
Certosa di Pontignano,
Siena,
Italy</h1> <a name="1996" href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a> (Eds.):
SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity, Siena, Italy, June 6-8, 1996.
Carleton Scientific 1996 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/1996">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/sirocco/1996,
editor = {Nicola Santoro and
Paul G. Spirakis},
title = {SIROCCO'96, The 3rd International Colloquium on Structural Information
{\&} Communication Complexity, Siena, Italy, June 6-8, 1996},
booktitle = {SIROCCO},
publisher = {Carleton Scientific},
year = {1996},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
<ul>
<li><a name="Kranakis96" href="../../indices/a-tree/k/Kranakis:Evangelos.html">Evangelos Kranakis</a>:
Invited Talk: Symmetry and Computability in Anonymous Networks.
1-16 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Kranakis96">BibTeX</a></font>
<li><a name="Mans96" href="../../indices/a-tree/m/Mans:Bernard.html">Bernard Mans</a>:
Optimal Distributed Algorithms in Unlabelled Tori and Chordal Rings.
17-31 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Mans96">BibTeX</a></font>
<li><a name="FlocchiniR96" href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a href="../../indices/a-tree/r/Roncato:Alessandro.html">Alessandro Roncato</a>:
Computing on Anonymous Networks with Sense of Direction.
32-46 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FlocchiniR96">BibTeX</a></font>
<li><a name="BoldiV96" href="../../indices/a-tree/b/Boldi:Paolo.html">Paolo Boldi</a>, <a href="../../indices/a-tree/v/Vigna:Sebastiano.html">Sebastiano Vigna</a>:
Good Fibrations and Other Construction Which Preserve Sense of Direction.
47-58 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BoldiV96">BibTeX</a></font>
<li><a name="BeauquierDK96" href="../../indices/a-tree/b/Beauquier:Joffroy.html">Joffroy Beauquier</a>, <a href="../../indices/a-tree/d/Debas:Oliver.html">Oliver Debas</a>, <a href="../../indices/a-tree/k/Kekkonen=Moneta:Synn=ouml=ve.html">Synnöve Kekkonen-Moneta</a>:
Fault-Tolerant and Self-Stabilizing Ring Orientation.
59-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BeauquierDK96">BibTeX</a></font>
<li><a name="NarayananS96" 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>:
Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes.
73-87 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/NarayananS96">BibTeX</a></font>
<li><a name="GavoilleP96" href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>, <a href="../../indices/a-tree/p/Perennes:Stephane.html">Stephane Perennes</a>:
Lower Bounds for Shortest Path Interval Routing.
88-103 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GavoilleP96">BibTeX</a></font>
<li><a name="NarayananN96" href="../../indices/a-tree/n/Narayanan:Lata.html">Lata Narayanan</a>, <a href="../../indices/a-tree/n/Nishimura:Naomi.html">Naomi Nishimura</a>:
Interval Routing on <i>k</i>-trees.
104-118 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/NarayananN96">BibTeX</a></font>
<li><a name="KranakisK96" href="../../indices/a-tree/k/Kranakis:Evangelos.html">Evangelos Kranakis</a>, <a href="../../indices/a-tree/k/Krizanc:Danny.html">Danny Krizanc</a>:
Boolean Routing on Cayley Networks.
119-124 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KranakisK96">BibTeX</a></font>
<li><a name="Kant-Antonescu96" href="../../indices/a-tree/k/Kant=Antonescu:Mariana.html">Mariana Kant-Antonescu</a>:
Boolean Routing on Cube Networks.
125-140 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Kant-Antonescu96">BibTeX</a></font>
<li><a name="Stefano96" href="../../indices/a-tree/s/Stefano:Gabriele_Di.html">Gabriele Di Stefano</a>:
A Routing Algorithm for Networks Based on Distance-Hereditary Topologies.
141-151 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Stefano96">BibTeX</a></font>
<li><a name="Peleg96" href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>:
Majority Voting, Coalitions and Monopolies in Graphs.
152-169 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Peleg96">BibTeX</a></font>
<li><a name="BermondBPP96" href="../../indices/a-tree/b/Bermond:Jean=Claude.html">Jean-Claude Bermond</a>, <a href="../../indices/a-tree/b/Bond:Johny.html">Johny Bond</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>, <a href="../../indices/a-tree/p/Perennes:Stephane.html">Stephane Perennes</a>:
Tight Bounds on the Size of 2-Monopolies.
170-179 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BermondBPP96">BibTeX</a></font>
<li><a name="HarbaneP96" href="../../indices/a-tree/h/Harbane:Rabah.html">Rabah Harbane</a>, <a href="../../indices/a-tree/p/Padr=oacute=:Carles.html">Carles Padró</a>:
Spanners of Underlying Graphs of Iterated Line Digraphs.
180-194 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/HarbaneP96">BibTeX</a></font>
<li><a name="TorreK96" href="../../indices/a-tree/t/Torre:Pilar_de_la.html">Pilar de la Torre</a>, <a href="../../indices/a-tree/k/Kruskal:Clyde_P=.html">Clyde P. Kruskal</a>:
Exact Bandwith of Parallel-Processor Networks.
195-209 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/TorreK96">BibTeX</a></font>
<li><a name="Hotzel96" href="../../indices/a-tree/h/Hotzel:Eckehart.html">Eckehart Hotzel</a>:
Full Access Networks of Small Size.
210-223 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Hotzel96">BibTeX</a></font>
<li><a name="JenningsM96" href="../../indices/a-tree/j/Jennings:Esther.html">Esther Jennings</a>, <a href="../../indices/a-tree/m/Motyckova:Lenka.html">Lenka Motyckova</a>:
Distributed Computation and Incremental Maintainance of 3-Edge-Connected Components.
224-240 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/JenningsM96">BibTeX</a></font>
<li><a name="BarthGHS96" href="../../indices/a-tree/b/Barth:Dominique.html">Dominique Barth</a>, <a href="../../indices/a-tree/g/Germa:Anne.html">Anne Germa</a>, <a href="../../indices/a-tree/h/Heydemann:Marie=Claude.html">Marie-Claude Heydemann</a>, <a href="../../indices/a-tree/s/Sotteau:Dominique.html">Dominique Sotteau</a>:
Emulating Networks by Bus Networks: Application to Trees and Hypermeshes.
241-254 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BarthGHS96">BibTeX</a></font>
<li><a name="Tvrdik96" href="../../indices/a-tree/t/Tvrd=iacute=k:Pavel.html">Pavel Tvrdík</a>:
Necklace-based Factorization of de Bruijn Digraphs.
255-168 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Tvrdik96">BibTeX</a></font>
<li><a name="StachoV96" href="../../indices/a-tree/s/Stacho:Ladislav.html">Ladislav Stacho</a>, <a href="../../indices/a-tree/v/Vrto:Imrich.html">Imrich Vrto</a>:
Virtual Path Layout for Some Bounded Degree Networks.
269-178 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/StachoV96">BibTeX</a></font>
<li><a name="RoncatoU96" href="../../indices/a-tree/r/Roncato:Alessandro.html">Alessandro Roncato</a>, <a href="../../indices/a-tree/u/Unger:Walter.html">Walter Unger</a>:
Systolic Gossip in Complete Trees.
279-291 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/RoncatoU96">BibTeX</a></font>
<li><a name="Pelc96" href="../../indices/a-tree/p/Pelc:Andrzej.html">Andrzej Pelc</a>:
Efficient fault location with small risk.
292-300 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Pelc96">BibTeX</a></font>
<li><a name="NgokZ96" href="../../indices/a-tree/n/Ngok:Derek_Hing=leung.html">Derek Hing-leung Ngok</a>, <a href="../../indices/a-tree/z/Zaks:Shmuel.html">Shmuel Zaks</a>:
On the Power of Local Information in Scheduling in Synchronous Networks.
301-312 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/NgokZ96">BibTeX</a></font>
<li><a name="SuzukiY96" href="../../indices/a-tree/s/Suzuki:Ichiro.html">Ichiro Suzuki</a>, <a href="../../indices/a-tree/y/Yamashita:Masafumi.html">Masafumi Yamashita</a>:
Distributed Anonymous Mobile Robots.
313-330 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/SuzukiY96">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
