Nikhil Balaji

Orcid: 0000-0001-9234-0683

According to our database1, Nikhil Balaji authored at least 20 papers between 2013 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A parametric version of the Hilbert Nullstellensatz.
Proceedings of the 2025 Symposium on Simplicity in Algorithms, 2025

2024
USSR is in P/poly.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023
Multiplicity Problems on Algebraic Series and Context-Free Grammars.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022
On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs.
Electron. Colloquium Comput. Complex., 2022

Terms of Lucas sequences having a large smooth divisor.
CoRR, 2022

Identity Testing for Radical Expressions.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
Cyclotomic Identity Testing and Applications.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019
On the Complexity of Value Iteration.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes.
CoRR, 2018

2017
Complexity of Restricted Variants of Skolem and Related Problems.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP.
Electron. Colloquium Comput. Complex., 2016

Graph Properties in Node-Query Setting: Effect of Breaking Symmetry.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Bounded Treewidth and Space-Efficient Linear Algebra.
Proceedings of the Theory and Applications of Models of Computation, 2015

Counting Euler Tours in Undirected Bounded Treewidth Graphs.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Skew Circuits of Small Width.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Collapsing Exact Arithmetic Hierarchies.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Sentence Completion Using Text Prediction Systems.
Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014, 2014

2013
Tree-width and Logspace: Determinants and Counting Euler Tours.
CoRR, 2013


  Loading...