144 search results - page 3 / 29 » Non-blocking binary search trees |
137
Voted
ICSOFT
2007
15 years 5 months ago
2007
152
Voted
FOCS
2006
IEEE
15 years 9 months 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...
183
Voted
CORR
2011
Springer
14 years 10 months 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...
127
Voted
SIGCSE
1996
ACM
15 years 7 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...
169
Voted
PAMI
2011
14 years 10 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 ...