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

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..
 
?
2

Finding a Small Vertex Cut on Distributed Networks:

Jiang, Yonggang ; Mukhopadhyay, Sagnik
http://arxiv.org/abs/2302.11651.  , 2023
Link: http://arxiv.org/abs/230..
 
?
3

Nearly Optimal Communication and Query Complexity of Bipart..:

Blikstad, Joakim ; Brand, Jan van den ; Efron, Yuval..
http://arxiv.org/abs/2208.02526.  , 2022
Link: http://arxiv.org/abs/220..
 
?
4

Cut query algorithms with star contraction:

Apers, Simon ; Efron, Yuval ; Gawrychowski, Paweł...
http://arxiv.org/abs/2201.05674.  , 2022
Link: http://arxiv.org/abs/220..
 
?
5

Breaking the Quadratic Barrier for Matroid Intersection:

Blikstad, Joakim ; Brand, Jan van den ; Mukhopadhyay, Sagnik.
http://arxiv.org/abs/2102.05548.  , 2021
Link: http://arxiv.org/abs/210..
 
?
6

A Note on Isolating Cut Lemma for Submodular Function Minim..:

Mukhopadhyay, Sagnik ; Nanongkai, Danupon
http://arxiv.org/abs/2103.15724.  , 2021
Link: http://arxiv.org/abs/210..
 
?
7

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

López-Martínez, Andrés ; Mukhopadhyay, Sagnik ; Nanongkai, Danupon
http://arxiv.org/abs/2102.06565.  , 2021
Link: http://arxiv.org/abs/210..
 
?
8

Distributed Weighted Min-Cut in Nearly-Optimal Time:

Dory, Michal ; Efron, Yuval ; Mukhopadhyay, Sagnik.
http://arxiv.org/abs/2004.09129.  , 2020
Link: http://arxiv.org/abs/200..
 
?
9

Faster connectivity in low-rank hypergraphs via expander de..:

Beideman, Calvin ; Chandrasekaran, Karthekeyan ; Mukhopadhyay, Sagnik.
http://arxiv.org/abs/2011.08097.  , 2020
Link: http://arxiv.org/abs/201..
 
?
10

Weighted Min-Cut: Sequential, Cut-Query and Streaming Algor..:

Mukhopadhyay, Sagnik ; Nanongkai, Danupon
http://arxiv.org/abs/1911.01651.  , 2019
Link: http://arxiv.org/abs/191..
 
?
11

Lifting Theorems for Equality:

Loff, Bruno ; Mukhopadhyay, Sagnik
doi:10.4230/LIPIcs.STACS.2019.50.  , 2019
Link: https://doi.org/10.4230/..
 
?
12

Lifting Theorems for Equality:

Mukhopadhyay, Sagnik ; Loff, Bruno
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-248596.  , 2019
Link: http://urn.kb.se/resolve..
 
?
13

Simulation Theorems via Pseudo-random Properties:

Chattopadhyay, Arkadev ; Koucký, Michal ; Loff, Bruno.
Computational Complexity, 1016-3328, 2019, 28:4, s. 617-659.  , 2019
Link: http://urn.kb.se/resolve..
 
?
14

Low-Carbohydrate High-Fat (LCHF) Diet: Evidence of Its Bene..:

De, Parijat ; Mukhopadhyay, Sagnik
ISBN:978-1-78923-274-5.  , 2018
Link: https://mts.intechopen.c..
 
?
15

Simulation Theorems via Pseudorandom Properties:

Chattopadhyay, Arkadev ; Koucký, Michal ; Loff, Bruno.
http://arxiv.org/abs/1704.06807.  , 2017
Link: http://arxiv.org/abs/170..
 
1-15