Follow
Sagnik Mukhopadhyay
Sagnik Mukhopadhyay
Lecturer in Algorithms
Verified email at sheffield.ac.uk - Homepage
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
382020
Simulation theorems via pseudo-random properties
A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay
computational complexity 28 (4), 617-659, 2019
322019
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
192018
Lifting theorems for equality
B Loff, S Mukhopadhyay
36th International Symposium on Theoretical Aspects of Computer Science …, 2019
152019
Tribes is hard in the message passing model
A Chattopadhyay, S Mukhopadhyay
arXiv preprint arXiv:1602.06079, 2016
122016
Towards better separation between deterministic and randomized query complexity
S Mukhopadhyay, S Sanyal
arXiv preprint arXiv:1506.06399, 2015
122015
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
102021
Composition and Simulation Theorems via Pseudo-random Properties.
A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay
Electron. Colloquium Comput. Complex. 24, 14, 2017
92017
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
62021
A note on isolating cut lemma for submodular function minimization
S Mukhopadhyay, D Nanongkai
arXiv preprint arXiv:2103.15724, 2021
62021
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
62017
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
61992
Lifting Theorems for Equality.
S Mukhopadhyay, B Loff
STACS 2019, 36th International Symposium on Theoretical Aspects of Computer …, 2019
42019
Lifting Theorems for Equality.
S Mukhopadhyay, B Loff
STACS 2019, 36th International Symposium on Theoretical Aspects of Computer …, 2019
42019
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
22022
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
22021
Balanced bipartitioning of a multi-weighted hypergraph for heterogeneous FPGAS
S Mukhopadhyay, P Banerjee, S Sur-Kolay
2011 VII Southern Conference on Programmable Logic (SPL), 91-96, 2011
22011
A generalized integral with applications to trigonometric series
SN Mukhopadhyay, SK Mukhopadhyay
Analysis Mathematica 22 (2), 125-146, 1996
21996
Approximate mean continuous intecgral
SK Mukhopadhyay, SN Mukhopadhyay
Acta Mathematica Hungarica 64 (3), 247-267, 1994
21994
Cut query algorithms with star contraction
S Apers, Y Efron, P Gawrychowski, T Lee, S Mukhopadhyay, ...
arXiv preprint arXiv:2201.05674, 2022
12022
The system can't perform the operation now. Try again later.
Articles 1–20