Daniel Skora
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Algorithms×1
Frequent co-authors
Research Timeline
2026
The Greedy Binary Search Tree is Non-trivially Competitive
This paper proves the competitiveness of Greedy binary search tree as 2^(O(sqrt(loglog n))), improving upon the widely held belief of O(1)-competitiveness.
Highlighted terms show continued research focus across papers