Efficient lock-free binary search trees
Paper in proceeding, 2014
CAS
Amortized analysis
Lock-free
Concurrent data-structures
Binary search tree
Shared memory
Author
[Person 8863ead6-4147-4a13-97b9-a25c317252c5 not found]
Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)
[Person 6330b801-4779-4890-87f4-aa6c1a7e1d8f not found]
Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)
[Person d5465fbf-0d33-4bc7-90e1-e67730748ea9 not found]
Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)
2014 ACM Symposium on Principles of Distributed Computing, PODC 2014; Paris; France; 15 July 2014 through 18 July 2014
322-331
978-145032944-6 (ISBN)
DOI
10.1145/2611462.2611500
ISBN
978-145032944-6