Maintaining order in a generalized linked list
Acta Informatica
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Introduction to logic programming
Introduction to logic programming
Data structures and network algorithms
Data structures and network algorithms
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
Login: A logic programming language with built-in inheritance
Journal of Logic Programming
The set union problem with backtracking
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
On the single-operation worst-case time complexity of the disjoint set union problem
SIAM Journal on Computing
An algebraic semantics approach to the effective resolution of type equations
Theoretical Computer Science
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Dynamic orthogonal segment intersection search
Journal of Algorithms
Common LISP: the language
A lower bound on the complexity of the union-split-find problem
SIAM Journal on Computing
A balanced search tree with O(1) worst case update time
Acta Informatica
Time parameter and arbitrary deunions in the set union problem
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Linearity and unprovability of set union problem
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Amortized analysis of algorithms for set union with backtracking
SIAM Journal on Computing
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Worst-case analysis of the set-union problem with extended backtracking
Theoretical Computer Science
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Lower bounds for the union-find and the split-find problem on pointer machines
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A note on set union with arbitrary deunions
Information Processing Letters
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
Journal of the ACM (JACM)
Real-time deques, multihead Turing machines, and purely functional programming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
The Set Union Problem with Unlimited Backtracking
SIAM Journal on Computing
Fully persistent lists with catenation
Journal of the ACM (JACM)
Information Processing Letters
Confluently persistent deques via data-structural bootstrapping
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
A fast algorithm for computing longest common subsequences
Communications of the ACM
An improved equivalence algorithm
Communications of the ACM
An algorithm for equivalence declarations
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Computing minimum spanning trees efficiently
ACM '72 Proceedings of the ACM annual conference - Volume 1
Introduction to Algorithms
The Definition of Standard ML
Data Structures and Algorithms
Data Structures and Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the Complexity of Unification Sequences
Proceedings of the Third International Conference on Logic Programming
Fully Persistent Arrays (Extended Array)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Advanced Functional Programming, Second International School-Tutorial Text
Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Testing flow graph reducibility
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On finding lowest common ancestors in trees
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Prolog - the language and its implementation compared with Lisp
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
A programming and problem-solving seminar
A programming and problem-solving seminar
The efficient implementation of very-high-level programming language constructs
The efficient implementation of very-high-level programming language constructs
Persistent data structures
A scaling algorithm for weighted matching on general graphs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Dynamic perfect hashing: upper and lower bounds
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
| Hi-index | 0.00 |