"The amortized complexity of non-blocking binary search trees."

Faith Ellen et al. (2014)

> Home

Details and statistics

DOI: 10.1145/2611462.2611486

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/podc/EllenFHR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/EllenFHR13
Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert:
The amortized complexity of non-blocking binary search trees. PODC 2014: 332-340

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.