Tech Report Number
99-019
Date of this Version
5-1-1999
Recommended Citation
Knessl, Charles and Szpankowski, Wojciech, "Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme" (1999). Department of Computer Science Technical Reports. Paper 1450.
https://docs.lib.purdue.edu/cstech/1450
Number of Pages
54