In computer science, a search tree is a tree data structure used for locating specific keys from within a set. In order for a tree to function as a… (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

This paper describes the first complete implementation of a non-blocking binary search tree in an asynchronous shared-memory… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Broderick Arneson, Ryan B. Hayward, Philip Henderson
- IEEE Transactions on Computational Intelligence…
- 2010

Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of AI… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Petter Tøndel, Tor Arne Johansen, Alberto Bemporad
- Automatica
- 2003

We present an algorithm for generating a binary search tree that allows efficient evaluation of piecewise affine (PWA) functions… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob
- SODA
- 2002

We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Joao Marques-Silva, Karem A. Sakallah
- IEEE Trans. Computers
- 1999

ÐThis paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Joao Marques-Silva, Karem A. Sakallah
- Proceedings of International Conference on…
- 1996

This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

This paper introduces the Generalized Search Tree (GiST), an index structure supporting an extensible set of queries and data… (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Neil Sarnak, Robert E. Tarjan
- Commun. ACM
- 1986

A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Edward M. McCreight
- SIAM J. Comput.
- 1985

Let D be a dynamic set of ordered pairs [x, y] over the set 0, l, , k-of integers. Consider the following operations applied to D… (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- Jon Louis Bentley
- Commun. ACM
- 1975

This paper develops the multidimensional binary search tree (or <italic>k</italic>-d tree, where <italic>k</italic> is the… (More)

Is this relevant?