Parallel Algorithms for Term Matching

DOI10.1137/0217046MaRDI QIDQ3796803zbMATH OpenOpenAlexFDO

Authors Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0217046

zbMATH Keywords

directed acyclic graphsdirected graph reachabilitylogic programmingrandomized parallel algorithmterm matchingunification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4049127
• scientific article; zbMATH DE number 4011929
• scientific article; zbMATH DE number 4047099
• Term matching on parallel computers
• scientific article; zbMATH DE number 4090854
• Optimal parallel algorithms for forest and term matching
• Efficient parallel term matching and anti-unification
• scientific article; zbMATH DE number 826050
• Parallel String Matching Algorithms
• Parallel algorithms for combinatorial pattern matching

Cited in

(8)

• Complexity of matching problems
• On the relationship of congruence closure and unification
• Optimal parallel algorithms for forest and term matching
• Tight complexity bounds for term matching problems
• Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem
• Processor efficient parallel matching
• A note on the parallel complexity of anti-unification
• Efficient parallel term matching and anti-unification

This page was built for publication: Parallel Algorithms for Term Matching

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