Sagnik Mukhopadhyay

Cited by

	All	Since 2020
Citations	340	269
h-index	12	10
i10-index	12	10

201520162017201820192020202120222023202420253 6 9 17 27 30 41 51 59 66 22

Public access

View all

14 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Danupon NanongkaiDirector, Max Planck Institute for InformaticsVerified email at mpi-inf.mpg.de
Bruno LoffLASIGE, Faculdade de Ciências da Universidade de LisboaVerified email at fc.up.pt
Arkadev ChattopadhyayProfessor at Tata Institute of Fundamental ResearchVerified email at tifr.res.in
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
Joakim BlikstadCentrum Wiskunde & InformaticaVerified email at cwi.nl
Yuval EfronColumbia UniversityVerified email at columbia.edu
Jan van den BrandGeorgia TechVerified email at gatech.edu
swagato sanyalLecturer, University of Sheffield, UKVerified email at sheffield.ac.uk
Michal DoryUniversity of HaifaVerified email at ds.haifa.ac.il
Yonggang JiangMax Planck Institute for InformaticsVerified email at mpi-inf.mpg.de
Ta-Wei TuStanford UniversityVerified email at stanford.edu
Simon ApersCNRS, IRIF, Université Paris-CitéVerified email at irif.fr
Troy LeeUniversity of Technology SydneyVerified email at uts.edu.au
Paweł GawrychowskiUniversity of WrocławVerified email at cs.uni.wroc.pl
Jaikumar RadhakrishnanProfessor at Tata Institute of Fundamental Research, MumbaiVerified email at tifr.res.in
Karthekeyan ChandrasekaranUniversity of Illinois, Urbana-ChampaignVerified email at illinois.edu
Calvin BeidemanPhD Candidate, University of Illinois Urbana-ChampaignVerified email at illinois.edu
Susmita Sur-KolayProfessor of Computer ScienceVerified email at isical.ac.in
Parth MittalPhD Student, University of WaterlooVerified email at uwaterloo.ca
Sepehr AssadiUniversity of WaterlooVerified email at assadi.info

Sagnik Mukhopadhyay

Associate Professor in Computer Science

Verified email at bham.ac.uk - Homepage

Complexity theory Distributed algorithms Graph algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Weighted min-cut: sequential, cut-query, and streaming algorithms S Mukhopadhyay, D Nanongkai Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020	65	2020
Simulation theorems via pseudo-random properties A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay computational complexity 28, 617-659, 2019	44	2019
Distributed weighted min-cut in nearly-optimal time M Dory, Y Efron, S Mukhopadhyay, D Nanongkai Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021	28	2021
Simulation beats richness: New data-structure lower bounds A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	27	2018
Lifting theorems for equality B Loff, S Mukhopadhyay Leibniz International Proceedings in Informatics, LIPIcs 126, 50, 2019	24	2019
Nearly optimal communication and query complexity of bipartite matching J Blikstad, J Van Den Brand, Y Efron, S Mukhopadhyay, D Nanongkai 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	17	2022
Fast algorithms via dynamic-oracle matroids J Blikstad, S Mukhopadhyay, D Nanongkai, TW Tu Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1229-1242, 2023	16	2023
Towards better separation between deterministic and randomized query complexity S Mukhopadhyay, S Sanyal arXiv preprint arXiv:1506.06399, 2015	16	2015
Cut query algorithms with star contraction S Apers, Y Efron, P Gawrychowski, T Lee, S Mukhopadhyay, ... 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	15	2022
Breaking the quadratic barrier for matroid intersection J Blikstad, J Van Den Brand, S Mukhopadhyay, D Nanongkai Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021	15	2021
Tribes is hard in the message passing model A Chattopadhyay, S Mukhopadhyay arXiv preprint arXiv:1602.06079, 2016	13	2016
A note on isolating cut lemma for submodular function minimization S Mukhopadhyay, D Nanongkai arXiv preprint arXiv:2103.15724, 2021	12	2021
Composition and simulation theorems via pseudo-random properties A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay Electronic Colloquium on Computational Complexity (ECCC) 24, 14, 2017	9	2017
Work-optimal parallel minimum cuts for non-sparse graphs A López-Martínez, S Mukhopadhyay, D Nanongkai Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021	6	2021
Lower bounds for elimination via weak regularity A Chattopadhyay, P Dvorák, M Koucký, B Loff, S Mukhopadhyay LIPIcs-Leibniz International Proceedings in Informatics 66, 2017	6	2017
Functions of bounded kth variation and absolutely kth continuous functions SK Mukhopadhyay, SN Mukhopadhyay Bulletin of the Australian Mathematical Society 46 (1), 91-106, 1992	6	1992
Finding a Small Vertex Cut on Distributed Networks Y Jiang, S Mukhopadhyay Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1791-1801, 2023	4	2023
Lifting Theorems for Equality. S Mukhopadhyay, B Loff STACS 2019, 36th International Symposium on Theoretical Aspects of Computer …, 2019	4	2019
Separation between deterministic and randomized query complexity S Mukhopadhyay, J Radhakrishnan, S Sanyal SIAM Journal on Computing 47 (4), 1644-1666, 2018	4	2018
Faster connectivity in low-rank hypergraphs via expander decomposition C Beideman, K Chandrasekaran, S Mukhopadhyay, D Nanongkai International Conference on Integer Programming and Combinatorial …, 2022	3	2022

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors