Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
From MaRDI portal
Publication:3773810
DOI10.1145/23005.23006zbMath0634.94002OpenAlexW2028314380MaRDI QIDQ3773810
Richard E. Ladner, Philippe Flajolet, Albert G. Greenberg
Publication date: 1987
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/23005.23006
Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Related Items (17)
Generalized framework for group testing: queries, feedbacks and adversaries ⋮ Quasi-optimal energy-efficient leader election algorithms in radio networks ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ A class of algorithms for collision resolution with multiplicity estimation ⋮ STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN ⋮ The average CRI-length of a controlled ALOHA collision resolution algorithm ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems ⋮ Fast size approximation of a radio network in beeping model ⋮ Approximate Neighbor Counting in Radio Networks ⋮ Approximating the Size of a Radio Network in Beeping Model ⋮ Stochastic Contention Resolution With Short Delays ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel
This page was built for publication: Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
