Kumar Neeraj Verma Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Seidl, Kumar Neeraj Verma: Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. RTA 2009: 118-132
2008
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Seidl, Kumar Neeraj Verma: Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. ACM Trans. Comput. Log. 9(4): (2008)
2007
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKumar Neeraj Verma, Jean Goubault-Larrecq: Alternating two-way AC-tree automata. Inf. Comput. 205(6): 817-869 (2007)
2006
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Seidl, Kumar Neeraj Verma: Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. Program Analysis and Compilation 2006: 97-119
2005
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKumar Neeraj Verma, Helmut Seidl, Thomas Schwentick: On the Complexity of Equational Horn Clauses. CADE 2005: 337-352
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Seidl, Kumar Neeraj Verma: Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying CoRR abs/cs/0511014: (2005)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKumar Neeraj Verma, Jean Goubault-Larrecq: Karp-Miller Trees for a Branching Extension of VASS. Discrete Mathematics & Theoretical Computer Science 7(1): 217-230 (2005)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma: Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. J. Log. Algebr. Program. 64(2): 219-251 (2005)
2004
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKumar Neeraj Verma: Alternation in Equational Tree Automata Modulo XOR. FSTTCS 2004: 518-530
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Seidl, Kumar Neeraj Verma: Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. LPAR 2004: 79-94
2003
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKumar Neeraj Verma: On Closure under Complementation of Equational Tree Automata for Theories Extending AC. LPAR 2003: 183-197
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKumar Neeraj Verma: Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. RTA 2003: 180-196
2000
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar: Reflecting BDDs in Coq. ASIAN 2000: 162-181

Coauthor Index

1S. Arun-Kumar [1]
2Jean Goubault-Larrecq (Jean Goubault) [1] [6] [7] [11]
3Sanjiva Prasad [1]
4Muriel Roger [6]
5Thomas Schwentick [9]
6Helmut Seidl [4] [8] [9] [10] [12] [13]

Colors in the list of coauthors

Copyright © Wed Nov 25 14:46:41 2009 by Michael Ley (ley@uni-trier.de)