"Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future ..."

Yaniv Sadeh, Haim Kaplan (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2023.53

access: open

type: Conference or Workshop Paper

metadata version: 2023-03-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/SadehK23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/SadehK23
Yaniv Sadeh, Haim Kaplan:
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. STACS 2023: 53:1-53:21

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.