An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
Work
Year: 2010
Type: book-chapter
Institutions Carleton University, University of Southern Denmark
Cites: 17
Cited by: 8
Related to: 10
FWCI: 1.955
Citation percentile (by year/subfield): 87.54
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed