Krishnamoorthy Dinesh

According to our database, Krishnamoorthy Dinesh authored at least 10 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Classical simulation of one-query quantum distinguishers.

Andrej Bogdanov, TsunMing Cheung, Krishnamoorthy Dinesh, John C. S. Lui

Electron. Colloquium Comput. Complex., 2023

Bounded Simultaneous Messages.

Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022

On pure space vs catalytic space.

Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma

Theor. Comput. Sci., 2022

2021

Bounded Indistinguishability for Simple Sources.

Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan

Electron. Colloquium Comput. Complex., 2021

On quantum versus classical query complexity.

Scott Aaronson, Andris Ambainis, Andrej Bogdanov, Krishnamoorthy Dinesh, Tsun Ming Cheung

Electron. Colloquium Comput. Complex., 2021

2020

Sensitivity, affine transforms and quantum communication complexity.

Krishnamoorthy Dinesh, Jayalal Sarma

Theor. Comput. Sci., 2020

New bounds for energy complexity of Boolean functions.

Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma

Theor. Comput. Sci., 2020

2019

Alternation, sparsity and sensitivity: Bounds and exponential gaps.

Krishnamoorthy Dinesh, Jayalal Sarma

Theor. Comput. Sci., 2019

2018

Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps.

Krishnamoorthy Dinesh, Jayalal Sarma

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2016

Characterization and Lower Bounds for Branching Program Size using Projective Dimension.

Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2016