Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Two nonlinear lower bounds for on-line computations
Information and Control
Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
On the single-operation worst-case time complexity of the disjoint set union problem
SIAM Journal on Computing
A model for hierarchical memory
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The I/O complexity of sorting and related problems
14th International Colloquium on Automata, languages and programming
A lower bound for the complexity of the union-split-find problem
14th International Colloquium on Automata, languages and programming
On the power of the shift instruction
Information and Computation
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Proceedings of the 4th GI-Conference on Theoretical Computer Science
Reference machines require non-linear time to maintain disjoint sets
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A characterization of the power of vector machines
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
REAL-TIME SIMULATION OF MULTIDIMENSIONAL TURING MACHINES BY STORAGE MODIFICATION MACHINES
REAL-TIME SIMULATION OF MULTIDIMENSIONAL TURING MACHINES BY STORAGE MODIFICATION MACHINES
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
ACM SIGACT News
Semantic models and abstract interpretation techniques for inductive data structures and pointers
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Purely functional random-access lists
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Parallelism in sequential functional languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Backing up in singly linked lists
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for dynamic algebraic problems
Information and Computation
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Theoretical Computer Science
Backing up in singly linked lists
Journal of the ACM (JACM)
Lower bounds for dynamic algebraic problems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Algorithms and theory of computation handbook
Dynamic normal forms and dynamic characteristic polynomial
Theoretical Computer Science
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.01 |