I agree that this site is using cookies. You can find further informations here.
X
Mukhopadhyay, Sagnik
51  results:
Search for persons X
?
1

Finding a Small Vertex Cut on Distributed Networks:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Jiang, Yonggang ; Mukhopadhyay, Sagnik - p. 1791-1801 , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

Fast Algorithms via Dynamic-Oracle Matroids:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Blikstad, Joakim ; Mukhopadhyay, Sagnik ; Nanongkai, Danupon. - p. 1229-1242 , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

Cut Query Algorithms with Star Contraction:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Apers, Simon ; Efron, Yuval ; Gawrychowski, Pawel... - p. 507-518 , 2022
Link: https://doi.org/10.1109/..
 
?
4

Nearly Optimal Communication and Query Complexity of Bipart..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Blikstad, Joakim ; Van Den Brand, Jan ; Efron, Yuval.. - p. 1174-1185 , 2022
Link: https://doi.org/10.1109/..
 
?
5

Faster Connectivity in Low-Rank Hypergraphs via Expander De..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Beideman, Calvin ; Chandrasekaran, Karthekeyan ; Mukhopadhyay, Sagnik. - p. 70-83 , 2022
Link: https://doi.org/10.1007/..
 
?
6

Nonlinear Finite Element Analysis and Artificial Intelligen..:

, In: Lecture Notes in Civil Engineering; Recent Advances in Materials, Mechanics and Structures,
Mukhopadhyay, Sagnik ; Chowdhury, Subhashish Roy - p. 649-666 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs:

, In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures,
López-Martínez, Andrés ; Mukhopadhyay, Sagnik ; Nanongkai, Danupon - p. 351-361 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

Breaking the quadratic barrier for matroid intersection:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Blikstad, Joakim ; van den Brand, Jan ; Mukhopadhyay, Sagnik. - p. 421-432 , 2021
Link: https://dl.acm.org/doi/1..
 
?
9

Distributed weighted min-cut in nearly-optimal time:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Dory, Michal ; Efron, Yuval ; Mukhopadhyay, Sagnik. - p. 1144-1153 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Weighted min-cut: sequential, cut-query, and streaming algo..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Mukhopadhyay, Sagnik ; Nanongkai, Danupon - p. 496-509 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

Simulation Theorems via Pseudo-random Properties:

Chattopadhyay, Arkadev ; Koucký, Michal ; Loff, Bruno.
computational complexity.  28 (2019)  4 - p. 617-659 , 2019
Link: https://doi.org/10.1007/..
 
?
12

Simulation beats richness: new data-structure lower bounds:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
Chattopadhyay, Arkadev ; Koucký, Michal ; Loff, Bruno. - p. 1013-1020 , 2018
Link: https://dl.acm.org/doi/1..
 
?
13

Separation Between Deterministic and Randomized Query Compl..:

Mukhopadhyay, Sagnik ; Radhakrishnan, Jaikumar ; Sanyal, Swagato
SIAM Journal on Computing.  47 (2018)  4 - p. 1644-1666 , 2018
Link: https://doi.org/10.1137/..
 
?
14

Migratory polyarthritis in familial hypercholesterolemia (t..:

Chakraborty, Partha Pratim ; Mukhopadhyay, Sagnik ; Achar, Arun..
The Indian Journal of Pediatrics.  77 (2010)  3 - p. 329-331 , 2010
Link: https://doi.org/10.1007/..
 
?
15

Fast Algorithms via Dynamic-Oracle Matroids:

Blikstad, Joakim ; Mukhopadhyay, Sagnik ; Nanongkai, Danupon.
http://arxiv.org/abs/2302.09796.  , 2023
Link: http://arxiv.org/abs/230..
 
1-15