Results

**11 - 11**of**11**### Utilizing the Structure of Data in Obtaining Upper and Lower Algorithmic Bounds

"... This is a thesis for the degree of "filosofie licentiat," a Swedish degree between a Master of Science, and a PhD. The thesis comprises three separate articles within the area of Algorithms and Data Structures in Computer Science. Each article takes advantage of the inherent structure of input data ..."

Abstract
- Add to MetaCart

This is a thesis for the degree of "filosofie licentiat," a Swedish degree between a Master of Science, and a PhD. The thesis comprises three separate articles within the area of Algorithms and Data Structures in Computer Science. Each article takes advantage of the inherent structure of input data in order to obtain a tighter algorithmic bound. In the first article, the inherent nature of convex polygons is used to obtain an efficient algorithm for measuring the minimal radial separation of such a shape. A specific structuring of data points is used in the second article to produce a non-trivial lower bound for range searching. Lastly, the inherent divisibility of text strings into words or word-like entities is used to create an efficient data structure for storing word suffixes of a given string. Introduction 1 Preface This is a thesis for the degree of "filosofie licentiat," a Swedish degree between a Master of Science, and a PhD. It consists of a general introduction and three a...