| 2010 |
|---|
| 50 | A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems. Julian Zinn, Rakesh M. Verma. Appl. Algebra Eng. Commun. Comput. (21): 459-485 (2010). Web SearchBibTeXDownload |
| 49 | Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems. Nicholas Radcliffe, Rakesh M. Verma. FSTTCS 2010, 284-295. Web SearchBibTeXDownload |
| 48 | R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks. Sam Blackshear, Rakesh M. Verma. SAC 2010, 1985-1992. Web SearchBibTeXDownload |
| 2009 |
|---|
| 47 | Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity. Zhiyao Liang, Rakesh M. Verma. ICISS 2009, 101-116. Web SearchBibTeXDownload |
| 2008 |
|---|
| 46 | Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols. Zhiyao Liang, Rakesh M. Verma. ARES 2008, 1067-1074. Web SearchBibTeXDownload |
| 45 | Semantic Analysis of Association Rules. Ping Chen, Rakesh M. Verma, Janet C. Meininger, Wenyaw Chan. FLAIRS Conference 2008, 270-275. Web SearchBibTeX |
| 44 | Complexity of Checking Freshness of Cryptographic Protocols. Zhiyao Liang, Rakesh M. Verma. ICISS 2008, 86-101. Web SearchBibTeXDownload |
| 43 | Visualization of rule-based programming. Wenshan Yu, Rakesh M. Verma. SAC 2008, 1258-1259. Web SearchBibTeXDownload |
| 2006 |
|---|
| 42 | A Query-Based Medical Information Summarization System Using Ontology Knowledge. Ping Chen, Rakesh M. Verma. CBMS 2006, 37-42. Web SearchBibTeXDownload |
| 2005 |
|---|
| 41 | A new decidability technique for ground term rewriting systems with applications. Rakesh M. Verma, Ara Hayrapetyan. ACM Trans. Comput. Log. (6): 102-123 (2005). Web SearchBibTeXDownload |
| 40 | A visual and interactive automata theory course emphasizing breadth of automata. Rakesh M. Verma. ITiCSE 2005, 325-329. Web SearchBibTeXDownload |
| 2004 |
|---|
| 39 | Deciding confluence of certain term rewriting systems in polynomial time. Guillem Godoy, Ashish Tiwari, Rakesh M. Verma. Ann. Pure Appl. Logic (130): 33-59 (2004). Web SearchBibTeXDownload |
| 38 | Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems. Guillem Godoy, Ashish Tiwari, Rakesh M. Verma. Appl. Algebra Eng. Commun. Comput. (15): 13-36 (2004). Web SearchBibTeXDownload |
| 37 | Remarks on Thatte's transformation of term rewriting systems. Bas Luttik, Piet Rodenburg, Rakesh M. Verma. Inf. Comput. (195): 66-87 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 36 | On the Confluence of Linear Shallow Term Rewrite Systems. Guillem Godoy, Ashish Tiwari, Rakesh M. Verma. STACS 2003, 85-96. Web SearchBibTeXDownload |
| 2002 |
|---|
| 35 | On the Structure of Counterexamples to Symmetric Orderings for BDD's. Rakesh M. Verma, Sarah Hwang. Electr. Notes Theor. Comput. Sci. (61): 84-100 (2002). Web SearchBibTeXDownload |
| 34 | Algorithms and reductions for rewriting problems II. Rakesh M. Verma. Inf. Process. Lett. (84): 227-233 (2002). Web SearchBibTeXDownload |
| 33 | K-tree/forest: efficient indexes for boolean queries. Rakesh M. Verma, Sanjiv Behl. SIGIR 2002, 433-434. Web SearchBibTeXDownload |
| 2001 |
|---|
| 32 | Efficient declustering techniques for temporal access structures. Sanjiv Behl, Rakesh M. Verma. ADC 2001, 91-98. Web SearchBibTeXDownload |
| 31 | RULE2001 - Foreword. Mark van den Brand, Rakesh M. Verma. Electr. Notes Theor. Comput. Sci. (59): 425-426 (2001). Web SearchBibTeXDownload |
| 30 | Algorithms and Reductions for Rewriting Problems. Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez. Fundam. Inform. (46): 257-276 (2001). Web SearchBibTeXDownload |
| 29 | Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming. Samik Basu, Madhavan Mukund, C. R. Ramakrishnan, I. V. Ramakrishnan, Rakesh M. Verma. ICLP 2001, 166-180. Web SearchBibTeXDownload |
| 2000 |
|---|
| 28 | Static Analysis Techniques for Equational Logic Programming. Rakesh M. Verma. CoRR (cs.LO/0010034) (2000). Web SearchBibTeXDownload |
| 1999 |
|---|
| 27 | Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. Peter J. Varman, Rakesh M. Verma. IEEE Trans. Parallel Distrib. Syst. (10): 1262-1275 (1999). Web SearchBibTeXDownload |
| 26 | LarrowR2: A Laboratory fro Rapid Term Graph Rewriting. Rakesh M. Verma, Shalitha Senanayake. RTA 1999, 252-255. Web SearchBibTeXDownload |
| 1998 |
|---|
| 25 | RPO Constraint Solving Is in NP. Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma. CSL 1998, 385-398. Web SearchBibTeXDownload |
| 24 | Algorithms and Reductions for Rewriting Problems. Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez. RTA 1998, 166-180. Web SearchBibTeXDownload |
| 1997 |
|---|
| 23 | Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps. Rakesh M. Verma. FCT 1997, 452-462. Web SearchBibTeXDownload |
| 22 | An Efficient Multiversion Access STructure. Peter J. Varman, Rakesh M. Verma. IEEE Trans. Knowl. Data Eng. (9): 391-409 (1997). Web SearchBibTeXDownload |
| 21 | On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio. Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma. Inf. Process. Lett. (63): 123-129 (1997). Web SearchBibTeXDownload |
| 20 | General Techniques for Analyzing Recursive Algorithms with Applications. Rakesh M. Verma. SIAM J. Comput. (26): 568-581 (1997). Web SearchBibTeXDownload |
| 1996 |
|---|
| 19 | A New Combinatorial Approach to Optimal Embeddings of Rectangles. Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma. Algorithmica (16): 161-180 (1996). Web SearchBibTeXDownload |
| 18 | Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. Peter J. Varman, Rakesh M. Verma. FSTTCS 1996, 200-211. Web SearchBibTeXDownload |
| 1995 |
|---|
| 17 | Unique Normal Forms and Confluence of Rewrite Systems: Persistence. Rakesh M. Verma. IJCAI 1995, 362-370. Web SearchBibTeX |
| 16 | A Theory of Using History for Equational Systems with Applications. Rakesh M. Verma. J. ACM (42): 984-1020 (1995). Web SearchBibTeXDownload |
| 15 | Transformations and Confluence for Rewrite Systems. Rakesh M. Verma. Theor. Comput. Sci. (152): 269-283 (1995). Web SearchBibTeXDownload |
| 1994 |
|---|
| 14 | A New Combinatorial Approach to Optimal Embeddings of Rectangles. Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma. IPPS 1994, 715-722. Web SearchBibTeX |
| 13 | A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications. Rakesh M. Verma. J. Algorithms (16): 67-79 (1994). Web SearchBibTeXDownload |
| 1993 |
|---|
| 12 | On Embeddings of Rectangles into Optimal Squares. Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma. ICPP 1993, 73-76. Web SearchBibTeX |
| 11 | Smaran: A Congruence-Closure Based System for Equational Computations. Rakesh M. Verma. RTA 1993, 457-461. Web SearchBibTeXDownload |
| 1992 |
|---|
| 10 | Tight Complexity Bounds for Term Matching Problems. Rakesh M. Verma, I. V. Ramakrishnan. Inf. Comput. (101): 33-69 (1992). Web SearchBibTeXDownload |
| 9 | Strings, Trees, and Patterns. Rakesh M. Verma. Inf. Process. Lett. (41): 157-161 (1992). Web SearchBibTeXDownload |
| 1991 |
|---|
| 8 | A Theory of Using History for Equational Systems with Applications (Extended Abstract). Rakesh M. Verma. FOCS 1991, 348-357. Web SearchBibTeXDownload |
| 1990 |
|---|
| 7 | Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. Rakesh M. Verma, I. V. Ramakrishnan. ICALP 1990, 370-385. Web SearchBibTeXDownload |
| 1989 |
|---|
| 6 | Term Matching on Parallel Computers. R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan. J. Log. Program. (6): 213-228 (1989). Web SearchBibTeXDownload |
| 5 | An Analysis of a Good Algorithm for the Subtree Problem, Corrected. Rakesh M. Verma, Steven W. Reyner. SIAM J. Comput. (18): 906-908 (1989). Web SearchBibTeXDownload |
| 4 | Some Complexity Theoretic Aspects of AC Rewriting. Rakesh M. Verma, I. V. Ramakrishnan. STACS 1989, 407-420. Web SearchBibTeXDownload |
| 1988 |
|---|
| 3 | Optimal Time Bounds for Parallel Term Matching. Rakesh M. Verma, I. V. Ramakrishnan. CADE 1988, 694-703. Web SearchBibTeXDownload |
| 1987 |
|---|
| 2 | Term Matching on Parallel Computers. R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan. ICALP 1987, 336-346. Web SearchBibTeXDownload |
| 1986 |
|---|
| 1 | An Efficient Parallel Algorithm for Term Matching. Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan. FSTTCS 1986, 504-518. Web SearchBibTeXDownload |
