11 citations · 13 across the 4 of their papers we have counts for
5 papers · 1 filter
Almost-catalytic Computation
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Deep Rai +1
Designing algorithms for space bounded models with restoration requirements on the space used by the algorithm is an important challenge posed about the catalytic computation model…
Bounded Simultaneous Messages
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus +3
We consider the following question of bounded simultaneous messages (BSM) protocols: Can computationally unbounded Alice and Bob evaluate a function of their inputs by sen…
Sensitivity, Affine Transforms and Quantum Communication Complexity
Krishnamoorthy Dinesh, Jayalal Sarma
We study the Boolean function parameters sensitivity (), block sensitivity (), and alternation () under specially designed affine transform…
New Bounds for Energy Complexity of Boolean Functions
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
For a Boolean function $f:\…
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps
Krishnamoorthy Dinesh, Jayalal Sarma
The well-known Sensitivity Conjecture states that for any Boolean function , block…