Krishnamoorthy Dinesh

Bhabya Rai

Electron. Colloquium Comput. Complex., 2024

2023

Bounded Simultaneous Messages.

[BibT_eX]

[DOI]

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

Classical Simulation of One-Query Quantum Distinguishers.

[BibT_eX]

[DOI]

Tsun Ming Cheung

John C. S. Lui

Proceedings of the Approximation, 2023

2022

Bounded Indistinguishability for Simple Sources.

[BibT_eX]

[DOI]

Yuval Filmus

Yuval Ishai

Avi Kaplan

Akshayaram Srinivasan

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

On quantum versus classical query complexity.

[BibT_eX]

[DOI]

Scott Aaronson

Andris Ambainis

Tsun Ming Cheung

Electron. Colloquium Comput. Complex., 2021

2020

On Pure Space vs Catalytic Space.

[BibT_eX]

[DOI]

Sagar Bisoyi

Proceedings of the Theory and Applications of Models of Computation, 2020

2019

Sensitivity, Affine Transforms and Quantum Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

New Bounds for Energy Complexity of Boolean Functions.

[BibT_eX]

[DOI]

Samir Otiv

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

2016

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

[BibT_eX]

[DOI]

Sajin Koroth