(Former) Member Profile :
|
Krishnamoorthy DineshFormer Ph.D. student.Associated with group during : Jul 2013 - Mar Advisor(s) : Jayalal Sarma Email : kdinesh@cse.iitm.ac.in Personal Webpage |
Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.
Research InterestsAlternation, Transforms and New Bounds on Boolean Function Complexity MeasuresMoved to:Visiting Scholar, Technion Israel Institute of Technology, Israel. |
Teaching Actvities (while with the theory group - since Jan 2011)
- TA for Algorithmic Algebra - Jul-Nov, 2017
- TA for Computability and Complexity - Aug-Nov, 2016
- TA for Algorithmic Algebra - Aug-Nov, 2015
- TA for Languages, Machines and Computations - Jan-May, 2015
- TA for Algorithmic Algebra - Jul-Nov, 2014
- TA for Modern Techniques in Theory of Computation - Jan-May, 2014
- TA for Mathematical Concepts for Computer Science - Jul-Nov, 2013
Publications (while with the group, last 10)
See here for all publications while at IITM
- New Bounds for Energy Complexity of Boolean Functions
Authors: Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
Theoretical Computer Science, Sep 2020 - Sensitivity, Affine Transforms and Quantum Communication Complexity
Authors: Krishnamoorthy Dinesh, Jayalal Sarma
Theoretical Computer Science (Invited Special Issue), Jun 2020 - On Pure Space vs Catalytic Space
Authors: Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020), Apr 2020 - Sensitivity, Affine Transforms and Quantum Communication Complexity
Authors: Krishnamoorthy Dinesh, Jayalal Sarma
25th International Computing and Combinatorics Conference (COCOON 2019), Vol 2018, No.152, Aug 2019 - Characterization and Lower Bounds for Branching Program Size using Projective Dimension
Authors: Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
ACM Transactions on Computation Theory, Vol 11, No.8, Mar 2019 - Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps
Authors: Krishnamoorthy Dinesh, Jayalal Sarma
Theoretical Computer Science, Mar 2019 - New Bounds for Energy Complexity of Boolean Functions
Authors: Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
The 24th International Computing and Combinatorics Conference (COCOON 2018), Jul 2018 - Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps
Authors: Krishnamoorthy Dinesh, Jayalal Sarma
4th Annual Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2018), Feb 2018 - Characterization and Lower Bounds for Branching Program Size using Projective Dimension
Authors: Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
36th International Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2016