scientific article; zbMATH DE number 4049127

zbMATH Open0643.68134MaRDI QIDQ3786016FDOQ3786016

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

Publication date: 1986

Title of this publication is not available (Why is that?)

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

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)

Cited In (9)

• Efficient parallel term matching and anti-unification
• Title not available (Why is that?)
• Optimal parallel algorithms for forest and term matching
• Processor efficient parallel matching
• Title not available (Why is that?)
• 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)