Rakesh M. Verma

Available identifiers

zbMath Open verma.rakesh-mMaRDI QIDQ287152

List of research outcomes

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	2022-12-09	Paper
Some complexity theoretic aspects of AC rewriting	2022-08-16	Paper
Uniqueness of Normal Forms for Shallow Term Rewrite Systems	2017-07-13	Paper
A new decidability technique for ground term rewriting systems with applications	2017-07-12	Paper
On embedding rectangular meshes into rectangular meshes of smaller aspect ratio	2016-05-26	Paper
New Undecidability Results for Properties of Term Rewrite Systems	2014-06-27	Paper
On the structure of counterexamples to symmetric orderings for BDD's	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	2010-12-21	Paper
Selection of vendor using analytical hierarchy process based on fuzzy preference programming	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	2009-06-30	Paper
Remarks on Thatte's transformation of term rewriting systems	2005-02-22	Paper
Deciding confluence of certain term rewriting systems in polynomial time	2004-11-18	Paper
Characterizing confluence by rewrite closure and right ground term rewrite systems	2004-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4736511	2004-08-09	Paper
https://portal.mardi4nfdi.de/entity/Q4418639	2003-08-11	Paper
Algorithms and reductions for rewriting problems. II.	2003-01-21	Paper
Algorithms and reductions for rewriting problems	2002-07-14	Paper
https://portal.mardi4nfdi.de/entity/Q4263810	1999-09-22	Paper
A theory of using history for equational systems with applications	1998-01-28	Paper
General Techniques for Analyzing Recursive Algorithms with Applications	1997-05-26	Paper
Transformations and confluence for rewrite systems	1997-02-27	Paper
A new combinatorial approach to optimal embeddings of rectangles	1996-10-20	Paper
A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications	1995-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q4038705	1993-05-18	Paper
Tight complexity bounds for term matching problems	1993-01-17	Paper
Strings, trees, and patterns	1992-06-28	Paper
An Analysis of a Good Algorithm for the Subtree Problem, Corrected	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3817659	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3761692	1986-01-01	Paper

Research outcomes over time

This page was built for person: Rakesh M. Verma