40 citations · 168 across the 23 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Multi-finger binary search trees
Parinya Chalermsook, Mayank Goswami, László Kozma +2
We study multi-finger binary search trees (BSTs), a far-reaching extension of the classical BST model, with connections to the well-studied -server problem. Finger search is a p…
cs.DS2018★ 3 cited
Buffered Count-Min Sketch on SSD: Theory and Experiments
Mayank Goswami, Dzejla Medjedovic, Emina Mekic +1
Frequency estimation data structures such as the count-min sketch (CMS) have found numerous applications in databases, networking, computational biology and other domains. Many app…