Articles amb requisits d'accés públic - Sagnik MukhopadhyayMés informació
Disponibles en algun lloc: 14
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
Requisits: Swedish Research Council, European Commission
Simulation theorems via pseudo-random properties
A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay
computational complexity 28, 617-659, 2019
Requisits: Department of Science & Technology, India, Fundação para a Ciência e a …
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
Requisits: Swedish Research Council, European Commission
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
Requisits: Department of Science & Technology, India, Fundação para a Ciência e a …
Lifting theorems for equality
B Loff, S Mukhopadhyay
Leibniz International Proceedings in Informatics, LIPIcs 126, 50, 2019
Requisits: Fundação para a Ciência e a Tecnologia, Portugal, European Commission
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
Requisits: Swedish Research Council
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
Requisits: US Department of Defense, Swedish Research Council, European Commission
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
Requisits: Swedish Research Council, European Commission
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
Requisits: Australian Research Council, Swedish Research Council, European Commission …
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
Requisits: Department of Science & Technology, India, European Commission
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
Requisits: Department of Science & Technology, India, European Commission
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
Requisits: Swedish Research Council, European Commission
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
Requisits: US National Science Foundation, Swedish Research Council, European Commission
Lifting Theorems for Equality.
S Mukhopadhyay, B Loff
STACS 2019, 36th International Symposium on Theoretical Aspects of Computer …, 2019
Requisits: Fundação para a Ciência e a Tecnologia, Portugal, European Commission
Les dades de publicació i de finançament es determinen automàticament per mitjà d'un programa informàtic