Putting your data structure on a diet (2007)
| Venue: | In preparation (2006). [Ask Jyrki for details |
| Citations: | 2 - 2 self |
BibTeX
@INPROCEEDINGS{Brönnimann07puttingyour,
author = {Hervé Brönnimann and Jyrki Katajainen and Pat Morin},
title = {Putting your data structure on a diet},
booktitle = {In preparation (2006). [Ask Jyrki for details},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Consider a data structure D that stores a dynamic collection of elements. Assume that D uses a linear number of words in addition to the elements stored. In this paper several data-structural transformations are described that can be used to transform D into another data structure D ′ that supports the same operations as D, has considerably smaller memory overhead than D, and performs the supported operations by a small constant factor or a small additive term slower than D, depending on the data structure and operation in question. The compaction technique has been successfully applied for linked lists, dictionaries, and priority queues.
