Multidimensional search trees that provide new types of memory reductions.

Dan E. Willard: Multidimensional search trees that provide new types of memory reductions. J. ACM 34(4): 846-858(1987)

@article{DBLP:journals/jacm/Willard87,
  author    = {Dan E. Willard},
  title     = {Multidimensional search trees that provide new types of memory
               reductions},
  journal   = {J. ACM},
  volume    = {34},
  number    = {4},
  year      = {1987},
  pages     = {846-858},
  ee        = {db/journals/jacm/Willard87.html, http://doi.acm.org/10.1145/31846.42228},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Dan E. Willard: Quasilinear Algorithms for Processing Relational Calculus Expressions. PODS 1990: 243-257

BibTeX