27 search results - page 6 / 6 » Interval Stabbing Problems in Small Integer Ranges |
DAGSTUHL
2007
13 years 11 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
TIT
2011
13 years 4 months ago
2011
: In this paper, a novel approach to the problem of estimating the heavy–tail exponent α > 0 of a distribution is proposed. It is based on the fact that block–maxima of siz...