Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
J.I. Munro , University of Waterloo
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.
J.I. Munro, "An Implicit Data Structure For The Dictionary Problem That Runs In Polylog Time", FOCS, 1984, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1984, pp. 369-374, doi:10.1109/SFCS.1984.715937