Sagnik Mukhopadhyay

From MaRDI portal
Person:2164679

Available identifiers

zbMath Open mukhopadhyay.sagnikMaRDI QIDQ2164679

List of research outcomes





PublicationDate of PublicationType
Fast algorithms via dynamic-oracle matroids2024-05-08Paper
Breaking the quadratic barrier for matroid intersection2023-11-14Paper
Distributed weighted min-cut in nearly-optimal time2023-11-14Paper
Faster connectivity in low-rank hypergraphs via expander decomposition2022-08-16Paper
Lifting Theorems for Equality2022-07-18Paper
Weighted min-cut: sequential, cut-query, and streaming algorithms2021-01-19Paper
Simulation theorems via pseudo-random properties2019-12-19Paper
Simulation beats richness: new data-structure lower bounds2019-08-22Paper
Separation between deterministic and randomized query complexity2018-09-18Paper
Lower bounds for elimination via weak regularity2018-04-19Paper
Towards better separation between deterministic and randomized query complexity2017-07-13Paper
Tribes is hard in the message passing model2017-01-24Paper

Research outcomes over time

This page was built for person: Sagnik Mukhopadhyay

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2164679&oldid=6661248"
Powered by MediaWiki