↓ 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 A Topological Perspective on Distributed Network Algorithms
  3. Altmetric Badge
    Chapter 2 On Sense of Direction and Mobile Agents
  4. Altmetric Badge
    Chapter 3 Locality of Not-so-Weak Coloring
  5. Altmetric Badge
    Chapter 4 Near-Gathering of Energy-Constrained Mobile Agents
  6. Altmetric Badge
    Chapter 5 Optimal Multi-broadcast with Beeps Using Group Testing
  7. Altmetric Badge
    Chapter 6 Tracking Routes in Communication Networks
  8. Altmetric Badge
    Chapter 7 Positional Encoding by Robots with Non-rigid Movements
  9. Altmetric Badge
    Chapter 8 Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights
  10. Altmetric Badge
    Chapter 9 Breaking the Linear-Memory Barrier in $$\mathsf {MPC}$$ : Fast $$\mathsf {MIS}$$ on Trees with Strongly Sublinear Memory
  11. Altmetric Badge
    Chapter 10 Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents
  12. Altmetric Badge
    Chapter 11 Asynchronous Rendezvous with Different Maps
  13. Altmetric Badge
    Chapter 12 Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies
  14. Altmetric Badge
    Chapter 13 Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
  15. Altmetric Badge
    Chapter 14 Evacuating Two Robots from a Disk: A Second Cut
  16. Altmetric Badge
    Chapter 15 Distributed Pattern Formation in a Ring
  17. Altmetric Badge
    Chapter 16 On Distributed Merlin-Arthur Decision Protocols
  18. Altmetric Badge
    Chapter 17 Anonymous Read/Write Memory: Leader Election and De-anonymization
  19. Altmetric Badge
    Chapter 18 Faster Construction of Overlay Networks
  20. Altmetric Badge
    Chapter 19 Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings
  21. Altmetric Badge
    Chapter 20 Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects
  22. Altmetric Badge
    Chapter 21 Making Randomized Algorithms Self-stabilizing
  23. Altmetric Badge
    Chapter 22 How to Color a French Flag
  24. Altmetric Badge
    Chapter 23 Self-adjusting Linear Networks
  25. Altmetric Badge
    Chapter 24 Mutual Visibility for Asynchronous Robots
  26. Altmetric Badge
    Chapter 25 Infinite Grid Exploration by Disoriented Robots
  27. Altmetric Badge
    Chapter 26 A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
  28. Altmetric Badge
    Chapter 27 Mobile Robots with Uncertain Visibility Sensors
  29. Altmetric Badge
    Chapter 28 A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault
  30. Altmetric Badge
    Chapter 29 Explicit and Tight Bounds of the Convergence Time of Average-Based Population Protocols
  31. Altmetric Badge
    Chapter 30 Visiting Infinitely Often the Unit Interval While Minimizing the Idle Time of High Priority Segments
Attention for Chapter 5: Optimal Multi-broadcast with Beeps Using Group Testing
Altmetric Badge
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.
Chapter title
Optimal Multi-broadcast with Beeps Using Group Testing
Chapter number 5
Book title
Structural Information and Communication Complexity
Published by
Springer, Cham, July 2019
DOI 10.1007/978-3-030-24922-9_5
Book ISBNs
978-3-03-024921-2, 978-3-03-024922-9
Authors

Joffroy Beauquier, Janna Burman, Peter Davies, Fabien Dufoulon, Beauquier, Joffroy, Burman, Janna, Davies, Peter, Dufoulon, Fabien