Krishnamoorthy Dinesh

28 papers A 2C 1Misc 2Journal 19Unranked 4
YearRankTypeTitle / Venue / Authors
2025 — conf
Almost-Catalytic Computation.
CIAC (2)
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma
2024 J jnl
Almost-catalytic Computation.
CoRR
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma
2024 J jnl
Almost-catalytic Computation.
Electron. Colloquium Comput. Complex.
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma
2023 — conf
Bounded Simultaneous Messages.
FSTTCS
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar
2023 J jnl
Bounded Simultaneous Messages.
CoRR
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar
2023 A conf
Classical Simulation of One-Query Quantum Distinguishers.
APPROX/RANDOM
Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh, John C. S. Lui
2023 J jnl
Classical simulation of one-query quantum distinguishers.
Electron. Colloquium Comput. Complex.
Andrej Bogdanov, TsunMing Cheung, Krishnamoorthy Dinesh, John C. S. Lui
2022 A conf
Bounded Indistinguishability for Simple Sources.
ITCS
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan
2022 J jnl
On pure space vs catalytic space.
Theor. Comput. Sci.
Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
2021 J jnl
Bounded Indistinguishability for Simple Sources.
Electron. Colloquium Comput. Complex.
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan
2021 J jnl
On quantum versus classical query complexity.
Electron. Colloquium Comput. Complex.
Scott Aaronson, Andris Ambainis, Andrej Bogdanov, Krishnamoorthy Dinesh, Tsun Ming Cheung
2020 J jnl
New bounds for energy complexity of Boolean functions.
Theor. Comput. Sci.
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2020 C conf
On Pure Space vs Catalytic Space.
TAMC
Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
2020 J jnl
Sensitivity, affine transforms and quantum communication complexity.
Theor. Comput. Sci.
Krishnamoorthy Dinesh, Jayalal Sarma
2019 J jnl
Alternation, sparsity and sensitivity: Bounds and exponential gaps.
Theor. Comput. Sci.
Krishnamoorthy Dinesh, Jayalal Sarma
2019 J jnl
Characterization and Lower Bounds for Branching Program Size using Projective Dimension.
ACM Trans. Comput. Theory
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
2019 Misc conf
Sensitivity, Affine Transforms and Quantum Communication Complexity.
COCOON
Krishnamoorthy Dinesh, Jayalal Sarma
2018 — conf
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps.
CALDAM
Krishnamoorthy Dinesh, Jayalal Sarma
2018 Misc conf
New Bounds for Energy Complexity of Boolean Functions.
COCOON
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2018 J jnl
New Bounds for Energy Complexity of Boolean Functions.
CoRR
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2018 J jnl
New Bounds for Energy Complexity of Boolean Functions.
Electron. Colloquium Comput. Complex.
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2018 J jnl
Sensitivity, Affine Transforms and Quantum Communication Complexity.
CoRR
Krishnamoorthy Dinesh, Jayalal Sarma
2018 J jnl
Sensitivity, Affine Transforms and Quantum Communication Complexity.
Electron. Colloquium Comput. Complex.
Krishnamoorthy Dinesh, Jayalal Sarma
2017 J jnl
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps.
CoRR
Krishnamoorthy Dinesh, Jayalal Sarma
2017 J jnl
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps.
Electron. Colloquium Comput. Complex.
Krishnamoorthy Dinesh, Jayalal Sarma
2016 — conf
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension.
FSTTCS
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
2016 J jnl
Characterization and Lower Bounds for Branching Program Size using Projective Dimension.
CoRR
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
2016 J jnl
Characterization and Lower Bounds for Branching Program Size using Projective Dimension.
Electron. Colloquium Comput. Complex.
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma