✦ LIBER ✦

Universal Asymptotics for Random Tries and PATRICIA Trees

✍ Scribed by Luc Devroye

Publisher: Springer
Year: 2005
Tongue: English
Weight: 227 KB
Volume: 42
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1137-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotics for Euclidean minimal spanni

Asymptotics for Euclidean minimal spanning trees on random points

✍ David Aldous; J. Michael Steele 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 612 KB

Precise Logarithmic Asymptotics for the

Precise Logarithmic Asymptotics for the Right Tails of Some Limit Random Variables for Random Trees

✍ James Allen Fill; Svante Janson 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 301 KB

Precise asymptotics for random matrices

Precise asymptotics for random matrices and random growth models

✍ Zhong Gen Su 📂 Article 📅 2008 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 250 KB

Profiles of Random Trees: Limit Theorems

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

✍ Michael Fuchs; Hsien-Kuei Hwang; Ralph Neininger 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 469 KB

Asymptotics for dependent sums of random

Asymptotics for dependent sums of random vectors

✍ C. Cooper 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB 👁 1 views

We consider sequences of length m of n-tuples each with k nonzero entries chosen randomly from an Abelian group or finite field. For what values of m does there exist a subsequence which is zero-sum or linearly dependent, respectively? We report some results relating to these problems.

Design and analysis of asymptotically op

Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks

✍ Keqin Li 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 230 KB