Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Krishnamoorthy Dinesh
Observed names:
Dinesh Krishnamoorthy,
Dinesh, Krishnamoorthy
Institution:
Indian Institute of Technology Palakkad
Observed institutions:
Chinese University of Hong Kong,
Indian Institute of Technology Madras,
Indian Institute of Technology Palakkad
ORCID:
0000-0002-1777-7305
Observed ORCID:
0000-0002-1777-7305
OpenAlex ID:
A5068807432
On pure space vs catalytic space
2022
·
Sagar Bisoyi
, Krishnamoorthy Dinesh
, et al.
·
Theoretical Computer Science
·
16
New bounds for energy complexity of Boolean functions
2020
·
Krishnamoorthy Dinesh
, Samir Otiv
, et al.
·
Theoretical Computer Science
·
14
Bounded Indistinguishability for Simple Sources
2022
·
Bogdanov, Andrej
, Dinesh, Krishnamoorthy
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
8
PDF
Alternation, sparsity and sensitivity: Bounds and exponential gaps
2018
·
Krishnamoorthy Dinesh
, Jayalal Sarma
·
Theoretical Computer Science
·
6
PDF
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps
2018
·
Krishnamoorthy Dinesh
, Jayalal Sarma
·
Lecture notes in computer science
·
5
New Bounds for Energy Complexity of Boolean Functions
2018
·
Krishnamoorthy Dinesh
, Samir Otiv
, et al.
·
Lecture notes in computer science
·
4
On quantum versus classical query complexity.
2021
·
Scott Aaronson
, Andris Ambainis
, et al.
·
Electronic colloquium on computational complexity
·
3
Sensitivity, Affine Transforms and Quantum Communication Complexity
2019
·
Krishnamoorthy Dinesh
, Jayalal Sarma
·
Lecture notes in computer science
·
2
Sensitivity-based Data Augmentation for Learning an Approximate Model Predictive Controller.
2020
·
Krishnamoorthy Dinesh
·
arXiv (Cornell University)
·
1
Characterization and Lower Bounds for Branching Program Size using Projective Dimension
2019
·
Krishnamoorthy Dinesh
, Sajin Koroth
, et al.
·
ACM Transactions on Computation Theory
·
1
PDF
Space Complexity of Reachability in Simple Path Graphs
2026
·
Dinesh, Krishnamoorthy
, Sasidharan, Chandana
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Bounded Simultaneous Messages
2023
·
Bogdanov, Andrej
, Dinesh, Krishnamoorthy
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
On Pure Space vs Catalytic Space
2020
·
Sagar Bisoyi
, Krishnamoorthy Dinesh
, et al.
·
Lecture notes in computer science
Sensitivity, affine transforms and quantum communication complexity
2020
·
Krishnamoorthy Dinesh
, Jayalal Sarma
·
Theoretical Computer Science
射影次元を用いた分岐プログラムサイズの特性化と下界【jst・京大機械翻訳】
2019
·
Dinesh Krishnamoorthy
, Koroth Sajin
, et al.
·
ACM Transactions on Computation Theory
Show more works
View as search
Works count:
16
Citation count:
60
H-index:
5
I10-index:
2
Year
Topic
Type