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

DOI10.1016/J.TCS.2005.10.040zbMATH Open1086.68035OpenAlexW2124069228MaRDI QIDQ818121FDOQ818121

Authors: 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

Recommendations

• An Optimal Algorithm for Finding NCA on Pure Pointer Machines
• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
• scientific article; zbMATH DE number 2086234
• scientific article; zbMATH DE number 4047158
• Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees

zbMATH Keywords

dynamic data structurespointer machinesnearest common ancestor

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees
• An Optimal Algorithm for Finding NCA on Pure Pointer Machines

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

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