Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Journal of the ACM (JACM)
Constant time factors do matter
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
High level reading and data structure compilation
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Worst-case and amortised optimality in union-find (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The level-ancestor problem on pure pointer machines
Information Processing Letters
An Optimal Algorithm for Finding NCA on Pure Pointer Machines
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
ACM Transactions on Algorithms (TALG)
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Dynamic neighbourhood cellular automata
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
An optimal data structure to handle dynamic environments in non-deterministic computations
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
A "Pointer Machine" is many things. Authors who consider referring to this term are invited to read the following note first.