A generic type system with path-sensitive inference and template-based potential functions automatically confirms optimal amortized bounds for skew heaps and leftist heaps.
ACM Transactions on Algorithms (TALG)11(4), 1–26 (2015).https : / / doi
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Automated Amortised Analysis of Skew Heaps and Leftist Heaps (Extended Version)
A generic type system with path-sensitive inference and template-based potential functions automatically confirms optimal amortized bounds for skew heaps and leftist heaps.