Welcome to DiSC 2003
SIGMOD 2002
PODS 2002
 SIGMOD RECORD 2002
 ADBIS 2002
CIKM 2002
CoopIS 2002
 EDBT 2002
 ER 2002
Data Engineering Bul
DEXA_EC-WEB 2002
DMKD 2002
 DPDJ 2002
HYPERTEXT 2002
ICDE 2002
ICDM 2002
JCDL 2002
KDD 2002
 KDD_EXPLORATIONS 20
KRDB 2002
MDM 2002
MIS 2002
RIDE 2002
SBBD 2002
 SIGIR 2002
 SIGIR FORUM 2002
SSDBM 2002
TODS 2002
TIME 2002
VLDB 2002
VLDBJ 2002
About DiSC 2003
Editorial Board
Acknowledgements
DiSC 2003 Production
ADVIS
DiSC'03 Feedback
DiSC'03 Sitemap
Search DiSC'03
<<<Author Index>>>
Copyright Notice

Rakesh M. Verma

Papers on DiSC'03


K-tree/forest: efficient indexes for boolean queries

Publications


Note: Links lead to the DBLP on the Web.

Rakesh M. Verma

32 Rakesh M. Verma, Sanjiv Behl : K-tree/forest: efficient indexes for boolean queries. SIGIR 2002 : 433-434

31 Sanjiv Behl , Rakesh M. Verma: Efficient declustering techniques for temporal access structures. ADC 2001 : 91-98

30 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

29 Mark van den Brand , Rakesh M. Verma: RULE2001 - Foreword. Electronic Notes in Theoretical Computer Science 59 (4): (2001)

28 Rakesh M. Verma, Michaël Rusinowitch , Denis Lugiez : Algorithms and Reductions for Rewriting Problems. Fundamenta Informaticae 46 (3): 257-276 (2001)

27 Rakesh M. Verma, Shalitha Senanayake : L arrow R 2 : 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 Transactions on Parallel and Distributed Systems 10 (12): 1262-1275 (1999)

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

23 Rakesh M. Verma: Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps. FCT 1997 : 452-462

22 Shou-Hsuan Stephen Huang , Hongfei Liu , Rakesh M. Verma: On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio. Information Processing Letters 63 (3): 123-129 (1997)

21 Rakesh M. Verma: General Techniques for Analyzing Recursive Algorithms with Applications. SIAM J. Comput. 26 (2): 568-581 (1997)

20 Peter J. Varman , Rakesh M. Verma: An Efficient Multiversion Access STructure. TKDE 9 (3): 391-409 (1997)

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)

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. JACM 42 (5): 984-1020 (1995)

15 Rakesh M. Verma: Transformations and Confluence for Rewrite Systems. TCS 152 (2): 269-283 (1995)

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)

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

10 Rakesh M. Verma: Strings, Trees, and Patterns. Information Processing Letters 41 (3): 157-161 (1992)

9 Rakesh M. Verma, I. V. Ramakrishnan : Tight Complexity Bounds for Term Matching Problems. Information and Computation 101 (1): 33-69 (1992)

8 Rakesh M. Verma: A Theory of Using History for Equational Systems with Applications (Extended Abstract). FOCS 1991 : 348-357

7 Rakesh M. Verma, I. V. Ramakrishnan : Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. ICALP 1990 : 370-385

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. JLP 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)

3 Rakesh M. Verma, I. V. Ramakrishnan : Optimal Time Bounds for Parallel Term Matching. CADE 1988 : 694-703

2 R. Ramesh , Rakesh M. Verma, Krishnaprasad Thirunarayan , I. V. Ramakrishnan : Term Matching on Parallel Computers. ICALP 1987 : 336-346

1 Rakesh M. Verma, Krishnaprasad Thirunarayan , I. V. Ramakrishnan : An Efficient Parallel Algorithm for Term Matching. FSTTCS 1986 : 504-518




DiSC'03 © 2003 Association for Computing Machinery