Bounded-contention coding for the additive network model
From MaRDI portal
Publication:748114
DOI10.1007/s00446-015-0244-9zbMath1341.94013MaRDI QIDQ748114
Bernhard Haeupler, Muriel Médard, Keren Censor-Hillel, Nancy A. Lynch
Publication date: 20 October 2015
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-015-0244-9
Related Items
Subquadratic non-adaptive threshold group testing, Generalized framework for group testing: queries, feedbacks and adversaries, New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Broadcasting in dynamic radio networks
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Distributed computation in dynamic networks
- Coordinated consensus in dynamic networks
- Time-efficient randomized multiple-message broadcast in radio networks
- Faster information dissemination in dynamic networks via network coding
- Deterministic Network Model Revisited: An Algebraic Network Coding Approach
- Efficient Distributed Communication in Ad-Hoc Radio Networks
- Distributed Broadcast in Unknown Radio Networks
- The Complexity of Data Aggregation in Directed Networks
- DYNAMIC SHARING OF A MULTIPLE ACCESS CHANNEL
- Multiple Communication in Multihop Radio Networks
- A Random Linear Network Coding Approach to Multicast
- The capacity region of the totally asynchronous multiple-access channel
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Wireless Network Information Flow: A Deterministic Approach
- An Ω(D log(N/D)) lower bound for broadcast in radio networks
- Analyzing network coding gossip made easy
- Broadcasting algorithms in radio networks with unknown topology
- Introduction to Coding Theory
- Broadcasting in undirected ad hoc radio networks
