Structural information and communication complexity

Structural information and communication complexity

Join Readfeed freeFind clubs reading this bookBrowse readable books
About
Structural Information and Communication Complexity: 11th International Colloquium, SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004. Proceedings
Author: Ratislav Královic̆, Ondrej Sýkora
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-22230-9
DOI: 10.1007/b98251

Table of Contents:

  • Traffic Grooming in a Passive Star WDM Network
  • The Price of Anarchy in All-Optical Networks
  • Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks
  • Path Layout on Tree Networks: Bounds in Different Label Switching Models
  • On Approximability of the Independent Set Problem for Low Degree Graphs
  • Asynchronous Broadcast in Radio Networks
  • Two-Hop Virtual Path Layout in Tori
  • Robot Convergence via Center-of-Gravity Algorithms
  • F-Chord: Improved Uniform Routing on Chord
  • Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor
  • Improved Bounds for Optimal Black Hole Search with a Network Map
  • Sparse Additive Spanners for Bounded Tree-Length Graphs
  • No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes
  • Existence of Nash Equilibria in Selfish Routing Problems
  • Mobile Agents Rendezvous When Tokens Fail
  • Time Efficient Gossiping in Known Radio Networks
  • Long-Lived Rambo: Trading Knowledge for Communication
  • Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach
  • Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks
  • Perfect Token Distribution on Trees

Discuss Structural information and communication complexity with other readers

Join or start a book club for Structural information and communication complexity on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Structural information and communication complexity?

Sign up free on Readfeed, then browse public clubs or start your own club with Structural information and communication complexity as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Structural information and communication complexity with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Structural information and communication complexity with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.