A parallel tree difference algorithm

DOI10.1016/S0020-0190(96)00171-8zbMATH Open0875.68476OpenAlexW2071900618MaRDI QIDQ673225FDOQ673225

Authors: D. B. Skillicorn 

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00171-8

Recommendations

• Parallel algorithms for tree traversals
• Parallel algorithms for tree accumulations
• Tree-based parallel algorithm design
• scientific article; zbMATH DE number 2100400
• scientific article; zbMATH DE number 54593
• A simple parallel tree contraction algorithm
• An efficient parallel algorithm for building the separating tree
• scientific article; zbMATH DE number 1107730

zbMATH Keywords

AccumulationsStructured textTree contractionTree differenceTree editUniversal hashing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• New hash functions and their use in authentication and set equality
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Title not available (Why is that?)
• Fast algorithms for the unit cost editing distance between trees
• A simple parallel tree contraction algorithm
• Efficient parallel algorithms for tree accumulations
• Parallel implementation of tree skeletons

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tree-based parallel algorithm design
• Normalization of edit sequences for text synchronization
• Title not available (Why is that?)
• A Differential Approach for Staged Trees
• A Formal Investigation of Diff3

This page was built for publication: A parallel tree difference algorithm

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