234 search results - page 37 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
ALGORITHMICA
2005
14 years 9 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
JAIR
2011
14 years 4 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
NETWORKING
2008
14 years 11 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
ERLANG
2003
ACM
15 years 2 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...