"Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic ..."

Stephen Alstrup, Mikkel Thorup (2000)

> Home

Details and statistics

DOI: 10.1006/JAGM.2000.1079

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/AlstrupT00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/AlstrupT00
Stephen Alstrup, Mikkel Thorup:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. J. Algorithms 35(2): 169-188 (2000)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.