8 citations · 30 across the 29 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 4 cited
The landscape of bounds for binary search trees
Parinya Chalermsook, Mayank Goswami, László Kozma +2
Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Theta(log n) w…
cs.DM2016★ 4 cited
New Integrality Gap Results for the Firefighters Problem on Trees
Parinya Chalermsook, Daniel Vaz
The firefighter problem is NP-hard and admits a approximation based on rounding the canonical LP. In this paper, we first show a matching integrality gap of o…