Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-91-102

Range trees with slack parameter

Smid, Michiel

MPI-I-91-102. April 1991, 11 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
Range trees with slack parameter were introduced by Mehlhorn as
a dynamic data structure for solving the orthogonal range
searching
problem. By varying the slack parameter, this structure gives
many trade-offs for the complexity measures. In this note, a
complete analysis is given for this data structure.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-91-102.pdf6620 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1991-102
Hide details for BibTeXBibTeX
@TECHREPORT{Smid91b,
  AUTHOR = {Smid, Michiel},
  TITLE = {Range trees with slack parameter},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-91-102},
  MONTH = {April},
  YEAR = {1991},
  ISSN = {0946-011X},
}