Sequential and parallel algorithms for the NCA problem on pure pointer machines

DOI10.1016/j.tcs.2005.10.040zbMath1086.68035OpenAlexW2124069228MaRDI QIDQ818121

A. Dal Palú, Enrico Pontelli, Desh Ranjan

Publication date: 24 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.040

zbMATH Keywords

dynamic data structurespointer machinesnearest common ancestor

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of algorithms which require nonlinear time to maintain disjoint sets
• A linear-time algorithm for a special case of disjoint set union
• Data structures for order-sensitive predicates in parallel nondeterministic systems
• The temporal precedence problem
• A simple optimal solution for the temporal precedence problem on pure pointer machines
• The nearest common ancestor in a dynamic tree
• Optimal solutions for the temporal precedence problem
• Parallel pointer machines
• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• A universal interconnection pattern for parallel computers
• On pointers versus addresses
• Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
• Logic Programming
• Parallelism in random access machines

This page was built for publication: Sequential and parallel algorithms for the NCA problem on pure pointer machines