A note on binomial recurrences arising in the analysis of algorithms
From MaRDI portal
Publication:685508
DOI10.1016/0020-0190(93)90070-PzbMath0800.68497MaRDI QIDQ685508
Wojciech Szpankowski, Prodinger, Helmut
Publication date: 19 September 1994
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the performance evaluation of extendible hashing and trie searching
- Further results on digital search trees
- The evaluation of an alternative sum with applications to the analysis of some data structures
- On the balance property of Patricia tries: External path length viewpoint
- A characterization of digital search trees from the successful search viewpoint
- On The variance of the extremal path length in a symmetric digital trie
- On a recurrence equation arising in the analysis of conflict resolution algorithms
- Tree algorithms for packet broadcast channels
- Patricia tries again revisited
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- Digital Search Trees Revisited
- Some results on V-ary asymmetric tries
- On a tree collision resolution algorithm in presence of capture
- On some applications of formulae of Ramanujan in the analysis of algorithms
- Generalized Digital Trees and Their Difference—Differential Equations
- Analytic analysis of algorithms
