The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kumar Neeraj Verma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar
    Reflecting BDDs in Coq. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2000, pp:162-181 [Conf]
  2. Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
    On the Complexity of Equational Horn Clauses. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:337-352 [Conf]
  3. Kumar Neeraj Verma
    Alternation in Equational Tree Automata Modulo XOR. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:518-530 [Conf]
  4. Helmut Seidl, Kumar Neeraj Verma
    Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:79-94 [Conf]
  5. Kumar Neeraj Verma
    On Closure under Complementation of Equational Tree Automata for Theories Extending AC. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:183-197 [Conf]
  6. Kumar Neeraj Verma
    Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:180-196 [Conf]
  7. Jean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma
    Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:64, n:2, pp:219-251 [Journal]
  8. Helmut Seidl, Kumar Neeraj Verma
    Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. [Citation Graph (0, 0)][DBLP]
    Program Analysis and Compilation, 2006, pp:97-119 [Conf]
  9. Kumar Neeraj Verma, Jean Goubault-Larrecq
    Karp-Miller Trees for a Branching Extension of VASS. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:217-230 [Journal]
  10. Kumar Neeraj Verma, Jean Goubault-Larrecq
    Alternating two-way AC-tree automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:6, pp:817-869 [Journal]

  11. Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. [Citation Graph (, )][DBLP]


  12. Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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