RT Journal Article
JF 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
YR 1984
VO 00
IS
SP 369
TI An Implicit Data Structure For The Dictionary Problem That Runs In Polylog Time
A1 J.I. Munro,
K1
AB 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.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN
LA English
DO 10.1109/SFCS.1984.715937
LK http://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715937