default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikhil Balaji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c15]Rida Ait El Manssour, Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
A parametric version of the Hilbert Nullstellensatz. SOSA 2025: 444-451- 2024
- [c14]Nikhil Balaji
, Samir Datta:
USSR is in P/poly. SOSA 2024: 151-159 - [i17]Rida Ait El Manssour, Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
A parametric version of the Hilbert Nullstellensatz. CoRR abs/2408.13027 (2024) - 2023
- [j2]Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap:
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. Comput. 12(2): 145-173 (2023) - [c13]Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Multiplicity Problems on Algebraic Series and Context-Free Grammars. LICS 2023: 1-12 - [i16]Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Multiplicity Problems on Algebraic Series and Context-Free Grammars. CoRR abs/2304.14145 (2023) - [i15]Nikhil Balaji, Samir Datta:
USSR is in P/poly. CoRR abs/2310.19335 (2023) - [i14]Nikhil Balaji, Samir Datta:
USSR is in P/poly. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c12]Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Identity Testing for Radical Expressions. LICS 2022: 8:1-8:11 - [i13]Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Identity testing for radical expressions. CoRR abs/2202.07961 (2022) - [i12]Nikhil Balaji, Florian Luca:
Terms of Lucas sequences having a large smooth divisor. CoRR abs/2203.12364 (2022) - [i11]Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap:
On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c11]Nikhil Balaji, Sylvain Perifel, Mahsa Shirmohammadi, James Worrell:
Cyclotomic Identity Testing and Applications. ISSAC 2021: 35-42 - 2020
- [j1]Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew circuits of small width. Theor. Comput. Sci. 821: 111-123 (2020) - [c10]S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas:
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. STACS 2020: 37:1-37:18 - [i10]Nikhil Balaji, Sylvain Perifel, Mahsa Shirmohammadi, James Worrell:
Cyclotomic Identity Testing and Applications. CoRR abs/2007.13179 (2020)
2010 – 2019
- 2019
- [c9]Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi:
On the Complexity of Value Iteration. ICALP 2019: 102:1-102:15 - 2018
- [i9]Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi:
On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes. CoRR abs/1807.04920 (2018) - 2017
- [c8]S. Akshay, Nikhil Balaji, Nikhil Vyas:
Complexity of Restricted Variants of Skolem and Related Problems. MFCS 2017: 78:1-78:14 - 2016
- [c7]Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder:
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. MFCS 2016: 17:1-17:14 - [i8]Nikhil Balaji, Nutan Limaye, Srikanth Srinivasan:
An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c6]Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew Circuits of Small Width. COCOON 2015: 199-210 - [c5]Nikhil Balaji, Samir Datta, Venkatesh Ganesan:
Counting Euler Tours in Undirected Bounded Treewidth Graphs. FSTTCS 2015: 246-260 - [c4]Nikhil Balaji, Samir Datta:
Bounded Treewidth and Space-Efficient Linear Algebra. TAMC 2015: 297-308 - [i7]Nikhil Balaji, Samir Datta, Venkatesh Ganesan:
Counting Euler Tours in Undirected Bounded Treewidth Graphs. CoRR abs/1510.04035 (2015) - [i6]Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder:
Graph properties in node-query setting: effect of breaking symmetry. CoRR abs/1510.08267 (2015) - 2014
- [c3]Kavita Asnani, Douglas Vaz, Tanay PrabhuDesai, Surabhi Borgikar, Megha Bisht, Sharvari Bhosale, Nikhil Balaji:
Sentence Completion Using Text Prediction Systems. FICTA (1) 2014: 397-404 - [c2]Eric Allender, Nikhil Balaji, Samir Datta:
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. MFCS (2) 2014: 13-24 - [c1]Nikhil Balaji, Samir Datta:
Collapsing Exact Arithmetic Hierarchies. WALCOM 2014: 273-285 - [i5]Nikhil Balaji, Samir Datta:
Bounded Treewidth and Space-Efficient Linear Algebra. CoRR abs/1412.2470 (2014) - [i4]Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew Circuits of Small Width. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i3]Nikhil Balaji, Samir Datta:
Tree-width and Logspace: Determinants and Counting Euler Tours. CoRR abs/1312.7468 (2013) - [i2]Eric Allender, Nikhil Balaji, Samir Datta:
Low-depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. Electron. Colloquium Comput. Complex. TR13 (2013) - [i1]Nikhil Balaji, Samir Datta:
Collapsing Exact Arithmetic Hierarchies. Electron. Colloquium Comput. Complex. TR13 (2013)
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 2025-03-11 21:07 CET 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:
