In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a CPU cache without having… (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

In this paper we explore a simple and general approach for developing parallel algorithms that lead to good cache complexity on… (More)

Is this relevant?

2007

2007

- Guangming Tan, Shengzhong Feng, Ninghui Sun
- The Journal of Supercomputing
- 2007

The nonserial polyadic dynamic programming algorithm is one of the most fundamental algorithms for solving discrete optimization… (More)

Is this relevant?

2006

2006

B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally <ul><li… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Matteo Frigo, Volker Strumpen
- ICS
- 2005

We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob
- SODA
- 2002

We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach… (More)

Is this relevant?

2002

2002

- Piyush Kumar
- Algorithms for Memory Hierarchies
- 2002

The cache oblivious model is a simple and elegant model to design algorithms that perform well in hierarchical memory models… (More)

Is this relevant?

2002

2002

- Erik D. Demaine
- 2002

A recent direction in the design of cache-efficient and diskefficient algorithms and data structures is the notion of cache… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

(MATH) In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Charles E. Leiserson
- CIAC
- 1999

This article presents asymptotically optimal algorithms for rectangular matrix transpose, fast Fourier transform (FFT), and… (More)

Is this relevant?

1999

1999

This thesis presents “cache-oblivious” algorithms that use asymptotically optimal amounts of work, and move data asymptotically… (More)

Is this relevant?