3. SIROCCO 1996: Certosa di Pontignano, Siena, Italy

@proceedings{DBLP: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}
}

• Evangelos Kranakis: Invited Talk: Symmetry and Computability in Anonymous Networks. 1-16 BibTeX
• Bernard Mans: Optimal Distributed Algorithms in Unlabelled Tori and Chordal Rings. 17-31 BibTeX
• Paola Flocchini, Alessandro Roncato: Computing on Anonymous Networks with Sense of Direction. 32-46 BibTeX
• Paolo Boldi, Sebastiano Vigna: Good Fibrations and Other Construction Which Preserve Sense of Direction. 47-58 BibTeX
• Joffroy Beauquier, Oliver Debas, Synnöve Kekkonen-Moneta: Fault-Tolerant and Self-Stabilizing Ring Orientation. 59-72 BibTeX
• Lata Narayanan, Sunil M. Shende: Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes. 73-87 BibTeX
• Cyril Gavoille, Stephane Perennes: Lower Bounds for Shortest Path Interval Routing. 88-103 BibTeX
• Lata Narayanan, Naomi Nishimura: Interval Routing on k-trees. 104-118 BibTeX
• Evangelos Kranakis, Danny Krizanc: Boolean Routing on Cayley Networks. 119-124 BibTeX
• Mariana Kant-Antonescu: Boolean Routing on Cube Networks. 125-140 BibTeX
• Gabriele Di Stefano: A Routing Algorithm for Networks Based on Distance-Hereditary Topologies. 141-151 BibTeX
• David Peleg: Majority Voting, Coalitions and Monopolies in Graphs. 152-169 BibTeX
• Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes: Tight Bounds on the Size of 2-Monopolies. 170-179 BibTeX
• Rabah Harbane, Carles Padró: Spanners of Underlying Graphs of Iterated Line Digraphs. 180-194 BibTeX
• Pilar de la Torre, Clyde P. Kruskal: Exact Bandwith of Parallel-Processor Networks. 195-209 BibTeX
• Eckehart Hotzel: Full Access Networks of Small Size. 210-223 BibTeX
• Esther Jennings, Lenka Motyckova: Distributed Computation and Incremental Maintainance of 3-Edge-Connected Components. 224-240 BibTeX
• Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau: Emulating Networks by Bus Networks: Application to Trees and Hypermeshes. 241-254 BibTeX
• Pavel Tvrdík: Necklace-based Factorization of de Bruijn Digraphs. 255-168 BibTeX
• Ladislav Stacho, Imrich Vrto: Virtual Path Layout for Some Bounded Degree Networks. 269-178 BibTeX
• Alessandro Roncato, Walter Unger: Systolic Gossip in Complete Trees. 279-291 BibTeX
• Andrzej Pelc: Efficient fault location with small risk. 292-300 BibTeX
• Derek Hing-leung Ngok, Shmuel Zaks: On the Power of Local Information in Scheduling in Synchronous Networks. 301-312 BibTeX
• Ichiro Suzuki, Masafumi Yamashita: Distributed Anonymous Mobile Robots. 313-330 BibTeX