A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
From MaRDI portal
Publication:3765234
DOI10.1145/3828.214125zbMath0628.68026OpenAlexW2036925455MaRDI QIDQ3765234
Albert G. Greenberg, Shmuel Winograd
Publication date: 1985
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3828.214125
Related Items (33)
Generalized framework for group testing: queries, feedbacks and adversaries ⋮ Performing work in broadcast networks ⋮ Deterministic multi-channel information exchange ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ Adversarial multiple access channels with individual injection rates ⋮ Unbounded contention resolution in multiple-access channels ⋮ Faster deterministic wakeup in multiple access channels ⋮ Leader election in ad hoc radio networks: a keen ear helps ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Applications of coding theory to communication combinatorial problems ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Contention resolution under selfishness ⋮ A lower bound for communication on the crossbar ⋮ Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness ⋮ Randomized mutual exclusion on a multiple access channel ⋮ On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization ⋮ Ordered and delayed adversaries and how to work against them on a shared channel ⋮ Contention resolution on a fading channel ⋮ Transmitting once to elect a leader on wireless networks ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Global synchronization and consensus using beeps in a fault-prone multiple access channel ⋮ Information exchange with collision detection on multiple channels ⋮ CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS ⋮ Many-to-many communication in radio networks ⋮ Local queuing under contention ⋮ Unbounded Contention Resolution in Multiple-Access Channels ⋮ Leader election in multi-hop radio networks ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel ⋮ Broadcasting in ad hoc multiple access channels ⋮ Broadcasting in Ad Hoc Multiple Access Channels
This page was built for publication: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
