Reflecting BDDs in Coq. - Kumar Neeraj Verma; Jean Goubault-Larrecq; Sanjiva Prasad; S. Arun-Kumar (ASIAN, 2000)

On Closure under Complementation of Equational Tree Automata for Theories Extending AC. - Kumar Neeraj Verma (LPAR, 2003)

Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. - Kumar Neeraj Verma (RTA, 2003)

Alternation in Equational Tree Automata Modulo XOR. - Kumar Neeraj Verma (FSTTCS, 2004)

On the Complexity of Equational Horn Clauses. - Kumar Neeraj Verma; Helmut Seidl; Thomas Schwentick (CADE, 2005)

Karp-Miller Trees for a Branching Extension of VASS. - Kumar Neeraj Verma; Jean Goubault-Larrecq (Discret. Math. Theor. Comput. Sci., 2005)

Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. - Jean Goubault-Larrecq; Muriel Roger; Kumar Neeraj Verma (J. Log. Algebraic Methods Program., 2005)

Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. - Helmut Seidl; Kumar Neeraj Verma (Program Analysis and Compilation, 2006)

Alternating two-way AC-tree automata. - Kumar Neeraj Verma; Jean Goubault-Larrecq (Inf. Comput., 2007)

Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. - Helmut Seidl; Kumar Neeraj Verma (ACM Trans. Comput. Log., 2008)

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. - Helmut Seidl; Kumar Neeraj Verma (RTA, 2009)

Normalization of Linear Horn Clauses. - Thomas Martin Gawlitza; Helmut Seidl; Kumar Neeraj Verma (SBMF, 2010)