↓ Skip to main content

Structural Information and Communication Complexity

Overview of attention for book
Cover of 'Structural Information and Communication Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Traffic Grooming in a Passive Star WDM Network
  3. Altmetric Badge
    Chapter 2 The Price of Anarchy in All-Optical Networks
  4. Altmetric Badge
    Chapter 3 Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks
  5. Altmetric Badge
    Chapter 4 Path Layout on Tree Networks: Bounds in Different Label Switching Models
  6. Altmetric Badge
    Chapter 5 On Approximability of the Independent Set Problem for Low Degree Graphs
  7. Altmetric Badge
    Chapter 6 Asynchronous Broadcast in Radio Networks
  8. Altmetric Badge
    Chapter 7 Two-Hop Virtual Path Layout in Tori
  9. Altmetric Badge
    Chapter 8 Robot Convergence via Center-of-Gravity Algorithms
  10. Altmetric Badge
    Chapter 9 F-Chord: Improved Uniform Routing on Chord
  11. Altmetric Badge
    Chapter 10 Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor
  12. Altmetric Badge
    Chapter 11 Improved Bounds for Optimal Black Hole Search with a Network Map
  13. Altmetric Badge
    Chapter 12 Sparse Additive Spanners for Bounded Tree-Length Graphs
  14. Altmetric Badge
    Chapter 13 No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes
  15. Altmetric Badge
    Chapter 14 Existence of Nash Equilibria in Selfish Routing Problems
  16. Altmetric Badge
    Chapter 15 Mobile Agents Rendezvous When Tokens Fail
  17. Altmetric Badge
    Chapter 16 Time Efficient Gossiping in Known Radio Networks
  18. Altmetric Badge
    Chapter 17 Long-Lived Rambo: Trading Knowledge for Communication
  19. Altmetric Badge
    Chapter 18 Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach
  20. Altmetric Badge
    Chapter 19 Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks
  21. Altmetric Badge
    Chapter 20 Perfect Token Distribution on Trees
  22. Altmetric Badge
    Chapter 21 Approximation Algorithm for Hotlink Assignment in the Greedy Model
  23. Altmetric Badge
    Chapter 22 Optimal Decision Strategies in Byzantine Environments
  24. Altmetric Badge
    Chapter 23 Sharing the Cost of Multicast Transmissions in Wireless Networks
  25. Altmetric Badge
    Chapter 24 NP-Completeness Results for All-Shortest-Path Interval Routing
  26. Altmetric Badge
    Chapter 25 On-Line Scheduling of Parallel Jobs
  27. Altmetric Badge
    Chapter 26 The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
3 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Structural Information and Communication Complexity
Published by
Springer, Berlin, Heidelberg, January 2004
DOI 10.1007/b98251
ISBNs
978-3-54-022230-9, 978-3-54-027796-5
Editors

Ratislav Královic̆, Ondrej Sýkora

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 33%
Lecturer 1 33%
Unknown 1 33%
Readers by discipline Count As %
Mathematics 1 33%
Agricultural and Biological Sciences 1 33%
Unknown 1 33%