Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Dynamic two-connectivity with backtracking
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A New Algorithm for Building Alphabetic Minimax Trees
Fundamenta Informaticae - Special Issue on Stringology
Algorithms and theory of computation handbook
A New Algorithm for Building Alphabetic Minimax Trees
Fundamenta Informaticae - Special Issue on Stringology
Hi-index | 0.00 |