---
res:
  bibo_abstract:
  - "The segment tree is a data structure for storing and maintaining a set of intervals
    on the real line. It has been used for an efficient algorithmic approach in a
    variety of geometric problems including the problem of deter-mining intersections
    among axis-parallel rectangles, computing the measure of a set of axis-parallel
    rectangles, and locating a point in a planar subdivision. A segment tree for n
    intervals requires 0(n) space in the best case and 0(n log n) space in the worst
    case. It is shown that segment trees require 0(n log n) space even in the expected
    case. Additionally, the worst-case upper bound on the space requirement of segment
    trees is improved over the previously known bound. Surprisingly, the space requirements
    in the expected and in the worst case differ only little. \r\n@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: W.
      foaf_name: Bucher, W.
      foaf_surname: Bucher
  - foaf_Person:
      foaf_givenName: Herbert
      foaf_name: Edelsbrunner, Herbert
      foaf_surname: Edelsbrunner
      foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-9823-6833
  bibo_volume: 1
  dct_date: 1983^xs_gYear
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: On expected- and worst-case segment trees@
...