default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKumar Neeraj Verma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c9]Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma:
Normalization of Linear Horn Clauses. SBMF 2010: 242-257
2000 – 2009
- 2009
- [c8]Helmut Seidl, Kumar Neeraj Verma:
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. RTA 2009: 118-132 - 2008
- [j4]Helmut Seidl, Kumar Neeraj Verma:
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. ACM Trans. Comput. Log. 9(4): 28:1-28:45 (2008) - 2007
- [j3]Kumar Neeraj Verma, Jean Goubault-Larrecq:
Alternating two-way AC-tree automata. Inf. Comput. 205(6): 817-869 (2007) - 2006
- [c7]Helmut Seidl, Kumar Neeraj Verma:
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. Program Analysis and Compilation 2006: 97-119 - 2005
- [j2]Kumar Neeraj Verma, Jean Goubault-Larrecq
:
Karp-Miller Trees for a Branching Extension of VASS. Discret. Math. Theor. Comput. Sci. 7(1): 217-230 (2005) - [j1]Jean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma:
Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. J. Log. Algebraic Methods Program. 64(2): 219-251 (2005) - [c6]Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick:
On the Complexity of Equational Horn Clauses. CADE 2005: 337-352 - [i1]Helmut Seidl, Kumar Neeraj Verma:
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. CoRR abs/cs/0511014 (2005) - 2004
- [c5]Kumar Neeraj Verma:
Alternation in Equational Tree Automata Modulo XOR. FSTTCS 2004: 518-530 - [c4]Helmut Seidl, Kumar Neeraj Verma:
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. LPAR 2004: 79-94 - 2003
- [c3]Kumar Neeraj Verma:
On Closure under Complementation of Equational Tree Automata for Theories Extending AC. LPAR 2003: 183-197 - [c2]Kumar Neeraj Verma:
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. RTA 2003: 180-196 - 2000
- [c1]Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar:
Reflecting BDDs in Coq. ASIAN 2000: 162-181
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
