Research Publications/Reports
Listing last 25 publications. (View All) View/Hide Filter- New Bounds for Energy Complexity of Boolean Functions
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma, Appeared in Theoretical Computer Science, Sep 2020. A preliminary version appeared in The 24th International Computing and Combinatorics Conference (COCOON 2018), Jul 2018.
- Sensitivity, Affine Transforms and Quantum Communication Complexity
Krishnamoorthy Dinesh, Jayalal Sarma, Appeared in Theoretical Computer Science (Invited Special Issue), Jun 2020. A preliminary version appeared in 25th International Computing and Combinatorics Conference (COCOON 2019), Vol 2018, No.152, Aug 2019.
- On Pure Space vs Catalytic Space
Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma, Appeared in The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020), Apr 2020.
- Characterization and Lower Bounds for Branching Program Size using Projective Dimension
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma, Appeared in ACM Transactions on Computation Theory, Vol 11, No.8, Mar 2019. A preliminary version appeared in 36th International Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2016.
- Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps
Krishnamoorthy Dinesh, Jayalal Sarma, Appeared in Theoretical Computer Science, Mar 2019. A preliminary version appeared in 4th Annual Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2018), Feb 2018.