Dagstuhl Seminar Proceedings 04301

Cache-Oblivious and Cache-Aware Algorithms

L. Arge, M. A. Bender, E. Demaine, C. Leiserson, K. Mehlhorn (Eds.)

published by LZI
Host

ISSN  1862 - 4405

Dagstuhl Seminar 04301, 18.07. - 23.07.2004
Additional Information
Seminar Homepage
License
Search Publication Server

Authors
  • Arge, Lars
  • Bender, Michael A.
  • de Berg, Mark
  • Demaine, Erik
  • Gudmundsson, Joachim
  • Haverkort, Herman J.
  • Leiserson, Charles
  • Mehlhorn, Kurt
  • Vahrenhold, Jan
  • Yi, Ke

  •   
    04301 Abstracts Collection -- Cache-Oblivious and Cache-Aware Algorithms
    Authors: Arge, Lars ; Bender, Michael A. ; Demaine, Erik ; Leiserson, Charles ; Mehlhorn, Kurt

    Abstract | Document (202 KB) | BibTeX

    A Simple Algorithm for I/O-efficiently Pruning Dense Spanners
    Authors: Gudmundsson, Joachim ; Vahrenhold, Jan

    Abstract | Document (172 KB) | BibTeX

    The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
    Authors: Arge, Lars ; de Berg, Mark ; Haverkort, Herman J. ; Yi, Ke

    Abstract | Document (428 KB) | BibTeX

      




    DROPS-Home | Fulltext Search | Imprint
    Published by LZI