↓ Skip to main content
What is this page? Embed badge

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 How Many Cooks Spoil the Soup?
  3. Altmetric Badge
    Chapter 2 Dynamic Networks of Finite State Machines
  4. Altmetric Badge
    Chapter 3 Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
  5. Altmetric Badge
    Chapter 4 Fooling Pairs in Randomized Communication Complexity
  6. Altmetric Badge
    Chapter 5 Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity
  7. Altmetric Badge
    Chapter 6 Message Lower Bounds via Efficient Network Synchronization
  8. Altmetric Badge
    Chapter 7 Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
  9. Altmetric Badge
    Chapter 8 Asynchronous Coordination Under Preferences and Constraints
  10. Altmetric Badge
    Chapter 9 Concurrent Use of Write-Once Memory
  11. Altmetric Badge
    Chapter 10 In the Search for Optimal Concurrency
  12. Altmetric Badge
    Chapter 11 The F-Snapshot Problem
  13. Altmetric Badge
    Chapter 12 t-Resilient Immediate Snapshot Is Impossible
  14. Altmetric Badge
    Chapter 13 Linear Search by a Pair of Distinct-Speed Robots
  15. Altmetric Badge
    Chapter 14 Deterministic Meeting of Sniffing Agents in the Plane
  16. Altmetric Badge
    Chapter 15 Distributed Evacuation in Graphs with Multiple Exits
  17. Altmetric Badge
    Chapter 16 Universal Systems of Oblivious Mobile Robots
  18. Altmetric Badge
    Chapter 17 Collaborative Delivery with Energy-Constrained Mobile Robots
  19. Altmetric Badge
    Chapter 18 Communication Problems for Mobile Agents Exchanging Energy
  20. Altmetric Badge
    Chapter 19 Asynchronous Broadcasting with Bivalent Beeps
  21. Altmetric Badge
    Chapter 20 Sparsifying Congested Cliques and Core-Periphery Networks
  22. Altmetric Badge
    Chapter 21 Rumor Spreading with Bounded In-Degree
  23. Altmetric Badge
    Chapter 22 Whom to Befriend to Influence People
  24. Altmetric Badge
    Chapter 23 Approximating the Size of a Radio Network in Beeping Model
  25. Altmetric Badge
    Chapter 24 An Approximation Algorithm for Path Computation and Function Placement in SDNs
  26. Altmetric Badge
    Chapter 25 Transiently Consistent SDN Updates: Being Greedy is Hard
Attention for Chapter 19: Asynchronous Broadcasting with Bivalent Beeps
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
3 Mendeley
Summary Dimensions citations
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
Asynchronous Broadcasting with Bivalent Beeps
Chapter number 19
Book title
Structural Information and Communication Complexity
Published by
Springer, Cham, July 2016
DOI 10.1007/978-3-319-48314-6_19
Book ISBNs
978-3-31-948313-9, 978-3-31-948314-6
Authors

Kokouvi Hounkanli, Andrzej Pelc

View on publisher site
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 %
Student > Ph. D. Student 2 67%
Student > Master 1 33%
Readers by discipline Count As %
Computer Science 3 100%

This page is provided by Altmetric.