scientific article; zbMATH DE number 2086234

MaRDI QIDQ3044332zbMATH OpenFDO

Authors Enrico Pontelli, Desh Ranjan

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2286/22860263.htm

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• The Level-Ancestor problem on pure pointer machines
• scientific article; zbMATH DE number 4047158
• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
• The nearest common ancestor in a dynamic tree
• Fast Algorithms for Finding Nearest Common Ancestors

Cited in

(7)

• The Level-Ancestor problem on pure pointer machines
• A simple optimal solution for the temporal precedence problem on pure pointer machines
• Optimal solutions for the temporal precedence problem
• An optimal data structure to handle dynamic environments in non-deterministic computations
• Pure Pointer Programs and Tree Isomorphism
• Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees
• Sequential and parallel algorithms for the NCA problem on pure pointer machines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044332)