215 citations · 318 across the 83 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018★ 1 cited
Expander Decomposition and Pruning: Faster, Stronger, and Simpler
Thatchaphol Saranurak, Di Wang
We study the problem of graph clustering where the goal is to partition a graph into clusters, i.e. disjoint subsets of vertices, such that each cluster is well connected internall…
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
Smooth heaps and a dual view of self-adjusting data structures
László Kozma, Thatchaphol Saranurak
We present a new connection between self-adjusting binary search trees (BSTs) and heaps, two fundamental, extensively studied, and practically relevant families of data structures.…