Counting paths in planar width 2 branching programs. - Meena Mahajan; Nitin Saurabh; Karteek Sreenivasaiah (CATS, 2012)

An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas. - Ruiwen Chen; Valentine Kabanets; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2013)

Homomorphism Polynomials Complete for VP. - Arnaud Durand 001; Meena Mahajan; Guillaume Malod; Nicolas de Rugy-Altherre; Nitin Saurabh (Chic. J. Theor. Comput. Sci., 2016)

Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. - Meena Mahajan; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2016)

VNP=VP in the multilinear world. - Meena Mahajan; Nitin Saurabh; Sébastien Tavenas (Inf. Process. Lett., 2016)

Upper bounds on Fourier entropy. - Sourav Chakraborty 001; Raghav Kulkarni; Satyanarayana V. Lokam; Nitin Saurabh (Theor. Comput. Sci., 2016)

Optimal Quasi-Gray Codes: Does the Alphabet Matter? - Diptarka Chakraborty; Debarati Das 001; Michal Koucký 001; Nitin Saurabh (CoRR, 2017)

Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. - Diptarka Chakraborty; Debarati Das 001; Michal Koucký 001; Nitin Saurabh (ESA, 2018)

Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. - Sourav Chakraborty 001; Sushrut Karmalkar; Srijita Kundu; Satyanarayana V. Lokam; Nitin Saurabh (LATIN, 2018)

Improved bounds on Fourier entropy and Min-entropy. - Srinivasan Arunachalam; Sourav Chakraborty 001; Michal Koucký 001; Nitin Saurabh; Ronald de Wolf (Electron. Colloquium Comput. Complex., 2018)

Lower bounds for linear decision lists. - Arkadev Chattopadhyay; Meena Mahajan; Nikhil S. Mande; Nitin Saurabh (Chic. J. Theor. Comput. Sci., 2020)

Algebraic Branching Programs, Border Complexity, and Tangent Spaces. - Markus Bläser; Christian Ikenmeyer; Meena Mahajan; Anurag Pandey 001; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2020)

On the complexity of detecting hazards. - Balagopal Komarath; Nitin Saurabh (Inf. Process. Lett., 2020)

Karchmer-Wigderson Games for Hazard-free Computation. - Christian Ikenmeyer; Balagopal Komarath; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2021)

Tight Lower Bounds for Approximate & Exact k-Center in ℝd. - Rajesh Chitnis; Nitin Saurabh (SoCG, 2022)

Rabbits Approximate, Cows Compute Exactly! - Balagopal Komarath; Anurag Pandey 001; Nitin Saurabh (MFCS, 2022)

Approximate polymorphisms. - Gilad Chase; Yuval Filmus; Dor Minzer; Elchanan Mossel; Nitin Saurabh (STOC, 2022)

Randomized and Quantum Query Complexities of Finding a King in a Tournament. - Nikhil S. Mande; Manaswi Paraashar; Nitin Saurabh (FSTTCS, 2023)

On the Composition of Randomized Query Complexity and Approximate Degree. - Sourav Chakraborty 001; Chandrima Kayal; Rajat Mittal 001; Manaswi Paraashar; Swagato Sanyal; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2023)

Approximate Degree Composition for Recursive Functions. - Sourav Chakraborty 001; Chandrima Kayal; Rajat Mittal 001; Manaswi Paraashar; Nitin Saurabh (APPROX/RANDOM, 2024)

On the Communication Complexity of Finding a King in a Tournament. - Nikhil S. Mande; Manaswi Paraashar; Swagato Sanyal; Nitin Saurabh (APPROX/RANDOM, 2024)