5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.LO2013★ 5 cited
Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract)
Manfred Schmidt-Schauss
This paper is an extended abstract of an analysis of term rewriting where the terms in the rewrite rules as well as the term to be rewritten are compressed by a singleton tree gram…
cs.LO2010★ 1 cited
Unification and Matching on Compressed Terms
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in…