144 search results - page 6 / 29 » A speculation-friendly binary search tree |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
PPOPP
2010
ACM
14 years 5 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
BIRTHDAY
2004
Springer
14 years 1 months ago
2004
Springer
CIAC
2003
Springer
14 years 27 days ago
2003
Springer
CPM
2006
Springer
13 years 11 months ago
2006
Springer