Sagnik Mukhopadhyay

From MaRDI portal
Person:2164679



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Polynomial pass semi-streaming lower bounds for \(k\)-cores and degeneracy2026-01-28Paper
Fast algorithms via dynamic-oracle matroids2024-05-08Paper
Breaking the quadratic barrier for matroid intersection
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
Breaking the quadratic barrier for matroid intersection
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
Distributed weighted min-cut in nearly-optimal time
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
Distributed weighted min-cut in nearly-optimal time
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
Faster connectivity in low-rank hypergraphs via expander decomposition
(available as arXiv preprint)
2022-08-16Paper
Lifting Theorems for Equality2022-07-18Paper
Weighted min-cut: sequential, cut-query, and streaming algorithms
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
2021-01-19Paper
Simulation theorems via pseudo-random properties
Computational Complexity
2019-12-19Paper
Simulation beats richness: new data-structure lower bounds
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
2019-08-22Paper
Separation between deterministic and randomized query complexity
SIAM Journal on Computing
2018-09-18Paper
Lower bounds for elimination via weak regularity2018-04-19Paper
Towards better separation between deterministic and randomized query complexity
(available as arXiv preprint)
2017-07-13Paper
Tribes is hard in the message passing model
(available as arXiv preprint)
2017-01-24Paper


Research outcomes over time


This page was built for person: Sagnik Mukhopadhyay