| Publication | Date of Publication | Type |
|---|
| Tight bounds for prefetching and buffer management algorithms for parallel I/O systems | 2024-07-05 | Paper |
Unique normal forms for nonlinear term rewriting systems: Root overlaps
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Some complexity theoretic aspects of AC rewriting
STACS 89 | 2022-08-16 | Paper |
Uniqueness of normal forms for shallow term rewrite systems
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
A new decidability technique for ground term rewriting systems with applications
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
On embedding rectangular meshes into rectangular meshes of smaller aspect ratio
Information Processing Letters | 2016-05-26 | Paper |
New Undecidability Results for Properties of Term Rewrite Systems
Electronic Notes in Theoretical Computer Science | 2014-06-27 | Paper |
On the structure of counterexamples to symmetric orderings for BDD's
Electronic Notes in Theoretical Computer Science | 2013-07-24 | Paper |
| Uniqueness of normal forms is decidable for shallow term rewrite systems | 2012-08-29 | Paper |
A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems
Applicable Algebra in Engineering, Communication and Computing | 2010-12-21 | Paper |
Selection of vendor using analytical hierarchy process based on fuzzy preference programming
Opsearch | 2010-10-08 | Paper |
Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems
Fundamenta Informaticae | 2009-06-30 | Paper |
Remarks on Thatte's transformation of term rewriting systems
Information and Computation | 2005-02-22 | Paper |
Deciding confluence of certain term rewriting systems in polynomial time
Annals of Pure and Applied Logic | 2004-11-18 | Paper |
Characterizing confluence by rewrite closure and right ground term rewrite systems
Applicable Algebra in Engineering, Communication and Computing | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2085276 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 1962804 (Why is no real title available?) | 2003-08-11 | Paper |
Algorithms and reductions for rewriting problems. II.
Information Processing Letters | 2003-01-21 | Paper |
Algorithms and reductions for rewriting problems
Fundamenta Informaticae | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1342225 (Why is no real title available?) | 1999-09-22 | Paper |
A theory of using history for equational systems with applications
Journal of the ACM | 1998-01-28 | Paper |
General Techniques for Analyzing Recursive Algorithms with Applications
SIAM Journal on Computing | 1997-05-26 | Paper |
Transformations and confluence for rewrite systems
Theoretical Computer Science | 1997-02-27 | Paper |
A new combinatorial approach to optimal embeddings of rectangles
Algorithmica | 1996-10-20 | Paper |
A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications
Journal of Algorithms | 1995-08-27 | Paper |
| scientific article; zbMATH DE number 177827 (Why is no real title available?) | 1993-05-18 | Paper |
Tight complexity bounds for term matching problems
Information and Computation | 1993-01-17 | Paper |
Strings, trees, and patterns
Information Processing Letters | 1992-06-28 | Paper |
An Analysis of a Good Algorithm for the Subtree Problem, Corrected
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4090854 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4011929 (Why is no real title available?) | 1986-01-01 | Paper |
