Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Structural Information and Communication Complexity

11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Ratislav Královic̆

    1. Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Research partially funded by grant APVV, Bratislava, Slovakia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ondrej Sýkora

    1. Department of Computer Science, University of Loughborough, Loughborough, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: SIROCCO 2004.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (26 papers)

  1. Front Matter

    Download chapter PDF

  2. Traffic Grooming in a Passive Star WDM Network

    • Eric Angel, Evripidis Bampis, Fanny Pascual
    Pages 1-12

  3. The Price of Anarchy in All-Optical Networks

    • Vittorio Bilò, Luca Moscardelli
    Pages 13-22

  4. Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks

    • Paul Boone, Edgar Chavez, Lev Gleitzky, Evangelos Kranakis, Jaroslav Opatrny, Gelasio Salazar et al.
    Pages 23-34

  5. Path Layout on Tree Networks: Bounds in Different Label Switching Models

    • Anat Bremler-Barr, Leah Epstein
    Pages 35-46

  6. On Approximability of the Independent Set Problem for Low Degree Graphs

    • Miroslav Chlebík, Janka Chlebíková
    Pages 47-56

  7. Asynchronous Broadcast in Radio Networks

    • Bogdan S. Chlebus, Mariusz A. Rokicki
    Pages 57-68

  8. Two-Hop Virtual Path Layout in Tori

    • Sébastien Choplin, Lata Narayanan, Jaroslav Opatrny
    Pages 69-78

  9. Robot Convergence via Center-of-Gravity Algorithms

    • Reuven Cohen, David Peleg
    Pages 79-88

  10. F-Chord: Improved Uniform Routing on Chord

    • Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano
    Pages 89-98

  11. Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor

    • Aleksej Di Salvo, Guido Proietti
    Pages 99-110

  12. Improved Bounds for Optimal Black Hole Search with a Network Map

    • Stefan Dobrev, Paola Flocchini, Nicola Santoro
    Pages 111-122

  13. Sparse Additive Spanners for Bounded Tree-Length Graphs

    • Yon Dourisboure, Cyril Gavoille
    Pages 123-137

  14. No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes

    • Guillaume Fertin, André Raspaud, Ondrej Sýkora
    Pages 138-148

  15. Existence of Nash Equilibria in Selfish Routing Problems

    • Alessandro Ferrante, Mimmo Parente
    Pages 149-160

  16. Mobile Agents Rendezvous When Tokens Fail

    • Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio, Nicola Santoro, Cindy Sawchuk
    Pages 161-172

  17. Time Efficient Gossiping in Known Radio Networks

    • Leszek Gąsieniec, Igor Potapov, Qin Xin
    Pages 173-184

  18. Long-Lived Rambo: Trading Knowledge for Communication

    • Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman
    Pages 185-196

  19. Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach

    • Arvind Gupta, Ján Maňuch, Ladislav Stacho
    Pages 197-208

  20. Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks

    • Flaminia L. Luccio, Jop F. Sibeyn
    Pages 209-220
Back to top

Other volumes

  1. Structural Information and Communication Complexity

Editors and Affiliations

  • Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Research partially funded by grant APVV, Bratislava, Slovakia

    Ratislav Královic̆

  • Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation