Krishnamoorthy Dinesh

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 22

Top Topics

Confidence Bounds

Boolean Functions

Prime Implicants

Top Venues

Electron. Colloquium Comput. Complex.

Theor. Comput. Sci.

Publications

Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar
Bounded Simultaneous Messages. CoRR (2023)
Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh, John C. S. Lui
Classical Simulation of One-Query Quantum Distinguishers. APPROX/RANDOM (2023)
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar
Bounded Simultaneous Messages. FSTTCS (2023)
Andrej Bogdanov, TsunMing Cheung, Krishnamoorthy Dinesh, John C. S. Lui
Classical simulation of one-query quantum distinguishers. Electron. Colloquium Comput. Complex. (2023)
Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
On pure space vs catalytic space. Theor. Comput. Sci. 921 (2022)
Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
On Pure Space vs Catalytic Space. TAMC (2020)
Krishnamoorthy Dinesh, Jayalal Sarma
Sensitivity, affine transforms and quantum communication complexity. Theor. Comput. Sci. 838 (2020)
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
New bounds for energy complexity of Boolean functions. Theor. Comput. Sci. 845 (2020)
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. ACM Trans. Comput. Theory 11 (2) (2019)
Krishnamoorthy Dinesh, Jayalal Sarma
Sensitivity, Affine Transforms and Quantum Communication Complexity. COCOON (2019)
Krishnamoorthy Dinesh, Jayalal Sarma
Alternation, sparsity and sensitivity: Bounds and exponential gaps. Theor. Comput. Sci. 771 (2019)
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
New Bounds for Energy Complexity of Boolean Functions. COCOON (2018)
Krishnamoorthy Dinesh, Jayalal Sarma
Sensitivity, Affine Transforms and Quantum Communication Complexity. CoRR (2018)
Krishnamoorthy Dinesh, Jayalal Sarma
Sensitivity, Affine Transforms and Quantum Communication Complexity. Electron. Colloquium Comput. Complex. 25 (2018)
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
New Bounds for Energy Complexity of Boolean Functions. Electron. Colloquium Comput. Complex. 25 (2018)
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
New Bounds for Energy Complexity of Boolean Functions. CoRR (2018)
Krishnamoorthy Dinesh, Jayalal Sarma
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps. CALDAM (2018)
Krishnamoorthy Dinesh, Jayalal Sarma
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps. Electron. Colloquium Comput. Complex. 24 (2017)
Krishnamoorthy Dinesh, Jayalal Sarma
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps. CoRR (2017)
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. Electron. Colloquium Comput. Complex. 23 (2016)
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. CoRR (2016)
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. FSTTCS (2016)