The following pages link to Rakesh M. Verma (Q287152):
Displayed 31 items.
- On embedding rectangular meshes into rectangular meshes of smaller aspect ratio (Q287153) (← links)
- A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems (Q613611) (← links)
- Transformations and confluence for rewrite systems (Q672232) (← links)
- (Q707940) (redirect page) (← links)
- Selection of vendor using analytical hierarchy process based on fuzzy preference programming (Q707942) (← links)
- Strings, trees, and patterns (Q1186597) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Remarks on Thatte's transformation of term rewriting systems (Q1763376) (← links)
- Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
- Characterizing confluence by rewrite closure and right ground term rewrite systems (Q1885352) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- A new combinatorial approach to optimal embeddings of rectangles (Q1920427) (← links)
- (Q2730723) (← links)
- On the Structure of Counterexamples to Symmetric Orderings for BDD's (Q2841260) (← links)
- Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems (Q2908858) (← links)
- Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems (Q3635996) (← links)
- (Q3761692) (← links)
- (Q3817659) (← links)
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected (Q3833624) (← links)
- (Q4038705) (← links)
- (Q4263810) (← links)
- A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications (Q4289841) (← links)
- General Techniques for Analyzing Recursive Algorithms with Applications (Q4337634) (← links)
- A theory of using history for equational systems with applications (Q4369888) (← links)
- (Q4418639) (← links)
- (Q4736511) (← links)
- Unique normal forms for nonlinear term rewriting systems: Root overlaps (Q5055958) (← links)
- Some complexity theoretic aspects of AC rewriting (Q5096174) (← links)
- New Undecidability Results for Properties of Term Rewrite Systems (Q5166638) (← links)
- A new decidability technique for ground term rewriting systems with applications (Q5277717) (← links)
- Uniqueness of Normal Forms for Shallow Term Rewrite Systems (Q5278216) (← links)