License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.04091.1
URN: urn:nbn:de:0030-drops-1758
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2005/175/
|
Go to the corresponding Portal |
Albers, Susanne ;
Sedgewick, Robert ;
Wagner, Dorothea
04091 Abstracts Collection -- Data Structures
Abstract
From 22.02. to 27.02.2004, Dagstuhl Seminar "Data Structures"
was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed.
Abstracts of the presentations given during the seminar
are put together in this paper. The first section
describes the seminar topics and goals in general.
BibTeX - Entry
@InProceedings{albers_et_al:DagSemProc.04091.1,
author = {Albers, Susanne and Sedgewick, Robert and Wagner, Dorothea},
title = {{04091 Abstracts Collection – Data Structures}},
booktitle = {Data Structures},
pages = {1--13},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {4091},
editor = {Susanne Albers and Robert Sedgewick and Dorothea Wagner},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2005/175},
URN = {urn:nbn:de:0030-drops-1758},
doi = {10.4230/DagSemProc.04091.1},
annote = {Keywords: Cache oblivious algorithms , cell probe model , computational geometry , data compression , dictionaries , finger search , hashing , heaps I/O efficiency , lower bounds}
}
|
Keywords: |
|
Cache oblivious algorithms , cell probe model , computational geometry , data compression , dictionaries , finger search , hashing , heaps |
|
Freie Schlagwörter (deutsch): |
|
I/O efficiency , lower bounds |
|
Collection: |
|
04091 - Data Structures |
|
Issue Date: |
|
2005 |
|
Date of publication: |
|
04.05.2005 |
