Pages that link to "Item:Q5187198"
From MaRDI portal
The following pages link to An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels (Q5187198):
Displaying 30 items.
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- Bounded-contention coding for the additive network model (Q748114) (← links)
- Deterministic recurrent communication in restricted sensor networks (Q764337) (← links)
- Faster deterministic wakeup in multiple access channels (Q881569) (← links)
- On the complexity of neighbourhood learning in radio networks (Q896133) (← links)
- Scalable wake-up of multi-channel single-hop radio networks (Q906382) (← links)
- Applications of coding theory to communication combinatorial problems (Q916665) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Coding for write-unidirectional memories and conflict resolution (Q1823916) (← links)
- Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← links)
- Contention resolution on a fading channel (Q2010610) (← links)
- Separable collusion-secure multimedia codes (Q2044131) (← links)
- Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
- Windowed backoff algorithms for WiFi: theory and performance under batched arrivals (Q2241304) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions (Q2333785) (← links)
- Broadcasting in ad hoc multiple access channels (Q2345466) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Contention resolution in a non-synchronized multiple access channel (Q2402256) (← links)
- Adversarial multiple access channels with individual injection rates (Q2408561) (← links)
- Deterministic non-adaptive contention resolution on a shared channel (Q2677825) (← links)
- Broadcasting in Ad Hoc Multiple Access Channels (Q2868648) (← links)
- $$\epsilon $$-Almost Selectors and Their Applications (Q2947885) (← links)
- Unbounded Contention Resolution in Multiple-Access Channels (Q3095329) (← links)
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (Q4903279) (← links)
- Local queuing under contention (Q5090920) (← links)
- Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel (Q5501204) (← links)
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks (Q5919324) (← links)
- Optimal channel utilization with limited feedback (Q5925513) (← links)
- Information exchange with collision detection on multiple channels (Q5963613) (← links)