Pages that link to "Item:Q3765234"
From MaRDI portal
The following pages link to A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels (Q3765234):
Displaying 41 items.
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- Leader election in ad hoc radio networks: a keen ear helps (Q394338) (← links)
- Contention resolution under selfishness (Q487024) (← links)
- Randomized mutual exclusion on a multiple access channel (Q518923) (← links)
- A lower bound for communication on the crossbar (Q672740) (← links)
- Faster deterministic wakeup in multiple access channels (Q881569) (← links)
- Scalable wake-up of multi-channel single-hop radio networks (Q906382) (← links)
- Applications of coding theory to communication combinatorial problems (Q916665) (← links)
- Conflict resolution in a multiple access channel (Q923051) (← links)
- Many-to-many communication in radio networks (Q1024217) (← links)
- An optimal strategy for a conflict resolution problem (Q1079450) (← links)
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization (Q1198663) (← links)
- Packet output time for a strategy which knows the multiplicities of occurring conflicts (Q1280746) (← links)
- Average packet output time for conflict with multiplicity 3 and ternary feedback (Q1280781) (← links)
- The throughput of the stack algorithm in a channel with \(N\)-conflicts (Q1320668) (← links)
- A logarithmic lower bound for time-spread multiple-access (TSMA) protocols (Q1853910) (← 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)
- Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
- Global synchronization and consensus using beeps in a fault-prone multiple access channel (Q2285154) (← links)
- Leader election in multi-hop radio networks (Q2326383) (← links)
- Broadcasting in ad hoc multiple access channels (Q2345466) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Deterministic multi-channel information exchange (Q2396723) (← links)
- Contention resolution in a non-synchronized multiple access channel (Q2402256) (← links)
- Adversarial multiple access channels with individual injection rates (Q2408561) (← links)
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (Q2426667) (← links)
- Deterministic non-adaptive contention resolution on a shared channel (Q2677825) (← links)
- The cost of synchronizing multiple-access channels (Q2796279) (← links)
- Broadcasting in Ad Hoc Multiple Access Channels (Q2868648) (← links)
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS (Q3084678) (← links)
- Unbounded Contention Resolution in Multiple-Access Channels (Q3095329) (← links)
- Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses (Q4687247) (← links)
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (Q4903279) (← links)
- Local queuing under contention (Q5090920) (← links)
- Coordination Problems in Ad Hoc Radio Networks (Q5391120) (← links)
- Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel (Q5501204) (← links)
- Optimal channel utilization with limited feedback (Q5925513) (← links)
- Information exchange with collision detection on multiple channels (Q5963613) (← links)
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election (Q6052028) (← links)
- Transmitting once to elect a leader on wireless networks (Q6077889) (← links)
