Analysis of randomized protocols for conflict-free distributed access
From MaRDI portal
Publication:2461541
Recommendations
Cites work
- A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
- A decentralized algorithm for spectral analysis
- A perspective on multiaccess channels
- Analysis of Backoff Protocols for Multiple Access Channels
- Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
- Balanced Allocations
- Balls and bins: A study in negative dependence
- Contention resolution with constant expected delay
- Distributed Computing: A Locality-Sensitive Approach
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 2080510 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 1405893 (Why is no real title available?)
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- Probability and Computing
- Randomized broadcast in networks
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
- Spatial gossip and resource location protocols
- Stochastic Contention Resolution With Short Delays
Cited in
(3)
This page was built for publication: Analysis of randomized protocols for conflict-free distributed access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461541)