scientific article; zbMATH DE number 4049127

MaRDI QIDQ3786016zbMATH OpenFDO

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

Publication date 1986

zbMATH Keywords

unificationterm matchingrandomized parallel algorithmdirected graph reachability

Mathematics Subject Classification ID

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

Recommendations

• On the sequential nature of unification
• scientific article; zbMATH DE number 4047099
• Efficient parallel term matching and anti-unification
• Term matching on parallel computers
• Optimal parallel algorithms for forest and term matching

Cited in

(9)

• Efficient parallel term matching and anti-unification
• scientific article; zbMATH DE number 4047099 (Why is no real title available?)
• Optimal parallel algorithms for forest and term matching
• Processor efficient parallel matching
• scientific article; zbMATH DE number 4090854 (Why is no real title available?)
• Parallel Algorithms for Term Matching
• Term matching on parallel computers
• On the sequential nature of unification
• Some complexity theoretic aspects of AC rewriting

This page was built for publication:

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