Recommendations
- Broadcasting on networks of workstations
- scientific article; zbMATH DE number 910916
- scientific article; zbMATH DE number 4102999
- Broadcasting in the butterfly network
- Liveness in broadcast networks
- Scheduling in broadcast networks
- Data transfers in broadcast networks
- scientific article; zbMATH DE number 3884101
- Broadcasting in dynamic radio networks
- Broadcast MSCs
Cites work
- A better wake-up in radio networks
- A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- A perspective on multiaccess channels
- An \Omega(D\log (N/D)) Lower Bound for Broadcast in Radio Networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Analysis of Backoff Protocols for Multiple Access Channels
- Broadcasting spanning forests on a multiple-access channel
- Contention resolution with constant expected delay
- Development of the ALOHANET
- Efficient algorithms for leader election in radio networks
- Efficient gossip and robust distributed computation
- Efficient parallel algorithms can be made robust
- scientific article; zbMATH DE number 1696663 (Why is no real title available?)
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1306905 (Why is no real title available?)
- scientific article; zbMATH DE number 1033646 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 1979510 (Why is no real title available?)
- scientific article; zbMATH DE number 1979528 (Why is no real title available?)
- scientific article; zbMATH DE number 2006650 (Why is no real title available?)
- scientific article; zbMATH DE number 2013838 (Why is no real title available?)
- scientific article; zbMATH DE number 1857647 (Why is no real title available?)
- scientific article; zbMATH DE number 2119730 (Why is no real title available?)
- Knowledge and common knowledge in a distributed environment
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- On selection problem in radio networks
- Performing Work Efficiently in the Presence of Faults
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- Randomization helps to perform independent tasks reliably
- Stochastic Contention Resolution With Short Delays
- The Do-All problem with Byzantine processor failures
- The wakeup problem in synchronous broadcast systems
- Time-optimal message-efficient work performance in the presence of faults
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
Cited in
(9)- A robust randomized algorithm to perform independent tasks
- Ordered and delayed adversaries and how to work against them on a shared channel
- Maximum throughput of multiple access channels in adversarial environments
- Adversarial multiple access channels with individual injection rates
- Performing Work Efficiently in the Presence of Faults
- Randomization helps to perform independent tasks reliably
- Doing-it-all with bounded work and communication
- Performing work efficiently in the presence of faults
- Monitoring churn in wireless networks
This page was built for publication: Performing work in broadcast networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375307)
