Upper and Lower Bounds on Constructing Alphabetic Binary Trees (Q4863980): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0895480193256651 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090918100 / rank | |||
Normal rank | |||
Latest revision as of 09:39, 30 July 2024
scientific article; zbMATH DE number 838851
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
