"An O(log log n)-Competitive Binary Search Tree with Optimal ..."

Prosenjit Bose et al. (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-13731-0_5

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/swat/BoseDDF10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/BoseDDF10
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg:
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. SWAT 2010: 38-49

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.