144 search results - page 3 / 29 » Non-blocking binary search trees |
ICSOFT
2007
13 years 7 months ago
2007
FOCS
2006
IEEE
14 years 4 days ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
CORR
2011
Springer
13 years 17 days ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
SIGCSE
1996
ACM
13 years 10 months ago
1996
ACM
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...
PAMI
2011
13 years 1 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...