Implicit Data Structures for the Dictionary Problem

Optimal message routing without complete routing tables

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing

A new approach to all pairs shortest paths in planar graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Searching a two key table under a single key

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks

IEEE Transactions on Computers

Planar graph decomposition and all pairs shortest paths

Journal of the ACM (JACM)

Arithmetic Interpolation Search for Alphabet Tables

IEEE Transactions on Computers

Dynamic interpolation search

Journal of the ACM (JACM)

Succinct Dynamic Data Structures

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures

Implicit B-trees: a new data structure for the dictionary problem

Journal of Computer and System Sciences - Special issue on FOCS 2002

Implicit dictionaries with O(1) modifications per update and fast search

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Optimal cache-oblivious implicit dictionaries

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

A compact data structure for representing a dynamic multiset

Information Processing Letters

Dynamic interpolation search revisited

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Rotated library sort

CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141