Asymmetric Rényi Problem

DOI10.1017/S0963548318000329zbMath1435.68068arXiv1711.01528OpenAlexW2767488563MaRDI QIDQ5219326

Michael Drmota, Wojciech Szpankowski, Abram Magner

Publication date: 11 March 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.01528

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Combinatorial probability (60C05) Data structures (68P05)

Related Items (1)

Node profiles of symmetric digital search trees: Concentration properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The expected profile of digital search trees
• Mellin transforms and asymptotics: Harmonic sums
• Asymptotical growth of a class of random trees
• Analytical depoissonization and its applications
• Analysis of an asymmetric leader election algorithm
• Laws of large numbers and tail inequalities for random tries and PATRICIA trees
• Profiles of PATRICIA tries
• Universal asymptotics for random tries and PATRICIA trees
• How many random questions are necessary to identify \(n\) distinct objects?
• Special issue: Average-case analysis of algorithms
• Patricia tries again revisited
• Profiles of Tries
• A note on the probabilistic analysis of patricia trees
• Asymmetric R\'enyi Problem and PATRICIA Tries
• Expected External Profile of PATRICIA Tries

This page was built for publication: Asymmetric Rényi Problem