HTML Export for Dagstuhl Seminar Proceedings, Volume 4301

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 4301, </h2>
    <span class="authors">Lars Arge, Michael A. Bender, Erik Demaine, Charles Leiserson, and Kurt Mehlhorn</span>
    <span class="title">04301 Abstracts Collection – Cache-Oblivious and Cache-Aware Algorithms</span>
    <a class="doi" href="">10.4230/DagSemProc.04301.1</a>
    <span class="authors">Joachim Gudmundsson and Jan Vahrenhold</span>
    <span class="title">A Simple Algorithm for I/O-efficiently Pruning Dense Spanners</span>
    <a class="doi" href="">10.4230/DagSemProc.04301.2</a>
    <span class="authors">Lars Arge, Mark de Berg, Herman J. Haverkort, and Ke Yi</span>
    <span class="title">The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree</span>
    <a class="doi" href="">10.4230/DagSemProc.04301.3</a>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply:

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail