![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Sagnik Mukhopadhyay
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
- [j2]Arkadev Chattopadhyay, Michal Koucký
, Bruno Loff
, Sagnik Mukhopadhyay
:
Simulation Theorems via Pseudo-random Properties. Comput. Complex. 28(4): 617-659 (2019) - 2018
- [j1]Sagnik Mukhopadhyay
, Jaikumar Radhakrishnan, Swagato Sanyal:
Separation Between Deterministic and Randomized Query Complexity. SIAM J. Comput. 47(4): 1644-1666 (2018)
Conference and Workshop Papers
- 2024
- [c15]Sepehr Assadi, Prantar Ghosh
, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay:
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CCC 2024: 7:1-7:16 - 2023
- [c14]Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu
:
Fast Algorithms via Dynamic-Oracle Matroids. STOC 2023: 1229-1242 - [c13]Yonggang Jiang, Sagnik Mukhopadhyay:
Finding a Small Vertex Cut on Distributed Networks. STOC 2023: 1791-1801 - 2022
- [c12]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay
, Danupon Nanongkai:
Cut Query Algorithms with Star Contraction. FOCS 2022: 507-518 - [c11]Joakim Blikstad, Jan van den Brand
, Yuval Efron, Sagnik Mukhopadhyay
, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. FOCS 2022: 1174-1185 - [c10]Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay
, Danupon Nanongkai:
Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. IPCO 2022: 70-83 - 2021
- [c9]Andrés López-Martínez, Sagnik Mukhopadhyay
, Danupon Nanongkai
:
Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. SPAA 2021: 351-361 - [c8]Joakim Blikstad, Jan van den Brand
, Sagnik Mukhopadhyay
, Danupon Nanongkai
:
Breaking the quadratic barrier for matroid intersection. STOC 2021: 421-432 - [c7]Michal Dory, Yuval Efron, Sagnik Mukhopadhyay
, Danupon Nanongkai
:
Distributed weighted min-cut in nearly-optimal time. STOC 2021: 1144-1153 - 2020
- [c6]Sagnik Mukhopadhyay
, Danupon Nanongkai
:
Weighted min-cut: sequential, cut-query, and streaming algorithms. STOC 2020: 496-509 - 2019
- [c5]Bruno Loff
, Sagnik Mukhopadhyay
:
Lifting Theorems for Equality. STACS 2019: 50:1-50:19 - 2018
- [c4]Arkadev Chattopadhyay, Michal Koucký
, Bruno Loff
, Sagnik Mukhopadhyay
:
Simulation beats richness: new data-structure lower bounds. STOC 2018: 1013-1020 - 2017
- [c3]Arkadev Chattopadhyay, Pavel Dvorák
, Michal Koucký
, Bruno Loff
, Sagnik Mukhopadhyay
:
Lower Bounds for Elimination via Weak Regularity. STACS 2017: 21:1-21:14 - 2015
- [c2]Sagnik Mukhopadhyay
, Swagato Sanyal:
Towards Better Separation between Deterministic and Randomized Query Complexity. FSTTCS 2015: 206-220 - [c1]Arkadev Chattopadhyay, Sagnik Mukhopadhyay
:
Tribes Is Hard in the Message Passing Model. STACS 2015: 224-237
Informal and Other Publications
- 2024
- [i20]Sepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay:
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CoRR abs/2405.14835 (2024) - 2023
- [i19]Joakim Blikstad, Sagnik Mukhopadhyay
, Danupon Nanongkai, Ta-Wei Tu:
Fast Algorithms via Dynamic-Oracle Matroids. CoRR abs/2302.09796 (2023) - [i18]Yonggang Jiang, Sagnik Mukhopadhyay
:
Finding a Small Vertex Cut on Distributed Networks. CoRR abs/2302.11651 (2023) - 2022
- [i17]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut query algorithms with star contraction. CoRR abs/2201.05674 (2022) - [i16]Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay
, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. CoRR abs/2208.02526 (2022) - 2021
- [i15]Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai:
Breaking the Quadratic Barrier for Matroid Intersection. CoRR abs/2102.05548 (2021) - [i14]Andrés López-Martínez, Sagnik Mukhopadhyay, Danupon Nanongkai:
Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. CoRR abs/2102.06565 (2021) - [i13]Sagnik Mukhopadhyay, Danupon Nanongkai:
A Note on Isolating Cut Lemma for Submodular Function Minimization. CoRR abs/2103.15724 (2021) - 2020
- [i12]Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Distributed Weighted Min-Cut in Nearly-Optimal Time. CoRR abs/2004.09129 (2020) - [i11]Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai:
Faster connectivity in low-rank hypergraphs via expander decomposition. CoRR abs/2011.08097 (2020) - 2019
- [i10]Sagnik Mukhopadhyay, Danupon Nanongkai:
Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms. CoRR abs/1911.01651 (2019) - 2018
- [i9]Bruno Loff, Sagnik Mukhopadhyay:
Lifting Theorems for Equality. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i8]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation Theorems via Pseudorandom Properties. CoRR abs/1704.06807 (2017) - [i7]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Composition and Simulation Theorems via Pseudo-random Properties. Electron. Colloquium Comput. Complex. TR17 (2017) - [i6]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation Beats Richness: New Data-Structure Lower Bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i5]Arkadev Chattopadhyay, Sagnik Mukhopadhyay:
Tribes Is Hard in the Message Passing Model. CoRR abs/1602.06079 (2016) - [i4]Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Lower Bounds for Elimination via Weak Regularity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i3]Sagnik Mukhopadhyay:
Tribes Is Hard in the Message Passing Model. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i2]Sagnik Mukhopadhyay, Swagato Sanyal:
Towards Better Separation between Deterministic and Randomized Query Complexity. CoRR abs/1506.06399 (2015) - [i1]Sagnik Mukhopadhyay, Swagato Sanyal:
Towards Better Separation between Deterministic and Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR15 (2015)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint