34 citations · 68 across the 7 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Amortized Rotation Cost in AVL Trees
Mahdi Amani, Kevin A. Lai, Robert E. Tarjan
An AVL tree is the original type of balanced binary search tree. An insertion in an -node AVL tree takes at most two rotations, but a deletion in an -node AVL tree can take $…
cs.LG2015★ 6 cited
Label optimal regret bounds for online local learning
Pranjal Awasthi, Moses Charikar, Kevin A. Lai +1
We resolve an open question from (Christiano, 2014b) posed in COLT'14 regarding the optimal dependency of the regret achievable for online local learning on the size of the label s…