1 citations · 1 across the 5 of their papers we have counts for
1 paper · 1 filter
Colm Ó Dúnlaing
This paper takes another look at the cost of traversing a binary tree using repeated splay-to-root. This was shown to cost O(n) (in rotations) by Tarjan and later, in different w…