Maintaining order in a generalized linked list
Acta Informatica
New trie data structures which support very fast search operations
Journal of Computer and System Sciences
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Data structures and network algorithms
Data structures and network algorithms
Information and Control
Searching and sorting similar lists
Journal of Algorithms
Information Processing Letters
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Programming languages: concepts and constructs
Programming languages: concepts and constructs
Binary search trees of almost optimal height
Acta Informatica
Fully persistent lists with catenation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Compiling with continuations
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Fully Persistent Arrays (Extended Array)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Improving Partial Rebuilding by Using Simple Balance Criteria
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Efficient applicative data types
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Persistent data structures
Real-time deques, multihead Turing machines, and purely functional programming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Fully persistent lists with catenation
Journal of the ACM (JACM)
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A probabilistic approach to the problem of automatic selection of data representations
Proceedings of the first ACM SIGPLAN international conference on Functional programming
An optimal RAM implementation of catenable min double-ended queues
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Confluent persistence revisited
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |