5 citations · 14 across the 8 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019★ 1 cited
Cache-Oblivious Priority Queues with Decrease-Key and Applications to Graph Algorithms
John Iacono, Riko Jacob, Konstantinos Tsakalidis
We present priority queues in the cache-oblivious external memory model with block size and main memory size that support on elements, operation \textsc{UPDATE} (combin…
cs.CG2019★ 2 cited
Dynamic Planar Convex Hull
Riko Jacob, Gerth Stølting Brodal
In this article, we determine the amortized computational complexity of the planar dynamic convex hull problem by querying. We present a data structure that maintains a set of n po…
cs.DS2019
Fragile Complexity of Comparison-Based Algorithms
Peyman Afshani, Rolf Fagerberg, David Hammer +5
We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the ma…