Structural Information and Communication Complexity

13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006. Proceedings

  • Paola Flocchini
  • Leszek Gąsieniec
Conference proceedings SIROCCO 2006

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4056)

Table of contents

  1. Front Matter
  2. Evangelos Kranakis, Danny Krizanc, Sergio Rajsbaum
    Pages 1-9
  3. Reuven Cohen, David Peleg
    Pages 29-43
  4. Dariusz R. Kowalski, Adam Malinowski
    Pages 44-58
  5. Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
    Pages 70-84
  6. Jérémie Chalopin
    Pages 85-99
  7. Bilel Derbel, Cyril Gavoille
    Pages 100-114
  8. Jaap-Henk Hoepman, Shay Kutten, Zvi Lotker
    Pages 115-129
  9. Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
    Pages 143-156
  10. Nicolas Thibault, Christian Laforest
    Pages 157-170
  11. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
    Pages 171-181
  12. Philippe Raïpin Parvédy, Michel Raynal, Corentin Travers
    Pages 182-196
  13. Stefan Dobrev, Rastislav Královič, Richard Královič, Nicola Santoro
    Pages 197-211
  14. Mikhail Nesterenko, Sébastien Tixeuil
    Pages 212-226
  15. Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
    Pages 227-239
  16. Alfredo Navarra
    Pages 240-252

About these proceedings

Keywords

Broadcast Roadcasting Routing ad-hoc networks algorithm algorithms combinatorial optimization complexity computer communication networks consens algorithms distributed computing gossiping graph algorithms netw network computing

Editors and affiliations

  • Paola Flocchini
    • 1
  • Leszek Gąsieniec
    • 2
  1. 1.SITE, University of OttawaCanada
  2. 2.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK

Bibliographic information

  • DOI https://doi.org/10.1007/11780823
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-35474-1
  • Online ISBN 978-3-540-35475-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book