The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rakesh M. Verma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  43. Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols. [Citation Graph (, )][DBLP]


  44. Semantic Analysis of Association Rules. [Citation Graph (, )][DBLP]


  45. Complexity of Checking Freshness of Cryptographic Protocols. [Citation Graph (, )][DBLP]


  46. Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity. [Citation Graph (, )][DBLP]


  47. Visualization of rule-based programming. [Citation Graph (, )][DBLP]


  48. R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002