144 search results - page 13 / 29 » A speculation-friendly binary search tree |
156
click to vote
SODA
1993
ACM
15 years 7 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
222
click to vote
SIGMOD
2010
ACM
15 years 17 days ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
139
click to vote
CG
2000
Springer
15 years 10 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
162
click to vote
CAIP
2009
Springer
15 years 9 months ago
2009
Springer
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
156
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...