Publication | Closed Access

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

Asymptotic BehaviorTree LanguageEngineeringInformation RetrievalData ScienceString-searching AlgorithmComputational LinguisticsAlgorithmic Information TheoryComputational ComplexityTree AutomatonComputer ScienceSearch TechniqueDiscrete MathematicsCombinatorial OptimizationLempel-ziv Parsing SchemeDigital Search Trees