Lower bounds and optimal protocols for three-party secure computation. - Sundara Rajan S; Shijin Rajakrishnan; Andrew Thangaraj; Vinod M. Prabhakaran (ISIT, 2016)

Lower Bounds for Interactive Function Computation via Wyner Common Information. - Shijin Rajakrishnan; Sundara Rajan S; Vinod M. Prabhakaran (CoRR, 2016)

The Complexity of Maximum k-Order Bounded Component Set Proble. - Sounaka Mishra; Shijin Rajakrishnan (CoRR, 2017)

On approximability of optimization problems related to Red/Blue-split graphs. - Sounaka Mishra; Shijin Rajakrishnan; Saket Saurabh 001 (Theor. Comput. Sci., 2017)

Sincronia: near-optimal network design for coflows. - Saksham Agarwal; Shijin Rajakrishnan; Akshay Narayan 001; Rachit Agarwal 001; David B. Shmoys; Amin Vahdat (SIGCOMM, 2018)

Approximability of open k-monopoly problems. - Sounaka Mishra; B. Arjuna Krishna; Shijin Rajakrishnan (Theory Comput. Syst., 2021)

From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good. - Rachit Agarwal 001; Shijin Rajakrishnan; David B. Shmoys (PODC, 2022)