Summary: Exponential Structures for Efficient Cache-Oblivious
Michael A. Bender1
, Richard Cole2
, and Rajeev Raman3
Computer Science Department, SUNY Stony Brook, Stony Brook, NY 11794, USA.
Computer Science Department, Courant Institute, New York University, New York, NY
10012, USA. email@example.com.
Department of Mathematics and Computer Science, University of Leicester,
Leicester LE1 7RH, UK. R.Raman@mcs.le.ac.uk
Abstract. We present cache-oblivious data structures based upon exponential
structures. These data structures perform well on a hierarchical memory but do
not depend on any parameters of the hierarchy, including the block sizes and
number of blocks at each level. The problems we consider are searching, partial
persistence and planar point location. On a hierarchical memory where data is
transferred in blocks of size B, some of the results we achieve are: