Pages that link to "Item:Q3753913"
From MaRDI portal
The following pages link to Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel (Q3753913):
Displayed 39 items.
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- Leader election in ad hoc radio networks: a keen ear helps (Q394338) (← links)
- Initializing sensor networks of non-uniform density in the weak sensor model (Q494934) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- Randomized mutual exclusion on a multiple access channel (Q518923) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection (Q803112) (← links)
- Quasi-optimal energy-efficient leader election algorithms in radio networks (Q879595) (← links)
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization (Q1198663) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Leader election using loneliness detection (Q1938387) (← 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)
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds (Q2078614) (← links)
- Windowed backoff algorithms for WiFi: theory and performance under batched arrivals (Q2241304) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Global synchronization and consensus using beeps in a fault-prone multiple access channel (Q2285154) (← links)
- Fast size approximation of a radio network in beeping model (Q2292914) (← links)
- Leader election in multi-hop radio networks (Q2326383) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Round complexity of leader election and gossiping in bidirectional radio networks (Q2450927) (← links)
- Approximating the Size of a Radio Network in Beeping Model (Q2835036) (← links)
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS (Q3084678) (← links)
- Unbounded Contention Resolution in Multiple-Access Channels (Q3095329) (← links)
- Leader Election Using Loneliness Detection (Q3095332) (← 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)
- (Q5090905) (← links)
- Local queuing under contention (Q5090920) (← links)
- Approximate Neighbor Counting in Radio Networks (Q5091104) (← links)
- Distributed tree comparison with nodes of limited memory (Q5326772) (← links)
- Coordination Problems in Ad Hoc Radio Networks (Q5391120) (← links)
- TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION (Q5696966) (← links)
- Leader election in SINR model with arbitrary power control (Q5919419) (← links)
- Information exchange with collision detection on multiple channels (Q5963613) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election (Q6052028) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
- Transmitting once to elect a leader on wireless networks (Q6077889) (← links)