| New bounds for energy complexity of Boolean functions K Dinesh, S Otiv, J Sarma Theoretical Computer Science 845, 59-75, 2020 | 13 | 2020 |
| On Pure Space vs Catalytic Space S Bisoyi, K Dinesh, J Sarma International Conference on Theory and Applications of Models of Computation …, 2020 | 7 | 2020 |
| Alternation, sparsity and sensitivity: Bounds and exponential gaps K Dinesh, J Sarma Theoretical Computer Science 771, 71-82, 2019 | 6 | 2019 |
| Alternation, sparsity and sensitivity: combinatorial bounds and exponential gaps K Dinesh, J Sarma Algorithms and Discrete Applied Mathematics: 4th International Conference …, 2018 | 5 | 2018 |
| Bounded indistinguishability for simple sources A Bogdanov, K Dinesh, Y Filmus, Y Ishai, A Kaplan, A Srinivasan 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 26 …, 2022 | 4 | 2022 |
| On quantum versus classical query complexity S Aaronson, A Ambainis, A Bogdanov, K Dinesh, TM Cheung Electron. Colloquium Comput. Complex., 2021 | 4 | 2021 |
| Sensitivity, affine transforms and quantum communication complexity K Dinesh, J Sarma Theoretical Computer Science 838, 68-80, 2020 | 2 | 2020 |
| Characterization and lower bounds for branching program size using projective dimension K Dinesh, S Koroth, J Sarma ACM Transactions on Computation Theory (TOCT) 11 (2), 1-22, 2019 | 2 | 2019 |
| Almost-catalytic Computation S Bisoyi, K Dinesh, BD Rai, J Sarma arXiv preprint arXiv:2409.07208, 2024 | | 2024 |
| Bounded Simultaneous Messages A Bogdanov, K Dinesh, Y Filmus, Y Ishai, A Kaplan, S Sekar arXiv preprint arXiv:2310.00334, 2023 | | 2023 |
| Classical Simulation of One-Query Quantum Distinguishers A Bogdanov, TM Cheung, K Dinesh, J Lui Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2023 | | 2023 |
Jayalal SarmaIndian Institute of Technology Madras, Chennai, IndiaVerified email at cse.iitm.ac.in
