"FEAST: A Lightweight Lock-free Concurrent Binary Search Tree."

Aravind Natarajan, Arunmoezhi Ramachandran, Neeraj Mittal (2020)

> Home

Details and statistics

DOI: 10.1145/3391438

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/topc/NatarajanRM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/topc/NatarajanRM20
Aravind Natarajan, Arunmoezhi Ramachandran, Neeraj Mittal:
FEAST: A Lightweight Lock-free Concurrent Binary Search Tree. ACM Trans. Parallel Comput. 7(2): 10:1-10:64 (2020)

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.