Asynchronous Shared Channel
From MaRDI portal
Publication:5368991
DOI10.1145/3087801.3087831zbMath1380.68420MaRDI QIDQ5368991
Grzegorz Stachowiak, Gianluca De Marco
Publication date: 11 October 2017
Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3087801.3087831
lower bound; randomized algorithms; distributed algorithms; multiple-access channel; contention resolution; shared channel
68M14: Distributed systems
68W20: Randomized algorithms
94A40: Channel models (including quantum) in information and communication theory
68W15: Distributed algorithms
Related Items
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses, Subquadratic non-adaptive threshold group testing, Optimal channel utilization with limited feedback, Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election, Restrained medium access control on adversarial shared channels, Singletons for simpletons revisiting windowed backoff with Chernoff bounds, Windowed backoff algorithms for WiFi: theory and performance under batched arrivals, Counting in one-hop beeping networks, Deterministic non-adaptive contention resolution on a shared channel