6 citations · 20 across the 19 of their papers we have counts for
3 papers · 1 filter
The Group Access Bounds for Binary Search Trees
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak +2
The access lemma (Sleator and Tarjan, JACM 1985) is a property of binary search trees that implies interesting consequences such as static optimality, static finger, and working se…
Deterministic -Vertex Connectivity in Max-flows
Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
An -vertex -edge graph is \emph{-vertex connected} if it cannot be disconnected by deleting less than vertices. After more than half a century of intensive research, t…
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns
Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai
We consider the problem of comparison-sorting an -permutation that avoids some -permutation . Chalermsook, Goswami, Kozma, Mehlhorn, and Saranurak prove that when …