most citedA Tight Lower Bound for Decrease-Key in the Pure Heap Model

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2014★ 2 cited

A Tight Lower Bound for Decrease-Key in the Pure Heap Model

John Iacono, Özgür Özkan

We improve the lower bound on the amortized cost of the decrease-key operation in the pure heap model and show that any pure-heap-model heap (that has a \bigoh{\log n} amortized-ti…