Exponential Structures for Efficient Cache-Oblivious Algorithms

@inproceedings{Bender2002ExponentialSF,
  title={Exponential Structures for Efficient Cache-Oblivious Algorithms},
  author={Michael A. Bender and Richard Cole and Rajeev Raman},
  booktitle={ICALP},
  year={2002}
}
We presentcache-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: – We give a linear-space data structure for dynamic… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Exponential structures for efficient cache-oblivious algorithms

  • M. A. Bender, R. Cole, R. Raman
  • University of Leicester TR 2002/19,
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…