Pages that link to "Item:Q3050281"
From MaRDI portal
The following pages link to Tree algorithms for packet broadcast channels (Q3050281):
Displaying 50 items.
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- Random multiple access in a vector disjunctive channel (Q383172) (← links)
- Leader election in ad hoc radio networks: a keen ear helps (Q394338) (← links)
- On ergodic algorithms in random multiple access systems with ``success-failure'' feedback (Q415719) (← links)
- Contention resolution under selfishness (Q487024) (← links)
- Randomized mutual exclusion on a multiple access channel (Q518923) (← links)
- The power of multimedia: Combining point-to-point and multi-access networks (Q582899) (← links)
- On tries, contention trees and their analysis (Q659773) (← links)
- A note on binomial recurrences arising in the analysis of algorithms (Q685508) (← links)
- Bayesian estimation in dynamic framed slotted ALOHA algorithm for RFID system (Q745816) (← links)
- A certainty equivalence principle based nonlinear separation control rule for random access channels: Stability and delay analysis (Q803100) (← links)
- On the height of digital trees and related problems (Q922689) (← links)
- Interrelation of characteristics of blocked RMA stack algorithms (Q941884) (← links)
- Conflict-resolving tree algorithm stable to incomplete interference damping (Q1027716) (← links)
- Large homogeneous communication networks with Markovian access control. I: Equilibria and local stability (Q1073769) (← links)
- A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback (Q1120993) (← links)
- Analytical depoissonization and its applications (Q1129001) (← links)
- System-theoretic properties of large communication networks with Markovian multiaccess control disciplines (Q1169448) (← links)
- A stack protocol of CTM type with quartet feedback (Q1177132) (← links)
- Reducing conflict resolution time for solving graph problems in broadcast communications (Q1183491) (← links)
- A fast maximum finding algorithm on broadcast communication (Q1350933) (← links)
- Spatially decentralized protocols in random multiple access networks (Q1707588) (← links)
- Leader election using loneliness detection (Q1938387) (← links)
- Merged search algorithms for radio frequency identification anticollision (Q1954990) (← links)
- Mean-field analysis of a scaling MAC radio protocol (Q2031328) (← 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)
- Dynamic tree algorithms (Q2268721) (← links)
- On stability of multiple access systems with minimal feedback (Q2279490) (← links)
- Doubly randomized protocols for a random multiple access channel with ``success-nonsuccess'' feedback (Q2364464) (← links)
- Contention resolution in a non-synchronized multiple access channel (Q2402256) (← links)
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (Q2426667) (← links)
- A class of algorithms for collision resolution with multiplicity estimation (Q2471709) (← links)
- A probabilistic analysis of some tree algorithms (Q2496496) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Deterministic non-adaptive contention resolution on a shared channel (Q2677825) (← links)
- Performance evaluation of random power capture on mobile communications (Q2745250) (← links)
- STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (Q2746221) (← links)
- Throughput and delay analysis of an opportunistic tree algorithm (Q2803401) (← 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)
- A novel prediction‐based collision resolution algorithm (Q3559704) (← links)
- Distributed communications in collision channels with errors (Q3743241) (← links)
- Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms (Q3793730) (← links)
- From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader (Q4684848) (← links)
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (Q4903279) (← 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)
- Leader election in SINR model with arbitrary power control (Q5919419) (← links)
