Manipulating multiple stacks with ordered-heap (Q1310924): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-adjusting binary search trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-Adjusting Heaps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3707420 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Amortized Computational Complexity / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:13, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Manipulating multiple stacks with ordered-heap |
scientific article |
Statements
Manipulating multiple stacks with ordered-heap (English)
0 references
13 January 1994
0 references
multiple stacks
0 references
dynamic data structure
0 references
ordered-heap
0 references