Morten Laustsen

Learn More
We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for cache-oblivious planar orthogonal range searching.Our range counting structure uses O(N log<inf>2</inf> N) space and answers queries using O(log<inf>B</inf> N) memory transfers, where B is the block size of any memory level in a(More)
  • 1