The Level-Ancestor problem on pure pointer machines
From MaRDI portal
Recommendations
Cites work
- A class of algorithms which require nonlinear time to maintain disjoint sets
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding level-ancestors in trees
- scientific article; zbMATH DE number 1670815 (Why is no real title available?)
- scientific article; zbMATH DE number 2086252 (Why is no real title available?)
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 177536 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Lower bounds for the union-find and the split-find problem on pointer machines
- Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
- Recognizing breadth-first search trees in linear time
- Storage Modification Machines
- The nearest common ancestor in a dynamic tree
Cited in
(5)- scientific article; zbMATH DE number 2086234 (Why is no real title available?)
- scientific article; zbMATH DE number 2086252 (Why is no real title available?)
- scientific article; zbMATH DE number 177536 (Why is no real title available?)
- Pure Pointer Programs and Tree Isomorphism
- The level ancestor problem simplified
This page was built for publication: The Level-Ancestor problem on pure pointer machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007543)