Analysis of \(d\)-ary tree algorithms with successive interference cancellation
DOI10.1017/JPR.2023.107zbMATH Open1547.68848MaRDI QIDQ6617615
Čedomir Stefanović, Yash Deshpande, Quirin Vogel, Wolfgang Kellerer
Publication date: 11 October 2024
Published in: Journal of Applied Probability (Search for Journal in Brave)
Analysis of algorithms (68W40) Applications of branching processes (60J85) Randomized algorithms (68W20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Novel characteristics of split trees by use of renewal theory
- Mellin transforms and asymptotics: Harmonic sums
- Interrelation of characteristics of blocked RMA stack algorithms
- Analysis of an asymmetric leader election algorithm
- On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
- Tree algorithms for packet broadcast channels
- Random Trees
- High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
- Random Walk: A Modern Introduction
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- On the Maximum Stable Throughput of Tree Algorithms With Free Access
- Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”
This page was built for publication: Analysis of \(d\)-ary tree algorithms with successive interference cancellation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617615)
