Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees

Stephen Alstrup, Mikkel Thorup. Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. J. Algorithms, 35(2):169-188, 2000.

@article{AlstrupT00,
  title = {Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees},
  author = {Stephen Alstrup and Mikkel Thorup},
  year = {2000},
  researchr = {https://researchr.org/publication/AlstrupT00},
  cites = {0},
  citedby = {0},
  journal = {J. Algorithms},
  volume = {35},
  number = {2},
  pages = {169-188},
}