On tries, contention trees and their analysis
From MaRDI portal
Publication:659773
DOI10.1007/S00026-009-0002-4zbMath1231.68298OpenAlexW2150360623MaRDI QIDQ659773
Publication date: 24 January 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-009-0002-4
Analysis of algorithms (68W40) Data structures (68P05) Channel models (including quantum) in information and communication theory (94A40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mellin transforms and asymptotics: Harmonic sums
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- How to select a loser
- Packet delay in the case of a multiple-access stack algorithm
- Analytical depoissonization and its applications
- On The variance of the extremal path length in a symmetric digital trie
- Mellin transforms and asymptotics: Digital sums
- Mellin transforms and asymptotics. The mergesort recurrence
- On the distribution for the duration of a randomized leader election algorithm
- On a recurrence equation arising in the analysis of conflict resolution algorithms
- On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
- Tree algorithms for packet broadcast channels
- Profiles of Tries
- Analytic properties of multiple-access trees
- Development of the ALOHANET
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- Paths in a random digital tree: limiting distributions
- Some results on V-ary asymmetric tries
- Analysis of contention tree algorithms
This page was built for publication: On tries, contention trees and their analysis
