The Community for Technology Leaders
25th Annual Symposium onFoundations of Computer Science, 1984. (1984)
Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
ISBN: 0-8186-0591-X
pp: 369-374
J.I. Munro , University of Waterloo
ABSTRACT
We introduce a data structure that requires only one pointer for every k data values and permits the operations search, insert and delete to be performed in 0 (k log n) time. This structure is used to develop another that requires no pointers and supports insert, delete and search in 0 (log2 n) time.
INDEX TERMS
CITATION

J. Munro, "An Implicit Data Structure For The Dictionary Problem That Runs In Polylog Time," 25th Annual Symposium onFoundations of Computer Science, 1984.(FOCS), Singer Island, FL, 1984, pp. 369-374.
doi:10.1109/SFCS.1984.715937
87 ms
(Ver 3.3 (11022016))