sirocco1995.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 1995</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>2. <a href="index.html">SIROCCO</a> 1995: Olympia, Greece</h1> <a name="1995" href="../../indices/a-tree/k/Kirousis:Lefteris_M=.html">Lefteris M. Kirousis</a>, <a href="../../indices/a-tree/k/Kaklamanis:Christos.html">Christos Kaklamanis</a> (Eds.): Structure, Information and Communication Complexity, SIROCCO '95, Proceedings of the 2nd Colloquium on Structural Information and Communication Complexity, Olympia Greece, June 12-14, 1995. Proceedings in Informatics 2 Carleton Scientific 1996 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/1995">BibTeX</a></font> <ul> <li><a name="IanniFFS95" href="../../indices/a-tree/i/Ianni:Miriam_Di.html">Miriam Di Ianni</a>, <a href="../../indices/a-tree/f/Flammini:Michele.html">Michele Flammini</a>, <a href="../../indices/a-tree/f/Flammini:Rossella.html">Rossella Flammini</a>, <a href="../../indices/a-tree/s/Salomone:Sandro.html">Sandro Salomone</a>: Systolic Acyclic Orientations for Deadlock Prevention. 1-12 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/IanniFFS95">BibTeX</a></font> <li><a name="FlocchiniMS95" href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a href="../../indices/a-tree/m/Mans:Bernard.html">Bernard Mans</a>, <a href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>: Translation Capabilities of Sense of Direction. 13-25 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FlocchiniMS95">BibTeX</a></font> <li><a name="FlocchiniS95" href="../../indices/a-tree/f/Flocchini:Paola.html">Paola Flocchini</a>, <a href="../../indices/a-tree/s/Santoro:Nicola.html">Nicola Santoro</a>: Topological Constraints for Sense of Direction. 27-38 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/FlocchiniS95">BibTeX</a></font> <li><a name="BoldiV95" href="../../indices/a-tree/b/Boldi:Paolo.html">Paolo Boldi</a>, <a href="../../indices/a-tree/v/Vigna:Sebastiano.html">Sebastiano Vigna</a>: On the Complexity of Deciding Sense of Direction. 39-51 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BoldiV95">BibTeX</a></font> <li><a name="Norris95" href="../../indices/a-tree/n/Norris:Nancy.html">Nancy Norris</a>: Computing Functions on Partially Wireless Networks. 53-64 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Norris95">BibTeX</a></font> <li><a name="Roncato95" href="../../indices/a-tree/r/Roncato:Alessandro.html">Alessandro Roncato</a>: Gap Theorems for Anonymous Rings. 65-76 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Roncato95">BibTeX</a></font> <li><a name="VerweijT95" href="../../indices/a-tree/v/Verweij:Bram.html">Bram Verweij</a>, <a href="../../indices/a-tree/t/Tel:Gerard.html">Gerard Tel</a>: A Monte Carlo Algorithm for Election. 77-88 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/VerweijT95">BibTeX</a></font> <li><a name="KrizancL95" href="../../indices/a-tree/k/Krizanc:Danny.html">Danny Krizanc</a>, <a href="../../indices/a-tree/l/Luccio:Flaminia_L=.html">Flaminia L. Luccio</a>: Boolean Routing on Chordal Rings. 89-100 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KrizancL95">BibTeX</a></font> <li><a name="KranakisKU95" href="../../indices/a-tree/k/Kranakis:Evangelos.html">Evangelos Kranakis</a>, <a href="../../indices/a-tree/k/Krizanc:Danny.html">Danny Krizanc</a>, <a href="../../indices/a-tree/u/Urrutia:Jorge.html">Jorge Urrutia</a>: Implicit Routing and Shortest Path Information (Extended Abstract). 101-112 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KranakisKU95">BibTeX</a></font> <li><a name="GavoilleG95" href="../../indices/a-tree/g/Gavoille:Cyril.html">Cyril Gavoille</a>, <a href="../../indices/a-tree/g/Gu=eacute=vremont:Eric.html">Eric Guévremont</a>: On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing. 113-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/GavoilleG95">BibTeX</a></font> <li><a name="TseL95" 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>: Lower Bounds for Multi-label Interval Routing. 123-134 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/TseL95">BibTeX</a></font> <li><a name="VounckxDL95" href="../../indices/a-tree/v/Vounckx:Johan.html">Johan Vounckx</a>, <a href="../../indices/a-tree/d/Deconinck:Geert.html">Geert Deconinck</a>, <a href="../../indices/a-tree/l/Lauwereins:Rudy.html">Rudy Lauwereins</a>: A Compact Fault-tolerant, Deadlock-free, Minimal Routing Algorithm for n-Dimensional Wormhole Switching Based Meshes. 135-146 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/VounckxDL95">BibTeX</a></font> <li><a name="KaraivazoglouST95" href="../../indices/a-tree/k/Karaivazoglou:Efstratios.html">Efstratios Karaivazoglou</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>, <a href="../../indices/a-tree/t/Triantafilou:Vasilis.html">Vasilis Triantafilou</a>: Wormhole Routing Simulation on a Mesh. 147-158 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/KaraivazoglouST95">BibTeX</a></font> <li><a name="Pelc95" href="../../indices/a-tree/p/Pelc:Andrzej.html">Andrzej Pelc</a>: Fast Fault-tolerant Broadcasting and Gossiping. 159-172 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/Pelc95">BibTeX</a></font> <li><a name="BermondP95" href="../../indices/a-tree/b/Bermond:Jean=Claude.html">Jean-Claude Bermond</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>: The Power of Small Coalitions in Graphs. 173-184 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BermondP95">BibTeX</a></font> <li><a name="DendrisK95" href="../../indices/a-tree/d/Dendris:Nick_D=.html">Nick D. Dendris</a>, <a href="../../indices/a-tree/k/Kirousis:Lefteris_M=.html">Lefteris M. Kirousis</a>: Linear-time Parallel Arc Consistency with Reduced Communication Requirements. 185-198 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/DendrisK95">BibTeX</a></font> <li><a name="BermondP95a" href="../../indices/a-tree/b/Bermond:Jean=Claude.html">Jean-Claude Bermond</a>, <a href="../../indices/a-tree/p/Perennes:Stephane.html">Stephane Perennes</a>: Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. 199-209 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/BermondP95a">BibTeX</a></font> <li><a name="RolimTTV95" href="../../indices/a-tree/r/Rolim:Jos=eacute=_D=_P=.html">José D. P. Rolim</a>, <a href="../../indices/a-tree/t/Tvrd=iacute=k:Pavel.html">Pavel Tvrdík</a>, <a href="../../indices/a-tree/t/Trdlicka:Jan.html">Jan Trdlicka</a>, <a href="../../indices/a-tree/v/Vrto:Imrich.html">Imrich Vrto</a>: Bisecting de Bruijn and Kautz Graphs. 211-222 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/sirocco/RolimTTV95">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
