Tree-width and Logspace: Determinants and Counting Euler Tours. - Nikhil Balaji; Samir Datta (CoRR, 2013)

Low-depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. - Eric Allender; Nikhil Balaji; Samir Datta (Electron. Colloquium Comput. Complex., 2013)

Collapsing Exact Arithmetic Hierarchies. - Nikhil Balaji; Samir Datta (Electron. Colloquium Comput. Complex., 2013)

Sentence Completion Using Text Prediction Systems. - Kavita Asnani; Douglas Vaz; Tanay PrabhuDesai; Surabhi Borgikar; Megha Bisht; Sharvari Bhosale; Nikhil Balaji (FICTA (1), 2014)

Counting Euler Tours in Undirected Bounded Treewidth Graphs. - Nikhil Balaji; Samir Datta; Venkatesh Ganesan (FSTTCS, 2015)

Bounded Treewidth and Space-Efficient Linear Algebra. - Nikhil Balaji; Samir Datta (TAMC, 2015)

Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. - Nikhil Balaji; Samir Datta; Raghav Kulkarni; Supartha Podder (MFCS, 2016)

An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. - Nikhil Balaji; Nutan Limaye; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2016)

Complexity of Restricted Variants of Skolem and Related Problems. - S. Akshay 001; Nikhil Balaji; Nikhil Vyas 001 (MFCS, 2017)

On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes. - Nikhil Balaji; Stefan Kiefer; Petr Novotný 001; Guillermo A. Pérez 001; Mahsa Shirmohammadi (CoRR, 2018)

On the Complexity of Value Iteration. - Nikhil Balaji; Stefan Kiefer; Petr Novotný 001; Guillermo A. Pérez 001; Mahsa Shirmohammadi (ICALP, 2019)

Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. - S. Akshay 001; Nikhil Balaji; Aniket Murhekar; Rohith Varma; Nikhil Vyas 001 (STACS, 2020)

Skew circuits of small width. - Nikhil Balaji; Andreas Krebs; Nutan Limaye (Theor. Comput. Sci., 2020)

Cyclotomic Identity Testing and Applications. - Nikhil Balaji; Sylvain Perifel; Mahsa Shirmohammadi; James Worrell 001 (ISSAC, 2021)

Identity Testing for Radical Expressions. - Nikhil Balaji; Klara Nosan; Mahsa Shirmohammadi; James Worrell 001 (LICS, 2022)

Terms of Lucas sequences having a large smooth divisor. - Nikhil Balaji; Florian Luca (CoRR, 2022)

On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs. - Eric Allender; Nikhil Balaji; Samir Datta; Rameshwar Pratap (Electron. Colloquium Comput. Complex., 2022)

Multiplicity Problems on Algebraic Series and Context-Free Grammars. - Nikhil Balaji; Lorenzo Clemente; Klara Nosan; Mahsa Shirmohammadi; James Worrell 001 (LICS, 2023)

USSR is in P/poly. - Nikhil Balaji; Samir Datta (Electron. Colloquium Comput. Complex., 2023)

A parametric version of the Hilbert Nullstellensatz. - Rida Ait El Manssour; Nikhil Balaji; Klara Nosan; Mahsa Shirmohammadi; James Worrell 001 (SOSA, 2025)