default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikhil Gupta 0008
Person information
- affiliation: Boston College, Chestnut Hill, MA, USA
- affiliation: Indian Institute of Science, Department of Computer Science and Automation, Bangalore, India
Other persons with the same name
- Nikhil Gupta — disambiguation page
- Nikhil Gupta 0001 — Concordia University, Montreal, QUE, Canada
- Nikhil Gupta 0002
![[0000-0001-7128-4459]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-7128-4459")
— New York University, Tandon School of Engineering, Center for Cybersecurity, Department of Mechanical and Aerospace Engineering, NY, USA (and 1 more) - Nikhil Gupta 0003 — Malaviya National Institute of Technology Jaipur, Department of Electrical Engineering, Rajasthan, India
- Nikhil Gupta 0004 — Texas A&M University, College Station, TX, USA
- Nikhil Gupta 0005 — Florida A&M University, Tallahassee, FL, USA
- Nikhil Gupta 0006 — Indian Institute of Technology Kanpur, Department of Electrical Engineering, India
- Nikhil Gupta 0007 — LimeChat, Gurgaon, India (and 1 more)
- Nikhil Gupta 0009 — University of Waterloo, ON, Canada
- Nikhil Gupta 0010 — Magna Electronics Vision Center, Brampton, ONT, Canada
- Nikhil Gupta 0011 — Halodi Robotics, Moss, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Pranav Bisht, Nikhil Gupta, Prajakta Nimbhorkar, Ilya Volkovich:
Launching Identity Testing into (Bounded) Space. Electron. Colloquium Comput. Complex. TR24 (2024)- 2023
- [c5]Pranav Bisht, Nikhil Gupta, Ilya Volkovich:
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. FSTTCS 2023: 9:1-9:23 - [c4]Nikhil Gupta, Chandan Saha, Bhargav Thankey:
Equivalence Test for Read-Once Arithmetic Formulas. SODA 2023: 4205-4272 - [i5]Pranav Bisht, Nikhil Gupta, Ilya Volkovich:
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i4]Nikhil Gupta, Chandan Saha, Bhargav Thankey:
Equivalence Test for Read-Once Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR22 (2022) - 2020
- [c3]Nikhil Gupta, Chandan Saha, Bhargav Thankey:
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. CCC 2020: 23:1-23:31 - [i3]Nikhil Gupta, Chandan Saha, Bhargav Thankey:
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c2]Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha:
Determinant Equivalence Test over Finite Fields and over Q. ICALP 2019: 62:1-62:15 - [c1]Nikhil Gupta, Chandan Saha:
On the Symmetries of and Equivalence Test for Design Polynomials. MFCS 2019: 53:1-53:16 - [i2]Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha:
Determinant equivalence test over finite fields and over ℚ. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i1]Nikhil Gupta, Chandan Saha:
On the symmetries of design polynomials. Electron. Colloquium Comput. Complex. TR18 (2018)
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-08-10 01:21 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:
