| An improved deterministic# SAT algorithm for small De Morgan formulas R Chen, V Kabanets, N Saurabh Algorithmica 76 (1), 68-87, 2016 | 27 | 2016 |
| Homomorphism Polynomials complete for VP A Durand, M Mahajan, G Malod, N de Rugy-Altherre, N Saurabh Chicago Journal of Theoretical Computer Science 2016 (3), 2016 | 17 | 2016 |
| Some complete and intermediate polynomials in algebraic complexity theory M Mahajan, N Saurabh Theory of Computing Systems 62 (3), 622-652, 2018 | 16 | 2018 |
| Upper bounds on Fourier entropy S Chakraborty, R Kulkarni, SV Lokam, N Saurabh Theoretical Computer Science 654, 92-112, 2016 | 16 | 2016 |
| Improved bounds on fourier entropy and min-entropy S Arunachalam, S Chakraborty, M Kouckż, N Saurabh, R de Wolf arXiv preprint arXiv:1809.09819, 2018 | 12 | 2018 |
| Algebraic branching programs, border complexity, and tangent spaces M Bläser, C Ikenmeyer, M Mahajan, A Pandey, N Saurabh arXiv preprint arXiv:2003.04834, 2020 | 6 | 2020 |
| Lower bounds for linear decision lists A Chattopadhyay, M Mahajan, N Mande, N Saurabh arXiv preprint arXiv:1901.05911, 2019 | 4 | 2019 |
| Fourier entropy-influence conjecture for random linear threshold functions S Chakraborty, S Karmalkar, S Kundu, SV Lokam, N Saurabh Latin American Symposium on Theoretical Informatics, 275-289, 2018 | 4 | 2018 |
| Counting paths in planar width 2 branching programs M Mahajan, N Saurabh, K Sreenivasaiah | 3 | 2011 |
| Improved Bounds on Fourier Entropy and Min-entropy S Arunachalam, S Chakraborty, M Kouckż, N Saurabh, R De Wolf ACM Transactions on Computation Theory (TOCT) 13 (4), 1-40, 2021 | 2 | 2021 |
| On the complexity of detecting hazards B Komarath, N Saurabh Information Processing Letters 162, 105980, 2020 | 2 | 2020 |
| Counting paths in planar width 2 branching programs M Mahajan, N Saurabh, K Sreenivasaiah Proceedings of the Eighteenth Computing: The Australasian Theory Symposium …, 2012 | 2 | 2012 |
| Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity D Chakraborty, D Das, M Kouckż, N Saurabh 26th Annual European Symposium on Algorithms (ESA 2018), 2018 | 1 | 2018 |
| Optimal Quasi-Gray Codes: Does the Alphabet Matter? D Chakraborty, D Das, M Kouckż, N Saurabh arXiv preprint arXiv:1712.01834, 2017 | 1 | 2017 |
| VNP= VP in the multilinear world M Mahajan, N Saurabh, S Tavenas Information Processing Letters 116 (2), 179-182, 2016 | 1 | 2016 |
| Tight Lower Bounds for Approximate & Exact -Center in R Chitnis, N Saurabh arXiv preprint arXiv:2203.08328, 2022 | | 2022 |
| Karchmer-Wigderson Games for Hazard-free Computation C Ikenmeyer, B Komarath, N Saurabh arXiv preprint arXiv:2107.05128, 2021 | | 2021 |
| Approximate polymorphisms G Chase, Y Filmus, D Minzer, E Mossel, N Saurabh arXiv preprint arXiv:2106.00093, 2021 | | 2021 |
| Optimal Quasi-Gray Codes: The Alphabet Matters D Chakraborty, D Das, M Kouckż, N Saurabh arXiv preprint arXiv:1712.01834, 2017 | | 2017 |
| Analysis of Algebraic complexity classes and boolean functions [HBNI Th106] N Saurabh IMSc, 2016 | | 2016 |
Meena MahajanProfessor at The Institute of Mathematical Sciences, HBNI, Chennai, IndiaVerified email at imsc.res.in
