Rakesh M. Verma

	2009
47		Zhiyao Liang, Rakesh M. Verma: Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity. ICISS 2009: 101-116
	2008
46		Zhiyao Liang, Rakesh M. Verma: Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols. ARES 2008: 1067-1074
45		Ping Chen, Rakesh M. Verma, Janet C. Meininger, Wenyaw Chan: Semantic Analysis of Association Rules. FLAIRS Conference 2008: 270-275
44		Zhiyao Liang, Rakesh M. Verma: Complexity of Checking Freshness of Cryptographic Protocols. ICISS 2008: 86-101
43		Wenshan Yu, Rakesh M. Verma: Visualization of rule-based programming. SAC 2008: 1258-1259
	2006
42		Ping Chen, Rakesh M. Verma: A Query-Based Medical Information Summarization System Using Ontology Knowledge. CBMS 2006: 37-42
	2005
41		Rakesh M. Verma: A visual and interactive automata theory course emphasizing breadth of automata. ITiCSE 2005: 325-329
40		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)
	2004
39		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)
38		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)
37		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
36		Guillem Godoy, Ashish Tiwari, Rakesh M. Verma: On the Confluence of Linear Shallow Term Rewrite Systems. STACS 2003: 85-96
	2002
35		Rakesh M. Verma, Sanjiv Behl: K-tree/forest: efficient indexes for boolean queries. SIGIR 2002: 433-434
34		Rakesh M. Verma, Sarah Hwang: On the Structure of Counterexamples to Symmetric Orderings for BDD's. Electr. Notes Theor. Comput. Sci. 61: (2002)
33		Rakesh M. Verma: Algorithms and reductions for rewriting problems II. Inf. Process. Lett. 84(4): 227-233 (2002)
	2001
32		Sanjiv Behl, Rakesh M. Verma: Efficient declustering techniques for temporal access structures. ADC 2001: 91-98
31		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
30		Mark van den Brand, Rakesh M. Verma: RULE2001 - Foreword. Electr. Notes Theor. Comput. Sci. 59(4): (2001)
29		Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez: Algorithms and Reductions for Rewriting Problems. Fundam. Inform. 46(3): 257-276 (2001)
	2000
28		Rakesh M. Verma: Static Analysis Techniques for Equational Logic Programming CoRR cs.LO/0010034: (2000)
	1999
27		Rakesh M. Verma, Shalitha Senanayake: LarrowR2: A Laboratory fro Rapid Term Graph Rewriting. RTA 1999: 252-255
26		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)
	1998
25		Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma: RPO Constraint Solving Is in NP. CSL 1998: 385-398
24		Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez: Algorithms and Reductions for Rewriting Problems. RTA 1998: 166-180
	1997
23		Rakesh M. Verma: Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps. FCT 1997: 452-462
22		Peter J. Varman, Rakesh M. Verma: An Efficient Multiversion Access STructure. IEEE Trans. Knowl. Data Eng. 9(3): 391-409 (1997)
21		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)
20		Rakesh M. Verma: General Techniques for Analyzing Recursive Algorithms with Applications. SIAM J. Comput. 26(2): 568-581 (1997)
	1996
19		Peter J. Varman, Rakesh M. Verma: Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. FSTTCS 1996: 200-211
18		Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma: A New Combinatorial Approach to Optimal Embeddings of Rectangles. Algorithmica 16(2): 161-180 (1996)
	1995
17		Rakesh M. Verma: Unique Normal Forms and Confluence of Rewrite Systems: Persistence. IJCAI 1995: 362-370
16		Rakesh M. Verma: A Theory of Using History for Equational Systems with Applications. J. ACM 42(5): 984-1020 (1995)
15		Rakesh M. Verma: Transformations and Confluence for Rewrite Systems. Theor. Comput. Sci. 152(2): 269-283 (1995)
	1994
14		Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma: A New Combinatorial Approach to Optimal Embeddings of Rectangles. IPPS 1994: 715-722
13		Rakesh M. Verma: A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications. J. Algorithms 16(1): 67-79 (1994)
	1993
12		Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma: On Embeddings of Rectangles into Optimal Squares. ICPP 1993: 73-76
11		Rakesh M. Verma: Smaran: A Congruence-Closure Based System for Equational Computations. RTA 1993: 457-461
	1992
10		Rakesh M. Verma, I. V. Ramakrishnan: Tight Complexity Bounds for Term Matching Problems Inf. Comput. 101(1): 33-69 (1992)
9		Rakesh M. Verma: Strings, Trees, and Patterns. Inf. Process. Lett. 41(3): 157-161 (1992)
	1991
8		Rakesh M. Verma: A Theory of Using History for Equational Systems with Applications (Extended Abstract) FOCS 1991: 348-357
	1990
7		Rakesh M. Verma, I. V. Ramakrishnan: Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. ICALP 1990: 370-385
	1989
6		Rakesh M. Verma, I. V. Ramakrishnan: Some Complexity Theoretic Aspects of AC Rewriting. STACS 1989: 407-420
5		R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan: Term Matching on Parallel Computers. J. Log. Program. 6(3): 213-228 (1989)
4		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)
	1988
3		Rakesh M. Verma, I. V. Ramakrishnan: Optimal Time Bounds for Parallel Term Matching. CADE 1988: 694-703
	1987
2		R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan: Term Matching on Parallel Computers. ICALP 1987: 336-346
	1986
1		Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan: An Efficient Parallel Algorithm for Term Matching. FSTTCS 1986: 504-518

Coauthor Index

1	Samik Basu	[31]
2	Sanjiv Behl	[32] [35]
3	Mark van den Brand (M. G. J. van den Brand)	[30]
4	Wenyaw Chan	[45]
5	Ping Chen	[42] [45]
6	Guillem Godoy	[36] [38] [39]
7	Ara Hayrapetyan	[40]
8	Shou-Hsuan Stephen Huang	[12] [14] [18] [21]
9	Sarah Hwang	[34]
10	Zhiyao Liang	[44] [46] [47]
11	Hongfei Liu	[12] [14] [18] [21]
12	Denis Lugiez	[24] [29]
13	Bas Luttik (S. P. Luttik)	[37]
14	Janet C. Meininger	[45]
15	Madhavan Mukund	[31]
16	Paliath Narendran	[25]
17	C. R. Ramakrishnan	[31]
18	I. V. Ramakrishnan	[1] [2] [3] [5] [6] [7] [10] [31]
19	R. Ramesh	[2] [5]
20	Steven W. Reyner	[4]
21	Piet Rodenburg	[37]
22	Michaël Rusinowitch	[24] [25] [29]
23	Shalitha Senanayake	[27]
24	Krishnaprasad Thirunarayan	[1] [2] [5]
25	Ashish Tiwari	[36] [38] [39]
26	Peter J. Varman	[19] [22] [26]
27	Wenshan Yu	[43]

Colors in the list of coauthors