Kumar Neeraj Verma
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
3
Venues
2
Active years
2003–2005
Best venue rank
B
Where they publish
Papers
3 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2005 | CADE | On the Complexity of Equational Horn Clauses. | Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick |
| 2004 | LPAR | Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. | Helmut Seidl, Kumar Neeraj Verma |
| 2003 | LPAR | On Closure under Complementation of Equational Tree Automata for Theories Extending AC. | Kumar Neeraj Verma |