activity
20002026
most citedStrategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor

13 citations · 40 across the 21 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

cs.DS2018

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…

cs.DS2018

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…