"Asymptotic Behavior of the Height in a Digital Search Tree and the Longest ..."

Charles Knessl, Wojciech Szpankowski (2000)

> Home

Details and statistics

DOI: 10.1137/S0097539799356812

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/KnesslS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/KnesslS00
Charles Knessl, Wojciech Szpankowski:
Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme. SIAM J. Comput. 30(3): 923-964 (2000)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.