Items where authors include "Mukhopadhyay, S."

Article

Chattopadhyay, A., Koucký, M., Loff, B. et al. (1 more author) (2019) Simulation theorems via pseudo-random properties. Computational Complexity, 28. pp. 617-659. ISSN 1016-3328

Mukhopadhyay, S. orcid.org/0000-0002-3722-4679, Radhakrishnan, J. and Sanyal, S. (2018) Separation between deterministic and randomized query complexity. SIAM Journal on Computing, 47 (4). pp. 1644-1666. ISSN 0097-5397

Thomas, D. C., Clare, S., Sowerby, J. M. et al. (24 more authors) (2017) Eros is a novel transmembrane protein that controls the phagocyte respiratory burst and is essential for innate immunity. Journal of Experimental Medicine, 214 (4). 1111. ISSN 0022-1007

Blohmke, C.J., Darton, T.C. orcid.org/0000-0003-2209-9956, Jones, C. et al. (24 more authors) (2016) Interferon-driven alterations of the host's amino acid metabolism in the pathogenesis of typhoid fever. Journal of Experimental Medicine, 213 (6). pp. 1061-1077. ISSN 0022-1007

Proceedings Paper

Blikstad, J., Mukhopadhyay, S. orcid.org/0000-0002-3722-4679, Nanongkai, D. et al. (1 more author) (2023) Fast algorithms via dynamic-oracle matroids. In: Barna, S. and Servedio, R.A., (eds.) STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. STOC 2023: 55th Annual ACM Symposium on Theory of Computing, 20-23 Jun 2023, Orlando, Florida. ACM , pp. 1229-1242. ISBN 9781450399135

Apers, S., Efron, Y., Gawrychowski, P. et al. (3 more authors) (2022) Cut query algorithms with star contraction. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 31 Oct - 03 Nov 2022, Denver, CO, USA. Institute of Electrical and Electronics Engineers (IEEE) , pp. 507-518. ISBN 9781665455206

Blikstad, J., Van Den Brand, J., Efron, Y. et al. (2 more authors) (2022) Nearly optimal communication and query complexity of bipartite matching. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 31 Oct - 03 Nov 2022, Denver, CO, USA. Institute of Electrical and Electronics Engineers (IEEE) , pp. 1174-1185. ISBN 9781665455206

Blikstad, J., van den Brand, J., Mukhopadhyay, S. orcid.org/0000-0002-3722-4679 et al. (1 more author) (2021) Breaking the quadratic barrier for matroid intersection. In: Khuller, S., (ed.) STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 21-25 Jun 2021, Virtual, Italy. Association for Computing Machinery (ACM) , pp. 421-432. ISBN 9781450380539

Dory, M., Efron, Y., Mukhopadhyay, S. orcid.org/0000-0002-3722-4679 et al. (1 more author) (2021) Distributed weighted min-cut in nearly-optimal time. In: Khuller, S., (ed.) STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 21-25 Jun 2021, Virtual Italy. Association for Computing Machinery (ACM) , pp. 1144-1153. ISBN 9781450380539

Mukhopadhyay, S. orcid.org/0000-0002-3722-4679 and Nanongkai, D. orcid.org/0000-0003-4468-2675 (2020) Weighted min-cut: sequential, cut-query, and streaming algorithms. In: Makarychev, K., Makarychev, Y., Tulsiani, M. and Kamath, G., (eds.) STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing, 22-26 Jun 2020, IL, Chicago, USA. Association for Computing Machinery (ACM) , pp. 496-509. ISBN 9781450369794

Loff, B. and Mukhopadhyay, S. orcid.org/0000-0002-3722-4679 (2019) Lifting theorems for equality. In: Niedermeier, R. and Paul, C., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 13-16 Mar 2019, Berlin, Germany. Leibniz International Proceedings in Informatics, 126 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 50:1-50:19. ISBN 978-3-95977-100-9

Chattopadhyay, A., Koucký, M., Loff, B. et al. (1 more author) (2018) Simulation beats richness: new data-structure lower bounds. In: Diakonikolas, I. and Kempe, D., (eds.) STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. STOC '18: Symposium on Theory of Computing, 25-29 Jun 2018, CA, Los Angeles, USA. Association for Computing Machinery (ACM) , pp. 1013-1020. ISBN 9781450355599

Chattopadhyay, A., Dvořák, P., Koucký, M. et al. (2 more authors) (2017) Lower bounds for elimination via weak regularity. In: Vollmer, H. and Vallée, B., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 08-11 Mar 2017, Hannover, Germany. Leibniz International Proceedings in Informatics, 66 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 21:1-21:14. ISBN 978-3-95977-028-6