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. IBFI, Schloss Dagstuhl, Germany 2005 Dagstuhl Seminar Proceedings 04301- Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree.
- Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team