The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 24 NO.5 / (1995))
New Tight Bounds on Uniquely Represented Dictionaries
Arne Andersson, Thomas Ottmann,
Pages. 1091-1103
Abstract
Contents 1. Introduction
2. Model of computation
3. Semidynamic $c$-level jump lists
4. A fully dynamic 3-level structure
4.1. Data structure
4.2. Maintenance algorithms
5. A lower bound on unique representation
6. Comments and open problems
Key words nalysis of algorithms, data structures, dictionary problem, uniquely represented dictionaries, binary search trees.
Mathmatical Subject Classification 68P05, 68P10, 68P20, 68Q05, 68