Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sagnik Mukhopadhyay
@inproceedings{DBLP:conf/stoc/BlikstadMNT23,
author = {Joakim Blikstad and
Sagnik Mukhopadhyay and
Danupon Nanongkai and
Ta{-}Wei Tu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Fast Algorithms via Dynamic-Oracle Matroids},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1229--1242},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585219},
doi = {10.1145/3564246.3585219},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlikstadMNT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JiangM23,
author = {Yonggang Jiang and
Sagnik Mukhopadhyay},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Finding a Small Vertex Cut on Distributed Networks},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1791--1801},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585201},
doi = {10.1145/3564246.3585201},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JiangM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-09796,
author = {Joakim Blikstad and
Sagnik Mukhopadhyay and
Danupon Nanongkai and
Ta{-}Wei Tu},
title = {Fast Algorithms via Dynamic-Oracle Matroids},
journal = {CoRR},
volume = {abs/2302.09796},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.09796},
doi = {10.48550/ARXIV.2302.09796},
eprinttype = {arXiv},
eprint = {2302.09796},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-09796.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-11651,
author = {Yonggang Jiang and
Sagnik Mukhopadhyay},
title = {Finding a Small Vertex Cut on Distributed Networks},
journal = {CoRR},
volume = {abs/2302.11651},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.11651},
doi = {10.48550/ARXIV.2302.11651},
eprinttype = {arXiv},
eprint = {2302.11651},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-11651.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApersEGLMN22,
author = {Simon Apers and
Yuval Efron and
Pawel Gawrychowski and
Troy Lee and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Cut Query Algorithms with Star Contraction},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {507--518},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00055},
doi = {10.1109/FOCS54457.2022.00055},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ApersEGLMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlikstadBEMN22,
author = {Joakim Blikstad and
Jan van den Brand and
Yuval Efron and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Nearly Optimal Communication and Query Complexity of Bipartite Matching},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1174--1185},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00113},
doi = {10.1109/FOCS54457.2022.00113},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BlikstadBEMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BeidemanCMN22,
author = {Calvin Beideman and
Karthekeyan Chandrasekaran and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
editor = {Karen I. Aardal and
Laura Sanit{\`{a}}},
title = {Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition},
booktitle = {Integer Programming and Combinatorial Optimization - 23rd International
Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13265},
pages = {70--83},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06901-7\_6},
doi = {10.1007/978-3-031-06901-7\_6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BeidemanCMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05674,
author = {Simon Apers and
Yuval Efron and
Pawel Gawrychowski and
Troy Lee and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Cut query algorithms with star contraction},
journal = {CoRR},
volume = {abs/2201.05674},
year = {2022},
url = {https://arxiv.org/abs/2201.05674},
eprinttype = {arXiv},
eprint = {2201.05674},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05674.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-02526,
author = {Joakim Blikstad and
Jan van den Brand and
Yuval Efron and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Nearly Optimal Communication and Query Complexity of Bipartite Matching},
journal = {CoRR},
volume = {abs/2208.02526},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.02526},
doi = {10.48550/ARXIV.2208.02526},
eprinttype = {arXiv},
eprint = {2208.02526},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-02526.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Lopez-MartinezM21,
author = {Andr{\'{e}}s L{\'{o}}pez{-}Mart{\'{\i}}nez and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
editor = {Kunal Agrawal and
Yossi Azar},
title = {Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs},
booktitle = {{SPAA} '21: 33rd {ACM} Symposium on Parallelism in Algorithms and
Architectures, Virtual Event, USA, 6-8 July, 2021},
pages = {351--361},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3409964.3461806},
doi = {10.1145/3409964.3461806},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/Lopez-MartinezM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlikstadBMN21,
author = {Joakim Blikstad and
Jan van den Brand and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Breaking the quadratic barrier for matroid intersection},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {421--432},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451092},
doi = {10.1145/3406325.3451092},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BlikstadBMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DoryEMN21,
author = {Michal Dory and
Yuval Efron and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Distributed weighted min-cut in nearly-optimal time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1144--1153},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451020},
doi = {10.1145/3406325.3451020},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DoryEMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-05548,
author = {Joakim Blikstad and
Jan van den Brand and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Breaking the Quadratic Barrier for Matroid Intersection},
journal = {CoRR},
volume = {abs/2102.05548},
year = {2021},
url = {https://arxiv.org/abs/2102.05548},
eprinttype = {arXiv},
eprint = {2102.05548},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-05548.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-06565,
author = {Andr{\'{e}}s L{\'{o}}pez{-}Mart{\'{\i}}nez and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs},
journal = {CoRR},
volume = {abs/2102.06565},
year = {2021},
url = {https://arxiv.org/abs/2102.06565},
eprinttype = {arXiv},
eprint = {2102.06565},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-06565.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-15724,
author = {Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {A Note on Isolating Cut Lemma for Submodular Function Minimization},
journal = {CoRR},
volume = {abs/2103.15724},
year = {2021},
url = {https://arxiv.org/abs/2103.15724},
eprinttype = {arXiv},
eprint = {2103.15724},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-15724.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MukhopadhyayN20,
author = {Sagnik Mukhopadhyay and
Danupon Nanongkai},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Weighted min-cut: sequential, cut-query, and streaming algorithms},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {496--509},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384334},
doi = {10.1145/3357713.3384334},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MukhopadhyayN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-09129,
author = {Michal Dory and
Yuval Efron and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Distributed Weighted Min-Cut in Nearly-Optimal Time},
journal = {CoRR},
volume = {abs/2004.09129},
year = {2020},
url = {https://arxiv.org/abs/2004.09129},
eprinttype = {arXiv},
eprint = {2004.09129},
timestamp = {Wed, 22 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-09129.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-08097,
author = {Calvin Beideman and
Karthekeyan Chandrasekaran and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Faster connectivity in low-rank hypergraphs via expander decomposition},
journal = {CoRR},
volume = {abs/2011.08097},
year = {2020},
url = {https://arxiv.org/abs/2011.08097},
eprinttype = {arXiv},
eprint = {2011.08097},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-08097.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChattopadhyayKL19,
author = {Arkadev Chattopadhyay and
Michal Kouck{\'{y}} and
Bruno Loff and
Sagnik Mukhopadhyay},
title = {Simulation Theorems via Pseudo-random Properties},
journal = {Comput. Complex.},
volume = {28},
number = {4},
pages = {617--659},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00190-7},
doi = {10.1007/S00037-019-00190-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ChattopadhyayKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LoffM19,
author = {Bruno Loff and
Sagnik Mukhopadhyay},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Lifting Theorems for Equality},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {50:1--50:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.50},
doi = {10.4230/LIPICS.STACS.2019.50},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/LoffM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01651,
author = {Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms},
journal = {CoRR},
volume = {abs/1911.01651},
year = {2019},
url = {http://arxiv.org/abs/1911.01651},
eprinttype = {arXiv},
eprint = {1911.01651},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01651.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MukhopadhyayRS18,
author = {Sagnik Mukhopadhyay and
Jaikumar Radhakrishnan and
Swagato Sanyal},
title = {Separation Between Deterministic and Randomized Query Complexity},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1644--1666},
year = {2018},
url = {https://doi.org/10.1137/17M1124115},
doi = {10.1137/17M1124115},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MukhopadhyayRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayKL18,
author = {Arkadev Chattopadhyay and
Michal Kouck{\'{y}} and
Bruno Loff and
Sagnik Mukhopadhyay},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Simulation beats richness: new data-structure lower bounds},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {1013--1020},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188874},
doi = {10.1145/3188745.3188874},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LoffM18,
author = {Bruno Loff and
Sagnik Mukhopadhyay},
title = {Lifting Theorems for Equality},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-175}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/175},
eprinttype = {ECCC},
eprint = {TR18-175},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LoffM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChattopadhyayDK17,
author = {Arkadev Chattopadhyay and
Pavel Dvor{\'{a}}k and
Michal Kouck{\'{y}} and
Bruno Loff and
Sagnik Mukhopadhyay},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {Lower Bounds for Elimination via Weak Regularity},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {21:1--21:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.21},
doi = {10.4230/LIPICS.STACS.2017.21},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChattopadhyayDK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChattopadhyayKL17,
author = {Arkadev Chattopadhyay and
Michal Kouck{\'{y}} and
Bruno Loff and
Sagnik Mukhopadhyay},
title = {Simulation Theorems via Pseudorandom Properties},
journal = {CoRR},
volume = {abs/1704.06807},
year = {2017},
url = {http://arxiv.org/abs/1704.06807},
eprinttype = {arXiv},
eprint = {1704.06807},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChattopadhyayKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayKL17,
author = {Arkadev Chattopadhyay and
Michal Kouck{\'{y}} and
Bruno Loff and
Sagnik Mukhopadhyay},
title = {Composition and Simulation Theorems via Pseudo-random Properties},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-014}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/014},
eprinttype = {ECCC},
eprint = {TR17-014},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayKL17a,
author = {Arkadev Chattopadhyay and
Michal Kouck{\'{y}} and
Bruno Loff and
Sagnik Mukhopadhyay},
title = {Simulation Beats Richness: New Data-Structure Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-170}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/170},
eprinttype = {ECCC},
eprint = {TR17-170},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayKL17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChattopadhyayM16,
author = {Arkadev Chattopadhyay and
Sagnik Mukhopadhyay},
title = {Tribes Is Hard in the Message Passing Model},
journal = {CoRR},
volume = {abs/1602.06079},
year = {2016},
url = {http://arxiv.org/abs/1602.06079},
eprinttype = {arXiv},
eprint = {1602.06079},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChattopadhyayM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayDK16,
author = {Arkadev Chattopadhyay and
Pavel Dvor{\'{a}}k and
Michal Kouck{\'{y}} and
Bruno Loff and
Sagnik Mukhopadhyay},
title = {Lower Bounds for Elimination via Weak Regularity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-165}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/165},
eprinttype = {ECCC},
eprint = {TR16-165},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayDK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Mukhopadhyay16,
author = {Sagnik Mukhopadhyay},
title = {Tribes Is Hard in the Message Passing Model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-027}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/027},
eprinttype = {ECCC},
eprint = {TR16-027},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Mukhopadhyay16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MukhopadhyayS15,
author = {Sagnik Mukhopadhyay and
Swagato Sanyal},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {Towards Better Separation between Deterministic and Randomized Query
Complexity},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {206--220},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.206},
doi = {10.4230/LIPICS.FSTTCS.2015.206},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/MukhopadhyayS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChattopadhyayM15,
author = {Arkadev Chattopadhyay and
Sagnik Mukhopadhyay},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {Tribes Is Hard in the Message Passing Model},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
series = {LIPIcs},
volume = {30},
pages = {224--237},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.224},
doi = {10.4230/LIPICS.STACS.2015.224},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChattopadhyayM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MukhopadhyayS15,
author = {Sagnik Mukhopadhyay and
Swagato Sanyal},
title = {Towards Better Separation between Deterministic and Randomized Query
Complexity},
journal = {CoRR},
volume = {abs/1506.06399},
year = {2015},
url = {http://arxiv.org/abs/1506.06399},
eprinttype = {arXiv},
eprint = {1506.06399},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MukhopadhyayS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MukhopadhyayS15,
author = {Sagnik Mukhopadhyay and
Swagato Sanyal},
title = {Towards Better Separation between Deterministic and Randomized Query
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-107}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/107},
eprinttype = {ECCC},
eprint = {TR15-107},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MukhopadhyayS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-10-04 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
