Követés
Krishnamoorthy Dinesh
Krishnamoorthy Dinesh
Indian Institute of Technology Palakkad, India
E-mail megerősítve itt: iitpkd.ac.in - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
New bounds for energy complexity of Boolean functions
K Dinesh, S Otiv, J Sarma
Theoretical Computer Science 845, 59-75, 2020
92020
Alternation, sparsity and sensitivity: Bounds and exponential gaps
K Dinesh, J Sarma
Theoretical Computer Science 771, 71-82, 2019
52019
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), 2022
42022
Alternation, sparsity and sensitivity: combinatorial bounds and exponential gaps
K Dinesh, J Sarma
Algorithms and Discrete Applied Mathematics: 4th International Conference …, 2018
42018
On Pure Space vs Catalytic Space
S Bisoyi, K Dinesh, J Sarma
International Conference on Theory and Applications of Models of Computation …, 2020
32020
Sensitivity, affine transforms and quantum communication complexity
K Dinesh, J Sarma
Theoretical Computer Science 838, 68-80, 2020
22020
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
22019
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
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–9