Characterization and Lower Bounds for Branching Program Size using Projective Dimension. - Krishnamoorthy Dinesh 001; Sajin Koroth; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2016)

Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps. - Krishnamoorthy Dinesh 001; Jayalal Sarma (CALDAM, 2018)

Alternation, sparsity and sensitivity: Bounds and exponential gaps. - Krishnamoorthy Dinesh 001; Jayalal Sarma (Theor. Comput. Sci., 2019)

New bounds for energy complexity of Boolean functions. - Krishnamoorthy Dinesh 001; Samir Otiv; Jayalal Sarma (Theor. Comput. Sci., 2020)

Sensitivity, affine transforms and quantum communication complexity. - Krishnamoorthy Dinesh 001; Jayalal Sarma (Theor. Comput. Sci., 2020)

On quantum versus classical query complexity. - Scott Aaronson; Andris Ambainis; Andrej Bogdanov; Krishnamoorthy Dinesh 001; Tsun Ming Cheung (Electron. Colloquium Comput. Complex., 2021)

Bounded Indistinguishability for Simple Sources. - Andrej Bogdanov; Krishnamoorthy Dinesh 001; Yuval Filmus; Yuval Ishai; Avi Kaplan; Akshayaram Srinivasan (Electron. Colloquium Comput. Complex., 2021)

On pure space vs catalytic space. - Sagar Bisoyi; Krishnamoorthy Dinesh 001; Jayalal Sarma (Theor. Comput. Sci., 2022)

Bounded Simultaneous Messages. - Andrej Bogdanov; Krishnamoorthy Dinesh 001; Yuval Filmus; Yuval Ishai; Avi Kaplan; Sruthi Sekar (FSTTCS, 2023)

Classical simulation of one-query quantum distinguishers. - Andrej Bogdanov; TsunMing Cheung; Krishnamoorthy Dinesh 001; John C. S. Lui (Electron. Colloquium Comput. Complex., 2023)

Almost-catalytic Computation. - Sagar Bisoyi; Krishnamoorthy Dinesh 001; Bhabya Rai; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2024)