Recent publications: 

• Near Uniform Triangle Sampling Over Adjacency List Graph Streams
  Theoretical Computer Science (TCS), 2026
  Arijit Bishnu, Arijit Ghosh, and Sayatan Sen.

• Parallel Derandomization for Coloring
  Theoretical Computer Science (TCS), 2026
  Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra

• Optimal (Degree+1)-List Coloring in the Congested Clique
  SIAM Journal on Computing (SICOMP), 2026
  Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra

• On k-Center Clustering in MPC
  ACM Transactions on Algorithms (TALG), 2026
  Sam Coy, Artur Czumaj, Gopinath Mishra

• Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
  FSTTCS 2025
  Yi-Jun Chang, Yanyu Chen, Gopinath Mishra

• Log-Diameter Rounds MST Verification and Sensitivity in MPC
  Algorithmica, 2025
  Sam Coy, Artur Czumaj, Anish Mukherjee, Gopinath Mishra

• The Complexity Landscape of Dynamic Distributed Subgraph Finding
  DISC 2025
  Yi-Jun Chang, Liyuting Chen, Yanyu Chen, Mingyang Yang, Gopinath Mishra

• Round- and Communication-Efficient Graph Coloring
  PODC 2025
  Yi-Jun Chang, Thuan-Hung Nguyen, Farrel D. Salim, Gopinath Mishra

• Optimal Distributed Replacement Paths
  PODC 2025
  Yi-Jun Chang, Yanyu Chen, Dipan Dey, Thuan-Hung Nguyen, Bryce Sanchez, Gopinath Mishra

• Testing vs. Estimation for Index-Invariant Properties in the Huge Object Model
  STOC 2025
  Sourav Chakraborty, Eldar Fischer, Amit Levi, Arijit Ghosh, Sayantan Sen, Gopinath Mishra

• Exploring the Gap between Tolerant and Non-Tolerant Distribution Testing
  IEEE Transactions on Information Theory, 2025
  Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Sayantan Sen, Gopinath Mishra