Searching for authors named Kurt Swanson – sorted by Relevance.
-
Utilizing the Structure of Data in Obtaining Upper and Lower Algorithmic Bounds
- Utilizing the Structure of Data in Obtaining Upper and Lower Algorithmic Bounds Kurt Swanson
- Add To MetaCart
-
On the difficulty of range searching
- , pages 473-481. Springer Verlag, 1995. On the Difficulty of Range Searching Arne Andersson? Kurt
- Cited by 5 (0 self) – Add To MetaCart
-
An Optimal Algorithm for Roundness Determination on Convex Polygons
- An Optimal Algorithm for Roundness Determination on Convex Polygons Kurt Swanson Department
- Cited by 20 (1 self) – Add To MetaCart
-
Suffix Trees on Words
- SuOEx Trees on Words Arne Andersson N.Jesper Larsson Kurt Swanson Dept. of Computer Science, Lund
- Cited by 24 (2 self) – Add To MetaCart

