"Alternatives to splay trees with O(log n) worst-case access times."

John Iacono (2001)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/Iacono01a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/Iacono01a
John Iacono:
Alternatives to splay trees with O(log n) worst-case access times. SODA 2001: 516-522

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.