O(log log n)-competitive dynamic binary search trees. - Chengwen Chris Wang; Jonathan Derryberry; Daniel Dominic Sleator (SODA, 2006)

O(log log n)-competitive Binary Search Tree. - Chengwen Chris Wang (Encyclopedia of Algorithms, 2008)

O(log log n)-Competitive Binary Search Tree. - Chengwen Chris Wang; Daniel Dominic Sleator (Encyclopedia of Algorithms, 2016)