144 search results - page 6 / 29 » Non-blocking binary search trees |
CVPR
2000
IEEE
15 years 26 days ago
2000
IEEE
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
ACMSE
2007
ACM
14 years 2 months ago
2007
ACM
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
CORR
2006
Springer
13 years 11 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 8 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 4 months ago
2004
Springer