JOURNAL ARTICLE
Efficient parallel term matching and anti-unification
Year: 1992 Journal: Journal of Automated Reasoning Vol: 9 (3)Pages: 391-406 Publisher: Springer Science+Business Media
Keywords:
Rewriting Unification Computer science Term (time) Generalization Matching (statistics) Parallel computing Pattern matching Algorithm Time complexity Mathematics Programming language
Metrics
14
Cited By
1.10
FWCI (Field Weighted Citation Impact)
19
Refs
0.77
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Algorithms and Data Compression
Physical Sciences → Computer Science → Artificial Intelligence
Advanced Database Systems and Queries
Physical Sciences → Computer Science → Computer Networks and Communications
Formal Methods in Verification
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Efficient parallel algorithms for anti-unification and relative complement
Gabriel M. KuperKen McAloonKrishna V. PalemKenneth J. Perry
Year: 2003 Pages: 112-120
BOOK-CHAPTER
An efficient parallel algorithm for term matching
Rakesh VermaT R KrishnaprasadI. V. Ramakrishnan
Lecture notes in computer science Year: 1986 Pages: 504-518
JOURNAL ARTICLE
Processor Efficient Parallel Matching
Journal: Theory of Computing Systems Year: 2007 Vol: 42 (1)Pages: 73-90
BOOK-CHAPTER
Efficient Parallel and External Matching
Marcel BirnVitaly OsipovPeter SandersChristian SchulzNodari Sitchinava
Lecture notes in computer science Year: 2013 Pages: 659-670