18 citations · 72 across the 35 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
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…
cs.DS2014★ 1 cited
Cache-Oblivious Persistence
Pooya Davoodi, Jeremy T. Fineman, John Iacono +1
Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the l…