Showing 2026Show all
2 papers · 1 filter
cs.DS2026
The Sync Heap: Delete First, Ask Questions Later
Benjamin Aram Berendsohn, Egor Gorbachev, László Kozma
Heaps (priority queues) are among the best-studied data structures in computer science. In this paper, we critically revisit the textbook assumption that in the comparison model at…
cs.DS2026
The price of incrementality in k-center clustering
László Kozma
The -center problem is one of the best-studied and most intuitive clustering formulations. It asks, given a set of points in a metric space, for of the points to be desi…