"A Balanced Search Tree with O (1) Worst-case Update Time."

Christos Levcopoulos, Mark H. Overmars (1988)

> Home

Details and statistics

DOI: 10.1007/BF00299635

access: closed

type: Journal Article

metadata version: 2020-06-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/acta/LevcopoulosO88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/LevcopoulosO88
Christos Levcopoulos, Mark H. Overmars:
A Balanced Search Tree with O (1) Worst-case Update Time. Acta Informatica 26(3): 269-277 (1988)

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.