Information and Control
Planar point location using persistent search trees
Communications of the ACM
Searching and sorting similar lists
Journal of Algorithms
Information Processing Letters
Abstract continuations: a mathematical semantics for handling full jumps
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Stores and partial continuations as first-class objects in a language and its environment
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Control delimiters and their hierarchies
Lisp and Symbolic Computation
Fully persistent lists with catenation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Real-time deques, multihead Turing machines, and purely functional programming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An optimal RAM implementation of catenable min double-ended queues
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Real-Time Simulation of Multihead Tape Units
Journal of the ACM (JACM)
New Real-Time Simulations of Multihead Tape Units
Journal of the ACM (JACM)
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
An example of hierarchical design and proof
Communications of the ACM
The Science of Programming
Anatomy of LISP
Fully Persistent Arrays (Extended Array)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The efficient implementation of very-high-level programming language constructs
The efficient implementation of very-high-level programming language constructs
Persistent data structures
Purely functional random-access lists
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
The role of lazy evaluation in amortized data structures
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Finger search trees with constant insertion time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
Making data structures confluently persistent
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Automated Benchmarking of Functional Data Structures
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Inductive benchmarking for purely functional data structures
Journal of Functional Programming
Finger trees: a simple general-purpose data structure
Journal of Functional Programming
Purely functional worst case constant time catenable sorted lists
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Confluently Persistent Tries for Efficient Version Control
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Associative-commutative rewriting on large terms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Algorithms and theory of computation handbook
Confluent persistence revisited
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Strictly-Regular number system and data structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |