Sciweavers

Share
DAGSTUHL
1996

Self-Organizing Data Structures

9 years 12 days ago
Self-Organizing Data Structures
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 o -line algorithms. Self-organizing data structures can be used to build very e ective data compression schemes. We summarize theoretical and experimental results.
Susanne Albers, Jeffery Westbrook
Added 02 Nov 2010
Updated 02 Nov 2010
Type Conference
Year 1996
Where DAGSTUHL
Authors Susanne Albers, Jeffery Westbrook
Comments (0)
books