Tribes Is Hard in the Message Passing Model. - Arkadev Chattopadhyay; Sagnik Mukhopadhyay (STACS, 2015)

Towards Better Separation between Deterministic and Randomized Query Complexity. - Sagnik Mukhopadhyay; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2015)

Lower Bounds for Elimination via Weak Regularity. - Arkadev Chattopadhyay; Pavel Dvorák; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (Electron. Colloquium Comput. Complex., 2016)

Tribes Is Hard in the Message Passing Model. - Sagnik Mukhopadhyay (Electron. Colloquium Comput. Complex., 2016)

Simulation Theorems via Pseudorandom Properties. - Arkadev Chattopadhyay; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (CoRR, 2017)

Composition and Simulation Theorems via Pseudo-random Properties. - Arkadev Chattopadhyay; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (Electron. Colloquium Comput. Complex., 2017)

Simulation Beats Richness: New Data-Structure Lower Bounds. - Arkadev Chattopadhyay; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (Electron. Colloquium Comput. Complex., 2017)

Lifting Theorems for Equality. - Bruno Loff; Sagnik Mukhopadhyay (Electron. Colloquium Comput. Complex., 2018)

Separation Between Deterministic and Randomized Query Complexity. - Sagnik Mukhopadhyay; Jaikumar Radhakrishnan; Swagato Sanyal (SIAM J. Comput., 2018)

Simulation Theorems via Pseudo-random Properties. - Arkadev Chattopadhyay; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (Comput. Complex., 2019)

Weighted min-cut: sequential, cut-query, and streaming algorithms. - Sagnik Mukhopadhyay; Danupon Nanongkai (STOC, 2020)

Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. - Andrés López-Martínez; Sagnik Mukhopadhyay; Danupon Nanongkai (SPAA, 2021)

Breaking the quadratic barrier for matroid intersection. - Joakim Blikstad; Jan van den Brand; Sagnik Mukhopadhyay; Danupon Nanongkai (STOC, 2021)

Distributed weighted min-cut in nearly-optimal time. - Michal Dory; Yuval Efron; Sagnik Mukhopadhyay; Danupon Nanongkai (STOC, 2021)

A Note on Isolating Cut Lemma for Submodular Function Minimization. - Sagnik Mukhopadhyay; Danupon Nanongkai (CoRR, 2021)

Cut Query Algorithms with Star Contraction. - Simon Apers; Yuval Efron; Pawel Gawrychowski; Troy Lee; Sagnik Mukhopadhyay; Danupon Nanongkai (FOCS, 2022)

Nearly Optimal Communication and Query Complexity of Bipartite Matching. - Joakim Blikstad; Jan van den Brand; Yuval Efron; Sagnik Mukhopadhyay; Danupon Nanongkai (FOCS, 2022)

Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. - Calvin Beideman; Karthekeyan Chandrasekaran; Sagnik Mukhopadhyay; Danupon Nanongkai (IPCO, 2022)

Fast Algorithms via Dynamic-Oracle Matroids. - Joakim Blikstad; Sagnik Mukhopadhyay; Danupon Nanongkai; Ta-Wei Tu (STOC, 2023)

Finding a Small Vertex Cut on Distributed Networks. - Yonggang Jiang; Sagnik Mukhopadhyay (STOC, 2023)

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. - Sepehr Assadi; Prantar Ghosh; Bruno Loff; Parth Mittal; Sagnik Mukhopadhyay (CCC, 2024)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations. - Joakim Blikstad; Yonggang Jiang; Sagnik Mukhopadhyay; Sorrachai Yingchareonthawornchai (STOC, 2025)

Shortcuts and Transitive-Closure Spanners Approximation. - Parinya Chalermsook; Yonggang Jiang; Sagnik Mukhopadhyay; Danupon Nanongkai (CoRR, 2025)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations. - Joakim Blikstad; Yonggang Jiang; Sagnik Mukhopadhyay; Sorrachai Yingchareonthawornchai (CoRR, 2025)