Upper and Lower Bounds on Constructing Alphabetic Binary Trees (Q4863980)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper and Lower Bounds on Constructing Alphabetic Binary Trees |
scientific article; zbMATH DE number 838851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper and Lower Bounds on Constructing Alphabetic Binary Trees |
scientific article; zbMATH DE number 838851 |
Statements
Upper and Lower Bounds on Constructing Alphabetic Binary Trees (English)
0 references
23 April 1996
0 references
bounds
0 references
alphabetic binary trees
0 references
0.9075321
0 references
0.9074951
0 references
0.89988476
0 references
0.8898079
0 references
0.8898079
0 references
0.88653773
0 references
0.8864363
0 references
0.8863431
0 references
