Work

Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme

Year: 2000

Type: conference-paper

Source: Symposium on Discrete Algorithms

DOI: 10.5555/338219.338251

Authors: Charles Knessl, Wojciech Szpankowski

Institutions: University of Illinois Chicago, Purdue University West Lafayette

Language: English

Topic: Algorithms and Data Compression

Subfield: Theoretical Computer Science

Field: Mathematics

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2059042398

FWCI:

Cites: 16

Cited by: 2

Related to: 10