Amortization results for chromatic search trees, with an application to priority queues (Q5057441): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3948568 / 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: Organization and maintenance of large ordered indexes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient rebalancing of chromatic search trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new data structure for representing sorted lists / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Concurrent access of priority queues / rank | |||
Normal rank |
Latest revision as of 03:03, 31 July 2024
scientific article; zbMATH DE number 7633549
Language | Label | Description | Also known as |
---|---|---|---|
English | Amortization results for chromatic search trees, with an application to priority queues |
scientific article; zbMATH DE number 7633549 |
Statements
Amortization results for chromatic search trees, with an application to priority queues (English)
0 references
16 December 2022
0 references