Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Rakesh M. Verma
2010 – today
- 2010
[j21]Julian Zinn, Rakesh M. Verma: A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems. Appl. Algebra Eng. Commun. Comput. 21(6): 459-485 (2010)- [c28]Nicholas Radcliffe, Rakesh M. Verma: Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems. FSTTCS 2010: 284-295
- [c27]Sam Blackshear, Rakesh M. Verma: R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks. SAC 2010: 1985-1992
2000 – 2009
- 2009
- [c26]Zhiyao Liang, Rakesh M. Verma: Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity. ICISS 2009: 101-116
- 2008
- [c25]Zhiyao Liang, Rakesh M. Verma: Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols. ARES 2008: 1067-1074
- [c24]Ping Chen, Rakesh M. Verma, Janet C. Meininger, Wenyaw Chan: Semantic Analysis of Association Rules. FLAIRS Conference 2008: 270-275
- [c23]Zhiyao Liang, Rakesh M. Verma: Complexity of Checking Freshness of Cryptographic Protocols. ICISS 2008: 86-101
- [c22]
- 2006
- [c21]
- 2005
- [j20]Rakesh M. Verma, Ara Hayrapetyan: A new decidability technique for ground term rewriting systems with applications. ACM Trans. Comput. Log. 6(1): 102-123 (2005)
- [c20]Rakesh M. Verma: A visual and interactive automata theory course emphasizing breadth of automata. ITiCSE 2005: 325-329
- 2004
- [j19]Guillem Godoy, Ashish Tiwari, Rakesh M. Verma: Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems. Appl. Algebra Eng. Commun. Comput. 15(1): 13-36 (2004)
- [j18]Guillem Godoy, Ashish Tiwari, Rakesh M. Verma: Deciding confluence of certain term rewriting systems in polynomial time. Ann. Pure Appl. Logic 130(1-3): 33-59 (2004)
- [j17]Bas Luttik, Piet Rodenburg, Rakesh M. Verma: Remarks on Thatte's transformation of term rewriting systems. Inf. Comput. 195(1-2): 66-87 (2004)
- 2003
- [c19]Guillem Godoy, Ashish Tiwari, Rakesh M. Verma: On the Confluence of Linear Shallow Term Rewrite Systems. STACS 2003: 85-96
- 2002
- [j16]Rakesh M. Verma, Sarah Hwang: On the Structure of Counterexamples to Symmetric Orderings for BDD's. Electr. Notes Theor. Comput. Sci. 61: 84-100 (2002)
- [j15]Rakesh M. Verma: Algorithms and reductions for rewriting problems II. Inf. Process. Lett. 84(4): 227-233 (2002)
- [c18]Rakesh M. Verma, Sanjiv Behl: K-tree/forest: efficient indexes for boolean queries. SIGIR 2002: 433-434
- 2001
- [j14]Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez: Algorithms and Reductions for Rewriting Problems. Fundam. Inform. 46(3): 257-276 (2001)
- [j13]Mark van den Brand, Rakesh M. Verma: RULE2001 - Foreword. Electr. Notes Theor. Comput. Sci. 59(4): 425-426 (2001)
- [c17]Sanjiv Behl, Rakesh M. Verma: Efficient declustering techniques for temporal access structures. ADC 2001: 91-98
- [c16]Samik Basu, Madhavan Mukund, C. R. Ramakrishnan, I. V. Ramakrishnan, Rakesh M. Verma: Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming. ICLP 2001: 166-180
- 2000
- [i1]Rakesh M. Verma: Static Analysis Techniques for Equational Logic Programming. CoRR cs.LO/0010034 (2000)
1990 – 1999
- 1999
- [j12]Peter J. Varman, Rakesh M. Verma: Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. IEEE Trans. Parallel Distrib. Syst. 10(12): 1262-1275 (1999)
- [c15]Rakesh M. Verma, Shalitha Senanayake: LarrowR2: A Laboratory fro Rapid Term Graph Rewriting. RTA 1999: 252-255
- 1998
- [c14]Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma: RPO Constraint Solving Is in NP. CSL 1998: 385-398
- [c13]Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez: Algorithms and Reductions for Rewriting Problems. RTA 1998: 166-180
- 1997
- [j11]Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma: On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio. Inf. Process. Lett. 63(3): 123-129 (1997)
- [j10]Rakesh M. Verma: General Techniques for Analyzing Recursive Algorithms with Applications. SIAM J. Comput. 26(2): 568-581 (1997)
- [j9]Peter J. Varman, Rakesh M. Verma: An Efficient Multiversion Access STructure. IEEE Trans. Knowl. Data Eng. 9(3): 391-409 (1997)
- [c12]Rakesh M. Verma: Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps. FCT 1997: 452-462
- 1996
- [j8]Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma: A New Combinatorial Approach to Optimal Embeddings of Rectangles. Algorithmica 16(2): 161-180 (1996)
- [c11]Peter J. Varman, Rakesh M. Verma: Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. FSTTCS 1996: 200-211
- 1995
- [j7]Rakesh M. Verma: A Theory of Using History for Equational Systems with Applications. J. ACM 42(5): 984-1020 (1995)
- [j6]Rakesh M. Verma: Transformations and Confluence for Rewrite Systems. Theor. Comput. Sci. 152(2): 269-283 (1995)
- [c10]Rakesh M. Verma: Unique Normal Forms and Confluence of Rewrite Systems: Persistence. IJCAI 1995: 362-370
- 1994
- [j5]Rakesh M. Verma: A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications. J. Algorithms 16(1): 67-79 (1994)
- [c9]Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma: A New Combinatorial Approach to Optimal Embeddings of Rectangles. IPPS 1994: 715-722
- 1993
- [c8]Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma: On Embeddings of Rectangles into Optimal Squares. ICPP 1993: 73-76
- [c7]Rakesh M. Verma: Smaran: A Congruence-Closure Based System for Equational Computations. RTA 1993: 457-461
- 1992
- [j4]Rakesh M. Verma, I. V. Ramakrishnan: Tight Complexity Bounds for Term Matching Problems. Inf. Comput. 101(1): 33-69 (1992)
- [j3]
- 1991
- [c6]Rakesh M. Verma: A Theory of Using History for Equational Systems with Applications (Extended Abstract). FOCS 1991: 348-357
- 1990
- [c5]Rakesh M. Verma, I. V. Ramakrishnan: Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. ICALP 1990: 370-385
1980 – 1989
- 1989
- [j2]R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan: Term Matching on Parallel Computers. J. Log. Program. 6(3): 213-228 (1989)
- [j1]Rakesh M. Verma, Steven W. Reyner: An Analysis of a Good Algorithm for the Subtree Problem, Corrected. SIAM J. Comput. 18(5): 906-908 (1989)
- [c4]Rakesh M. Verma, I. V. Ramakrishnan: Some Complexity Theoretic Aspects of AC Rewriting. STACS 1989: 407-420
- 1988
- [c3]Rakesh M. Verma, I. V. Ramakrishnan: Optimal Time Bounds for Parallel Term Matching. CADE 1988: 694-703
- 1987
- [c2]R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan: Term Matching on Parallel Computers. ICALP 1987: 336-346
- 1986
- [c1]Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan: An Efficient Parallel Algorithm for Term Matching. FSTTCS 1986: 504-518
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-14 16:49 CET by the dblp team