Implementing dictionaries using binary trees of very small height (Q1236885): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetric binary B-trees: Data structure and maintenance algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4776812 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4079070 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binary Search Trees of Bounded Balance / rank | |||
Normal rank |
Latest revision as of 21:12, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Implementing dictionaries using binary trees of very small height |
scientific article |
Statements
Implementing dictionaries using binary trees of very small height (English)
0 references
1976
0 references