Name
Abstract | ||
|---|---|---|
It is possible to improve the worst-case behavior of operations on heaps, when counting number of comparisons between elements in the heap, by modifying the traditional binary heap. The improvement suggested is the use of a heap with “scattered” leaves. This method can be combined with the use of a ternary heap for even greater improvement. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1007/BF01934511 | BIT |
Keywords | Field | DocType |
improving worst-case behavior | Standard algorithms,Skew heap,Arithmetic,Algorithm,Ternary operation,Heap (data structure),Binary heap,Counting Number,Binomial heap,Mathematics | Journal |
Volume | Issue | ISSN |
24 | 1 | 1572-9125 |
Citations | PageRank | References |
7 | 1.45 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Svante Carlsson | 1 | 764 | 90.17 |