( en | de | ru )

 

Disambiguation of "Verma, Neeraj Kumar"

Author of the publication

copydeleteadd this publication to your clipboard
TABLE DRIVEN ROUTING PROTOCOLS FOR AD HOC MOBILE NETWORK

, , , , and . (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sushil Kumar Verma

Sushil Kumar Verma

Rajeev Kumar Verma

Neeraj Tiwari

Neeraj Mishra

 

Other publications of authors with the same name

Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.. RTA, volume 2706 of Lecture Notes in Computer Science, page 180-196. Springer, (2003)TABLE DRIVEN ROUTING PROTOCOLS FOR AD HOC MOBILE NETWORK, , , , and . (2014)Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying., and . ACM Trans. Comput. Log., 9 (4): 28:1-28:45 (2008)Alternation in Equational Tree Automata Modulo XOR.. FSTTCS, volume 3328 of Lecture Notes in Computer Science, page 518-530. Springer, (2004)Alternating two-way AC-tree automata., and . Inf. Comput., 205 (6): 817-869 (2007)Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying, and . CoRR, (2005)Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying., and . LPAR, volume 3452 of Lecture Notes in Computer Science, page 79-94. Springer, (2004)On Closure under Complementation of Equational Tree Automata for Theories Extending AC.. LPAR, volume 2850 of Lecture Notes in Computer Science, page 183-197. Springer, (2003)Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case., and . RTA, volume 5595 of Lecture Notes in Computer Science, page 118-132. Springer, (2009)Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses., and . Program Analysis and Compilation, volume 4444 of Lecture Notes in Computer Science, page 97-119. Springer, (2006)