Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

Data Structures' Maxima

G. Louchard, Claire Kenyon and R. Schott
SIAM Journal on Computing 26 (4) 1006 (1997)
DOI: 10.1137/S0097539791196603
See this article

Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees

Philippe Jacquet and Wojciech Szpankowski
Theoretical Computer Science 144 (1-2) 161 (1995)
DOI: 10.1016/0304-3975(94)00298-W
See this article

Digital Search Trees Again Revisited: The Internal Path Length Perspective

Peter Kirschenhofer, Helmut Prodinger and Wojciech Szpankowski
SIAM Journal on Computing 23 (3) 598 (1994)
DOI: 10.1137/S0097539790189368
See this article

The Guessing Secrets problem: a probabilistic approach

Alberto Del Lungo, Guy Louchard, Claudio Marini and Franco Montagna
Journal of Algorithms 55 (2) 142 (2005)
DOI: 10.1016/j.jalgor.2004.03.001
See this article

On the variance of a class of inductive valuations of data structures for digital search

Werner Schachinger
Theoretical Computer Science 144 (1-2) 251 (1995)
DOI: 10.1016/0304-3975(94)00306-4
See this article

Dynamic algorithms in D.E. Knuth's model: a probabilistic analysis

G. Louchard, B. Randrianarimanana and R. Schott
Theoretical Computer Science 93 (2) 201 (1992)
DOI: 10.1016/0304-3975(92)90330-I
See this article

Universal Limit Laws for Depths in Random Trees

Luc Devroye
SIAM Journal on Computing 28 (2) 409 (1998)
DOI: 10.1137/S0097539795283954
See this article

Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme

Charles Knessl and Wojciech Szpankowski
SIAM Journal on Computing 30 (3) 923 (2000)
DOI: 10.1137/S0097539799356812
See this article

Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees

Michael Drmota and Hsien-Kuei Hwang
SIAM Journal on Discrete Mathematics 19 (1) 19 (2005)
DOI: 10.1137/S0895480104440134
See this article

The height of a binary search tree: the limiting distribution perspective

Charles Knessl and Wojciech Szpankowski
Theoretical Computer Science 289 (1) 649 (2002)
DOI: 10.1016/S0304-3975(01)00387-5
See this article

The left–right-imbalance of binary search trees

Markus Kuba and Alois Panholzer
Theoretical Computer Science 370 (1-3) 265 (2007)
DOI: 10.1016/j.tcs.2006.10.033
See this article

The expected profile of digital search trees

Michael Drmota and Wojciech Szpankowski
Journal of Combinatorial Theory, Series A 118 (7) 1939 (2011)
DOI: 10.1016/j.jcta.2011.04.001
See this article

François Bergeron, Philippe Flajolet and Bruno Salvy
581 24 (1992)
DOI: 10.1007/3-540-55251-0_2
See this article

Rounding of continuous random variables and oscillatory asymptotics

Svante Janson
The Annals of Probability 34 (5) (2006)
DOI: 10.1214/009117906000000232
See this article

Distances and Finger Search in Random Binary Search Trees

Luc Devroye and Ralph Neininger
SIAM Journal on Computing 33 (3) 647 (2004)
DOI: 10.1137/S0097539703424521
See this article

Estimation of search tree size and approximate counting: A likelihood approach

Florian Dennert and Rudolf Grübel
Statistics & Decisions 26 (4) (2009)
DOI: 10.1524/stnd.2008.1016
See this article

G. Louchard and W. Szpankowski
262 (1995)
DOI: 10.1109/DCC.1995.515516
See this article

Distinctness of compositions of an integer: A probabilistic analysis

Pawe? Hitczenko and Guy Louchard
Random Structures and Algorithms 19 (3-4) 407 (2001)
DOI: 10.1002/rsa.10008
See this article

Generalized Digital Trees and Their Difference—Differential Equations

Philippe Flajolet and Bruce Richmond
Random Structures and Algorithms 3 (3) 305 (1992)
DOI: 10.1002/rsa.3240030309
See this article

Guy Louchard, Claire Kenyon and René Schott
529 339 (1991)
DOI: 10.1007/3-540-54458-5_78
See this article

On the height of randomm-ary search trees

Luc Devroye
Random Structures and Algorithms 1 (2) 191 (1990)
DOI: 10.1002/rsa.3240010206
See this article

Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm

G. Louchard and W. Szpankowski
IEEE Transactions on Information Theory 41 (2) 478 (1995)
DOI: 10.1109/18.370149
See this article

Probabilistic analysis of adaptative sampling

Guy Louchard
Random Structures & Algorithms 10 (1-2) 157 (2000)
DOI: 10.1002/(SICI)1098-2418(199701/03)10:1/2<157::AID-RSA8>3.0.CO;2-U
See this article

An Analysis of Randomd-Dimensional Quad Trees

Luc Devroye and Louise Laforest
SIAM Journal on Computing 19 (5) 821 (1990)
DOI: 10.1137/0219057
See this article

Node profiles of symmetric digital search trees: Concentration properties

Michael Drmota, Michael Fuchs, Hsien‐Kuei Hwang and Ralph Neininger
Random Structures & Algorithms 58 (3) 430 (2021)
DOI: 10.1002/rsa.20979
See this article

Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm

Guy Louchard, Wojciech Szpankowski and Jing Tang
SIAM Journal on Computing 28 (3) 904 (1998)
DOI: 10.1137/S0097539796301811
See this article

Martingales and large deviations for binary search trees

Jean Jabbour-Hattab
Random Structures and Algorithms 19 (2) 112 (2001)
DOI: 10.1002/rsa.1023
See this article

Renewals for exponentially increasing lifetimes, with an application to digital search trees

Florian Dennert and Rudolf Grübel
The Annals of Applied Probability 17 (2) (2007)
DOI: 10.1214/105051606000000862
See this article

On random cartesian trees

Luc Devroye
Random Structures & Algorithms 5 (2) 305 (1994)
DOI: 10.1002/rsa.3240050205
See this article

Analytic variations on quadtrees

Philippe Flajolet, Gaston Gonnet, Claude Puech and J. M. Robson
Algorithmica 10 (6) 473 (1993)
DOI: 10.1007/BF01891833
See this article

G. Louchard, B. Randrianarimanana and R. Schott
372 521 (1989)
DOI: 10.1007/BFb0035781
See this article

Search costs in quadtrees and singularity perturbation asymptotics

P. Flajolet and T. Lafforgue
Discrete & Computational Geometry 12 (2) 151 (1994)
DOI: 10.1007/BF02574372
See this article

Mixed Poisson approximation of node depth distributions in random binary search trees

Rudolf Grübel and Nikolče Stefanoski
The Annals of Applied Probability 15 (1A) (2005)
DOI: 10.1214/105051604000000611
See this article

Bogdan S. Chlebus and Imrich Vrťo
529 190 (1991)
DOI: 10.1007/3-540-54458-5_63
See this article

Branching random walks on binary search trees: convergence of the occupation measure

Eric Fekete
ESAIM: Probability and Statistics 14 286 (2010)
DOI: 10.1051/ps:2008035
See this article