Dagstuhl Seminar Proceedings: Cache-Oblivious and Cache-Aware Algorithms 2004

Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (Eds.): Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301 IBFI, Schloss Dagstuhl, Germany 2005

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree.
Joachim Gudmundsson, Jan Vahrenhold:
A Simple Algorithm for I/O-efficiently Pruning Dense Spanners.
Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn:
04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms.

Last update Thu May 24 04:15:52 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page