Pages that link to "Item:Q1821561"
From MaRDI portal
The following pages link to The nearest common ancestor in a dynamic tree (Q1821561):
Displaying 11 items.
- Dynamic range majority data structures (Q306716) (← links)
- Nearest common ancestors: a survey and a new algorithm for a distributed environment (Q706323) (← links)
- Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
- The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- An optimal data structure to handle dynamic environments in non-deterministic computations (Q1869983) (← links)
- The lowest common ancestor problem on a tree with an unfixed root (Q1961826) (← links)
- Some Results for Elementary Operations (Q3644718) (← links)
- Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees (Q4485190) (← links)
- A Data Structure for Nearest Common Ancestors with Linking (Q4554935) (← links)
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees (Q5054814) (← links)