A parallel tree difference algorithm

DOI10.1016/S0020-0190(96)00171-8zbMath0875.68476OpenAlexW2071900618MaRDI QIDQ673225

David 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

zbMATH Keywords

AccumulationsStructured textTree contractionTree differenceTree editUniversal hashing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel implementation of tree skeletons
• New hash functions and their use in authentication and set equality
• Efficient parallel algorithms for tree accumulations
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• A simple parallel tree contraction algorithm
• Fast algorithms for the unit cost editing distance between trees

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