## Self-Organizing Data Structures (1998)

### Cached

### Download Links

- [www.cs.pitt.edu]
- [www.informatik.uni-freiburg.de]
- [www.research.att.com]
- DBLP

### Other Repositories/Bibliography

Venue: | In |

Citations: | 18 - 0 self |

### BibTeX

@INPROCEEDINGS{Albers98self-organizingdata,

author = {Susanne Albers and Jeffery Westbrook},

title = {Self-Organizing Data Structures},

booktitle = {In},

year = {1998},

pages = {13--51},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. For the problem of maintaining unsorted lists, also known as the list update problem, we present results on the competitiveness achieved by deterministic and randomized on-line algorithms. For binary search trees, we present results for both on-line and off-line algorithms. Self-organizing data structures can be used to build very effective data compression schemes. We summarize theoretical and experimental results. 1 Introduction This paper surveys results in the design and analysis of self-organizing data structures for the search problem. The general search problem in pointer data structures can be phrased as follows. The elements of a set are stored in a collection of nodes. Each node also contains O(1) pointers to other nodes and additional state data which can be used for navigation and self-organizati...