Algorithm Theory - SWAT 2004

Frigo, Leiserson, Prokop and Ramachandran in 1999 introduced the ideal-cache model as a formal model of computation for developing algorithms in environments with multiple levels of caching, and coined the terminology of cache-oblivious algorithms. Cache-oblivious algorithms are described as standard RAM algorithms with only one memory level, i.e. without any knowledge about memory hierarchies, but are analyzed in the two-level I/O model of Aggarwal and Vitter for an arbitrary memory and block size and an optimal off-line cache replacement strategy. The result are algorithms that automatically apply to multi-level memory hierarchies. This paper gives an overview of the results achieved on cache-oblivious algorithms and data structures since the seminal paper by Frigo et al.

[1]  Leonidas J. Guibas,et al.  Randomized incremental construction of Delaunay and Voronoi diagrams , 1990, Algorithmica.

[2]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[3]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[4]  R. Möhring.  Algorithmic Aspects of Comparability Graphs and Interval Graphs , 1985 .

[5]  Marc Noy,et al.  Flipping Edges in Triangulations , 1999, Discret. Comput. Geom..

[6]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[7]  Jeremy P. Spinrad,et al.  Ordered Vertex Partitioning , 2000, Discret. Math. Theor. Comput. Sci..

[8]  Franz Aurenhammer,et al.  Pseudotriangulations from Surfaces and a Novel Type of Edge Flip , 2003, SIAM J. Comput..

[9]  Fabien de Montgolfier,et al.  De'composition Modulaire des Graphes. The'orie, Extensions et Algorithmes , 2003 .

[10]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[11]  B. Joe.  Three-dimensional triangulations from local transformations , 1989 .

[12]  Seiya Negami.  DIAGONAL FLIPS OF TRIANGULATIONS ON SURFACES, A SURVEY , 1999 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[15]  Franz Aurenhammer,et al.  Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips , 2003, WADS.

[16]  V. T. Rajan,et al.  Optimality of the Delaunay triangulation in Rd , 1991, SCG '91.

[17]  Jeremy P. Spinrad,et al.  Linear-time modular decomposition and efficient transitive orientation of comparability graphs , 1994, SODA '94.

[18]  Wen-Lian Hsu,et al.  Substitution Decomposition on Chordal Graphs and Applications , 1991, ISA.

[19]  Barry Joe,et al.  Construction of three-dimensional Delaunay triangulations using local transformations , 1991, Comput. Aided Geom. Des..

[20]  Wen-Lian Hsu,et al.  PC trees and circular-ones arrangements , 2003, Theor. Comput. Sci..

[21]  Norbert Zeh,et al.  Connectivity of Graphs Under Edge Flips , 2004, SWAT.

[22]  Marc Noy,et al.  Simultaneous Edge Flipping in Triangulations , 2003, Int. J. Comput. Geom. Appl..

[23]  F. Radermacher,et al.  Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization , 1984 .

[24]  Franz Aurenhammer,et al.  Sequences of spanning trees and a fixed tree theorem , 2002, Comput. Geom..