28 citations · 244 across the 83 of their papers we have counts for
4 papers · 2 filters
Improved bounds for multipass pairing heaps and path-balanced binary search trees
Dani Dorfman, Haim Kaplan, László Kozma +2
We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algorithms for data structure maintenance. The pairing heap is a simple and efficient…
Differentially Private k-Means with Constant Multiplicative Error
Haim Kaplan, Uri Stemmer
We design new differentially private algorithms for the Euclidean k-means problem, both in the centralized model and in the local model of differential privacy. In both models, our…
Representations of Sparse Distributed Networks: A Locality-Sensitive Approach
Haim Kaplan, Shay Solomon
In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a low outdegree orientation of a dynamic uniformly sparse graph. Specifically, for a dynamic graph on -verti…
Selection from heaps, row-sorted matrices and using soft heaps
Haim Kaplan, László Kozma, Or Zamir +1
We use soft heaps to obtain simpler optimal algorithms for selecting the -th smallest item, and the set of~ smallest items, from a heap-ordered tree, from a collection of sor…