Optimal parallel algorithms for forest and term matching

DOI10.1016/0304-3975(92)90332-AzbMath0745.68053OpenAlexW1968633186MaRDI QIDQ1186605

Zvi M. Kedem, Krishna V. Palem

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90332-a

zbMATH Keywords

matchingCRCW PRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items

An efficient parallel algorithm for the single function coarsest partition problem, Efficient parallel term matching and anti-unification

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear unification
• A theory of type polymorphism in programming
• Parallel Generation of Postfix and Tree Forms
• Optimal parallel generation of a computation tree form
• An Efficient Parallel Biconnectivity Algorithm
• On the sequential nature of unification
• Parallel Algorithms for Term Matching
• Pattern Matching in Trees
• The Parallel Evaluation of General Arithmetic Expressions
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms