S. Rajakrishnan

collaborators

2 papers

cs.DS2017

The Complexity of Maximum $k$ -Order Bounded Component Set Problem

Sounaka Mishra, Shijin Rajakrishnan

Given a graph $G = (V, E)$ and a positive integer $k$ , in Maximum $k$ -Order Bounded Component Set (Max- $k$ -OBCS), it is required to find a vertex set $S \subseteq V$ of maximum size…

cs.IT2016

Lower Bounds for Interactive Function Computation via Wyner Common Information

Shijin Rajakrishnan, Sundara Rajan S, Vinod Prabhakaran

The question of how much communication is required between collaborating parties to compute a function of their data is of fundamental importance in the fields of theoretical compu…

The Complexity of Maximum k-Order Bounded Component Set Problem

Lower Bounds for Interactive Function Computation via Wyner Common Information

The Complexity of Maximum $k$ -Order Bounded Component Set Problem