| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Julian Zinn, Rakesh M. Verma |
A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems.  |
Appl. Algebra Eng. Commun. Comput.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sam Blackshear, Rakesh M. Verma |
R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks. |
SAC |
2010 |
DBLP DOI BibTeX RDF |
key distribution protocols, wireless sensor networks |
| 1 | Nicholas Radcliffe, Rakesh M. Verma |
Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiyao Liang, Rakesh M. Verma |
Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity. |
ICISS |
2009 |
DBLP DOI BibTeX RDF |
insecurity, Cryptographic protocols, secrecy, NP |
| 1 | Wenshan Yu, Rakesh M. Verma |
Visualization of rule-based programming. |
SAC |
2008 |
DBLP DOI BibTeX RDF |
module, expression, graphical interface, rule-based programming |
| 1 | Zhiyao Liang, Rakesh M. Verma |
Complexity of Checking Freshness of Cryptographic Protocols. |
ICISS |
2008 |
DBLP DOI BibTeX RDF |
Athena, NP-completeness, Cryptographic protocols, undecidability, replay attack, model checker, freshness, challenge response |
| 1 | Ping Chen, Rakesh M. Verma, Janet C. Meininger, Wenyaw Chan |
Semantic Analysis of Association Rules. |
FLAIRS Conference |
2008 |
DBLP BibTeX RDF |
|
| 1 | Zhiyao Liang, Rakesh M. Verma |
Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols. |
ARES |
2008 |
DBLP DOI BibTeX RDF |
insider, authentication, formal method, cryptographic protocol, undecidability, secrecy |
| 1 | Ping Chen, Rakesh M. Verma |
A Query-Based Medical Information Summarization System Using Ontology Knowledge. |
CBMS |
2006 |
DBLP DOI BibTeX RDF |
Information Retrieval, Text Summarization, UMLS, Biomedical Ontology |
| 1 | Rakesh M. Verma, Ara Hayrapetyan |
A new decidability technique for ground term rewriting systems with applications. |
ACM Trans. Comput. Log. |
2005 |
DBLP DOI BibTeX RDF |
standard forms, unique normalization, decision procedures, rewriting, Confluence, pumping lemma |
| 1 | Rakesh M. Verma |
A visual and interactive automata theory course emphasizing breadth of automata. |
ITiCSE |
2005 |
DBLP DOI BibTeX RDF |
string automata, formal languages, tree automata, rule-based programming |
| 1 | Bas Luttik, Piet Rodenburg, Rakesh M. Verma |
Remarks on Thatte's transformation of term rewriting systems. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillem Godoy, Ashish Tiwari, Rakesh M. Verma |
Deciding confluence of certain term rewriting systems in polynomial time. |
Ann. Pure Appl. Logic |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillem Godoy, Ashish Tiwari, Rakesh M. Verma |
Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems. |
Appl. Algebra Eng. Commun. Comput. |
2004 |
DBLP DOI BibTeX RDF |
Rewriting, Confluence, Terms |
| 1 | Guillem Godoy, Ashish Tiwari, Rakesh M. Verma |
On the Confluence of Linear Shallow Term Rewrite Systems. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma |
Algorithms and reductions for rewriting problems II. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma, Sarah Hwang |
On the Structure of Counterexamples to Symmetric Orderings for BDD's. |
Electr. Notes Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma, Sanjiv Behl |
K-tree/forest: efficient indexes for boolean queries. |
SIGIR |
2002 |
DBLP DOI BibTeX RDF |
keyword tree, keyword-based retrieval, parallelization, indexing |
| 1 | Mark van den Brand, Rakesh M. Verma |
RULE2001 - Foreword. |
Electr. Notes Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez |
Algorithms and Reductions for Rewriting Problems. |
Fundam. Inform. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Samik Basu, Madhavan Mukund, C. R. Ramakrishnan, I. V. Ramakrishnan, Rakesh M. Verma |
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming. |
ICLP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjiv Behl, Rakesh M. Verma |
Efficient declustering techniques for temporal access structures. |
ADC |
2001 |
DBLP DOI BibTeX RDF |
parallelization, temporal databases, access methods, declustering |
| 1 | Rakesh M. Verma |
Static Analysis Techniques for Equational Logic Programming |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Peter J. Varman, Rakesh M. Verma |
Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. |
IEEE Trans. Parallel Distrib. Syst. |
1999 |
DBLP DOI BibTeX RDF |
multiple-disk systems, algorithms, caching, prefetching, Parallel I/O, buffer management, competitive ratio, external memory |
| 1 | Rakesh M. Verma, Shalitha Senanayake |
LarrowR2: A Laboratory fro Rapid Term Graph Rewriting. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez |
Algorithms and Reductions for Rewriting Problems. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma |
RPO Constraint Solving Is in NP. |
CSL |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter J. Varman, Rakesh M. Verma |
An Efficient Multiversion Access STructure. |
IEEE Trans. Knowl. Data Eng. |
1997 |
DBLP DOI BibTeX RDF |
Transaction-time database, I/O complexity, data structures, indexing, access methods, multidimensional data |
| 1 | Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma |
On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma |
General Techniques for Analyzing Recursive Algorithms with Applications. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma |
Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps. |
FCT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma |
A New Combinatorial Approach to Optimal Embeddings of Rectangles. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter J. Varman, Rakesh M. Verma |
Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. |
FSTTCS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma |
Transformations and Confluence for Rewrite Systems. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma |
A Theory of Using History for Equational Systems with Applications. |
J. ACM |
1995 |
DBLP DOI BibTeX RDF |
congruence-closure algorithm, rewrite system transformation, term rewrite systems, proof theory, equational logic |
| 1 | Rakesh M. Verma |
Unique Normal Forms and Confluence of Rewrite Systems: Persistence. |
IJCAI |
1995 |
DBLP BibTeX RDF |
|
| 1 | Rakesh M. Verma |
A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications. |
J. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma |
A New Combinatorial Approach to Optimal Embeddings of Rectangles. |
IPPS |
1994 |
DBLP BibTeX RDF |
|
| 1 | Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma |
On Embeddings of Rectangles into Optimal Squares. |
ICPP |
1993 |
DBLP BibTeX RDF |
|
| 1 | Rakesh M. Verma |
Smaran: A Congruence-Closure Based System for Equational Computations. |
RTA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma |
Strings, Trees, and Patterns. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma, I. V. Ramakrishnan |
Tight Complexity Bounds for Term Matching Problems |
Inf. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma |
A Theory of Using History for Equational Systems with Applications (Extended Abstract) |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
translation scheme, equational systems, congruence closure based simplifier, consistent convergent systems, priority rewrite systems, normal forms |
| 1 | Rakesh M. Verma, I. V. Ramakrishnan |
Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. |
ICALP |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan |
Term Matching on Parallel Computers. |
J. Log. Program. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma, Steven W. Reyner |
An Analysis of a Good Algorithm for the Subtree Problem, Corrected. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma, I. V. Ramakrishnan |
Some Complexity Theoretic Aspects of AC Rewriting. |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma, I. V. Ramakrishnan |
Optimal Time Bounds for Parallel Term Matching. |
CADE |
1988 |
DBLP DOI BibTeX RDF |
optimal bounds, parallel term matching, complexity |
| 1 | R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan |
Term Matching on Parallel Computers. |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan |
An Efficient Parallel Algorithm for Term Matching. |
FSTTCS |
1986 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")