Shijin Rajakrishnan

According to our database, Shijin Rajakrishnan authored at least 7 papers between 2016 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good.

Rachit Agarwal, Shijin Rajakrishnan, David B. Shmoys

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Approximability of open k-monopoly problems.

Sounaka Mishra, B. Arjuna Krishna, Shijin Rajakrishnan

Theory Comput. Syst., 2021

2018

Sincronia: near-optimal network design for coflows.

Saksham Agarwal, Shijin Rajakrishnan, Akshay Narayan, Rachit Agarwal, David B. Shmoys, Amin Vahdat

Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, 2018

2017

On approximability of optimization problems related to Red/Blue-split graphs.

Sounaka Mishra, Shijin Rajakrishnan, Saket Saurabh

Theor. Comput. Sci., 2017

The Complexity of Maximum k-Order Bounded Component Set Proble.

Sounaka Mishra, Shijin Rajakrishnan

CoRR, 2017

2016

Lower Bounds for Interactive Function Computation via Wyner Common Information.

Shijin Rajakrishnan, Sundara Rajan S, Vinod M. Prabhakaran

CoRR, 2016

Lower bounds and optimal protocols for three-party secure computation.

Sundara Rajan S, Shijin Rajakrishnan, Andrew Thangaraj, Vinod M. Prabhakaran

Proceedings of the IEEE International Symposium on Information Theory, 2016