1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.PL2026
Automated Amortised Analysis of Skew Heaps and Leftist Heaps (Extended Version)
Armin Walch, Georg Moser, Berry Schoenmakers +1
We study the fully automated amortised analysis of purely functional data structures like skew heaps, as well as weight- and rank-biased leftist heaps. For that we generalise earli…
cs.DS2024★ 1 cited
Amortized Analysis of Leftist Heaps
Berry Schoenmakers
Leftist heaps and skew heaps are two well-known data structures for mergeable priority queues. Leftist heaps are constructed for efficiency in the worst-case sense whereas skew hea…
cs.CR2018
Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains
Berry Schoenmakers
We present optimal binary pebbling algorithms for in-place reversal (backward traversal) of one-way hash chains. For a hash chain of length , the number of hashes performed in…