Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Makrand Sinha
@article{DBLP:journals/corr/abs-2402-14803,
author = {Tony Metger and
Alexander Poremba and
Makrand Sinha and
Henry Yuen},
title = {Pseudorandom unitaries with non-adaptive security},
journal = {CoRR},
volume = {abs/2402.14803},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.14803},
doi = {10.48550/ARXIV.2402.14803},
eprinttype = {arXiv},
eprint = {2402.14803},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-14803.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/MetgerPSY24,
author = {Tony Metger and
Alexander Poremba and
Makrand Sinha and
Henry Yuen},
title = {Pseudorandom unitaries with non-adaptive security},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {302},
year = {2024},
url = {https://eprint.iacr.org/2024/302},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/MetgerPSY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HamoudiLS24,
author = {Yassine Hamoudi and
Qipeng Liu and
Makrand Sinha},
title = {The {NISQ} Complexity of Collision Finding},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {360},
year = {2024},
url = {https://eprint.iacr.org/2024/360},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/HamoudiLS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GirishST023,
author = {Uma Girish and
Makrand Sinha and
Avishay Tal and
Kewen Wu},
title = {Fourier Growth of Communication Protocols for {XOR} Functions},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {721--732},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00047},
doi = {10.1109/FOCS57990.2023.00047},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/GirishST023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KretschmerQST23,
author = {William Kretschmer and
Luowen Qian and
Makrand Sinha and
Avishay Tal},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Quantum Cryptography in Algorithmica},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1589--1602},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585225},
doi = {10.1145/3564246.3585225},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KretschmerQST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-13926,
author = {Uma Girish and
Makrand Sinha and
Avishay Tal and
Kewen Wu},
title = {Fourier Growth of Communication Protocols for {XOR} Functions},
journal = {CoRR},
volume = {abs/2307.13926},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.13926},
doi = {10.48550/ARXIV.2307.13926},
eprinttype = {arXiv},
eprint = {2307.13926},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-13926.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-16711,
author = {Jamico Schade and
Makrand Sinha and
Stefan Weltge},
title = {Lower Bounds on the Complexity of Mixed-Integer Programs for Stable
Set and Knapsack},
journal = {CoRR},
volume = {abs/2308.16711},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.16711},
doi = {10.48550/ARXIV.2308.16711},
eprinttype = {arXiv},
eprint = {2308.16711},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-16711.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-16057,
author = {Uma Girish and
Makrand Sinha and
Avishay Tal and
Kewen Wu},
title = {The Power of Adaptivity in Quantum Query Algorithms},
journal = {CoRR},
volume = {abs/2311.16057},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.16057},
doi = {10.48550/ARXIV.2311.16057},
eprinttype = {arXiv},
eprint = {2311.16057},
timestamp = {Wed, 29 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-16057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001SW22,
author = {Nikhil Bansal and
Makrand Sinha and
Ronald de Wolf},
editor = {Shachar Lovett},
title = {Influence in Completely Bounded Block-Multilinear Forms and Classical
Simulation of Quantum Algorithms},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {28:1--28:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.28},
doi = {10.4230/LIPICS.CCC.2022.28},
timestamp = {Tue, 12 Jul 2022 17:25:23 +0200},
biburl = {https://dblp.org/rec/conf/coco/0001SW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0001JM0S22,
author = {Nikhil Bansal and
Haotian Jiang and
Raghu Meka and
Sahil Singla and
Makrand Sinha},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Smoothed Analysis of the Koml{\'{o}}s Conjecture},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {14:1--14:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.14},
doi = {10.4230/LIPICS.ICALP.2022.14},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/0001JM0S22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BansalJM0S22,
author = {Nikhil Bansal and
Haotian Jiang and
Raghu Meka and
Sahil Singla and
Makrand Sinha},
editor = {Mark Braverman},
title = {Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {13:1--13:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.13},
doi = {10.4230/LIPICS.ITCS.2022.13},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BansalJM0S22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-00212,
author = {Nikhil Bansal and
Makrand Sinha and
Ronald de Wolf},
title = {Influence in Completely Bounded Block-multilinear Forms and Classical
Simulation of Quantum Algorithms},
journal = {CoRR},
volume = {abs/2203.00212},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.00212},
doi = {10.48550/ARXIV.2203.00212},
eprinttype = {arXiv},
eprint = {2203.00212},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-00212.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-11427,
author = {Nikhil Bansal and
Haotian Jiang and
Raghu Meka and
Sahil Singla and
Makrand Sinha},
title = {Smoothed Analysis of the Koml{\'{o}}s Conjecture},
journal = {CoRR},
volume = {abs/2204.11427},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.11427},
doi = {10.48550/ARXIV.2204.11427},
eprinttype = {arXiv},
eprint = {2204.11427},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-11427.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-12954,
author = {Yassine Hamoudi and
Qipeng Liu and
Makrand Sinha},
title = {Quantum-Classical Tradeoffs in the Random Oracle Model},
journal = {CoRR},
volume = {abs/2211.12954},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.12954},
doi = {10.48550/ARXIV.2211.12954},
eprinttype = {arXiv},
eprint = {2211.12954},
timestamp = {Mon, 03 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-12954.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-00879,
author = {William Kretschmer and
Luowen Qian and
Makrand Sinha and
Avishay Tal},
title = {Quantum Cryptography in Algorithmica},
journal = {CoRR},
volume = {abs/2212.00879},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.00879},
doi = {10.48550/ARXIV.2212.00879},
eprinttype = {arXiv},
eprint = {2212.00879},
timestamp = {Thu, 08 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-00879.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BorstDOS21,
author = {Sander Borst and
Daniel Dadush and
Neil Olver and
Makrand Sinha},
editor = {James R. Lee},
title = {Majorizing Measures for the Optimizer},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {73:1--73:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.73},
doi = {10.4230/LIPICS.ITCS.2021.73},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BorstDOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BansalJMSS21,
author = {Nikhil Bansal and
Haotian Jiang and
Raghu Meka and
Sahil Singla and
Makrand Sinha},
editor = {D{\'{a}}niel Marx},
title = {Online Discrepancy Minimization for Stochastic Arrivals},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2842--2861},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.169},
doi = {10.1137/1.9781611976465.169},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BansalJMSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BansalS21,
author = {Nikhil Bansal and
Makrand Sinha},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {k-forrelation optimally separates Quantum and classical query complexity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1303--1316},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451040},
doi = {10.1145/3406325.3451040},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BansalS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-07049,
author = {Nikhil Bansal and
Haotian Jiang and
Raghu Meka and
Sahil Singla and
Makrand Sinha},
title = {Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing},
journal = {CoRR},
volume = {abs/2111.07049},
year = {2021},
url = {https://arxiv.org/abs/2111.07049},
eprinttype = {arXiv},
eprint = {2111.07049},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-07049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BeameHRRS20,
author = {Paul Beame and
Sariel Har{-}Peled and
Sivaramakrishnan Natarajan Ramamoorthy and
Cyrus Rashtchian and
Makrand Sinha},
title = {Edge Estimation with Independent Set Oracles},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {4},
pages = {52:1--52:27},
year = {2020},
url = {https://doi.org/10.1145/3404867},
doi = {10.1145/3404867},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BeameHRRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BansalJ0S20,
author = {Nikhil Bansal and
Haotian Jiang and
Sahil Singla and
Makrand Sinha},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Online vector balancing and geometric discrepancy},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1139--1152},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384280},
doi = {10.1145/3357713.3384280},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BansalJ0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-10622,
author = {Nikhil Bansal and
Haotian Jiang and
Raghu Meka and
Sahil Singla and
Makrand Sinha},
title = {Online Discrepancy Minimization for Stochastic Arrivals},
journal = {CoRR},
volume = {abs/2007.10622},
year = {2020},
url = {https://arxiv.org/abs/2007.10622},
eprinttype = {arXiv},
eprint = {2007.10622},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-10622.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-07003,
author = {Nikhil Bansal and
Makrand Sinha},
title = {k-Forrelation Optimally Separates Quantum and Classical Query Complexity},
journal = {CoRR},
volume = {abs/2008.07003},
year = {2020},
url = {https://arxiv.org/abs/2008.07003},
eprinttype = {arXiv},
eprint = {2008.07003},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-07003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-13306,
author = {Sander Borst and
Daniel Dadush and
Neil Olver and
Makrand Sinha},
title = {Majorizing Measures for the Optimizer},
journal = {CoRR},
volume = {abs/2012.13306},
year = {2020},
url = {https://arxiv.org/abs/2012.13306},
eprinttype = {arXiv},
eprint = {2012.13306},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-13306.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BansalS20,
author = {Nikhil Bansal and
Makrand Sinha},
title = {{\textdollar}k{\textdollar}-Forrelation Optimally Separates Quantum
and Classical Query Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-127}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/127},
eprinttype = {ECCC},
eprint = {TR20-127},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BansalS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SinhaW19,
author = {Makrand Sinha and
Ronald de Wolf},
editor = {David Zuckerman},
title = {Exponential Separation between Quantum Communication and Logarithm
of Approximate Rank},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {966--981},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00062},
doi = {10.1109/FOCS.2019.00062},
timestamp = {Tue, 07 Jan 2020 13:25:31 +0100},
biburl = {https://dblp.org/rec/conf/focs/SinhaW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-03350,
author = {Nikhil Bansal and
Haotian Jiang and
Sahil Singla and
Makrand Sinha},
title = {Online Vector Balancing and Geometric Discrepancy},
journal = {CoRR},
volume = {abs/1912.03350},
year = {2019},
url = {http://arxiv.org/abs/1912.03350},
eprinttype = {arXiv},
eprint = {1912.03350},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-03350.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Sinha18,
author = {Makrand Sinha},
title = {Lower Bounds for Interactive Compression and Linear Programs},
school = {University of Washington, {USA}},
year = {2018},
url = {https://hdl.handle.net/1773/43018},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Sinha18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/RaoS18,
author = {Anup Rao and
Makrand Sinha},
title = {Simplified Separation of Information and Communication},
journal = {Theory Comput.},
volume = {14},
number = {1},
pages = {1--29},
year = {2018},
url = {https://doi.org/10.4086/toc.2018.v014a020},
doi = {10.4086/TOC.2018.V014A020},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/RaoS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeameHRRS18,
author = {Paul Beame and
Sariel Har{-}Peled and
Sivaramakrishnan Natarajan Ramamoorthy and
Cyrus Rashtchian and
Makrand Sinha},
editor = {Anna R. Karlin},
title = {Edge Estimation with Independent Set Oracles},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {38:1--38:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.38},
doi = {10.4230/LIPICS.ITCS.2018.38},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BeameHRRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Sinha18,
author = {Makrand Sinha},
editor = {Artur Czumaj},
title = {Lower Bounds for Approximating the Matching Polytope},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1585--1604},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.104},
doi = {10.1137/1.9781611975031.104},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/Sinha18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-10090,
author = {Makrand Sinha and
Ronald de Wolf},
title = {Exponential Separation between Quantum Communication and Logarithm
of Approximate Rank},
journal = {CoRR},
volume = {abs/1811.10090},
year = {2018},
url = {http://arxiv.org/abs/1811.10090},
eprinttype = {arXiv},
eprint = {1811.10090},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-10090.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SinhaW18a,
author = {Makrand Sinha and
Ronald de Wolf},
title = {Exponential Separation between Quantum Communication and Logarithm
of Approximate Rank},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-204}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/204},
eprinttype = {ECCC},
eprint = {TR18-204},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SinhaW18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-07567,
author = {Paul Beame and
Sariel Har{-}Peled and
Sivaramakrishnan Natarajan Ramamoorthy and
Cyrus Rashtchian and
Makrand Sinha},
title = {Edge Estimation with Independent Set Oracles},
journal = {CoRR},
volume = {abs/1711.07567},
year = {2017},
url = {http://arxiv.org/abs/1711.07567},
eprinttype = {arXiv},
eprint = {1711.07567},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-07567.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-10145,
author = {Makrand Sinha},
title = {Lower Bounds for Approximating the Matching Polytope},
journal = {CoRR},
volume = {abs/1711.10145},
year = {2017},
url = {http://arxiv.org/abs/1711.10145},
eprinttype = {arXiv},
eprint = {1711.10145},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-10145.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Sinha17,
author = {Makrand Sinha},
title = {Lower Bounds for Approximating the Matching Polytope},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-185}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/185},
eprinttype = {ECCC},
eprint = {TR17-185},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Sinha17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RaoS16,
author = {Anup Rao and
Makrand Sinha},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {A Direct-Sum Theorem for Read-Once Branching Programs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {44:1--44:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.44},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.44},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/RaoS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/MoranSY16,
author = {Shay Moran and
Makrand Sinha and
Amir Yehudayoff},
editor = {Jukka Suomela},
title = {Fooling Pairs in Randomized Communication Complexity},
booktitle = {Structural Information and Communication Complexity - 23rd International
Colloquium, {SIROCCO} 2016, Helsinki, Finland, July 19-21, 2016, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9988},
pages = {49--59},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48314-6\_4},
doi = {10.1007/978-3-319-48314-6\_4},
timestamp = {Tue, 29 Dec 2020 18:39:44 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/MoranSY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/RamamoorthyS15,
author = {Sivaramakrishnan Natarajan Ramamoorthy and
Makrand Sinha},
title = {On the communication complexity of greater-than},
booktitle = {53rd Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2015, Allerton Park {\&} Retreat Center, Monticello,
IL, USA, September 29 - October 2, 2015},
pages = {442--444},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ALLERTON.2015.7447037},
doi = {10.1109/ALLERTON.2015.7447037},
timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
biburl = {https://dblp.org/rec/conf/allerton/RamamoorthyS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RaoS15,
author = {Anup Rao and
Makrand Sinha},
title = {On Parallelizing Streaming Algorithms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-039}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/039},
eprinttype = {ECCC},
eprint = {TR15-039},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RaoS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RaoS15a,
author = {Anup Rao and
Makrand Sinha},
title = {Simplified Separation of Information and Communication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-057}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/057},
eprinttype = {ECCC},
eprint = {TR15-057},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RaoS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MoranSY14,
author = {Shay Moran and
Makrand Sinha and
Amir Yehudayoff},
title = {Fooling Pairs in Randomized Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-022}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/022},
eprinttype = {ECCC},
eprint = {TR14-022},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MoranSY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/PanagiotouS12,
author = {Konstantinos Panagiotou and
Makrand Sinha},
title = {Vertices of degree \emph{k} in random unlabeled trees},
journal = {J. Graph Theory},
volume = {69},
number = {2},
pages = {114--130},
year = {2012},
url = {https://doi.org/10.1002/jgt.20567},
doi = {10.1002/JGT.20567},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/PanagiotouS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HolensteinS12,
author = {Thomas Holenstein and
Makrand Sinha},
title = {Constructing a Pseudorandom Generator Requires an Almost Linear Number
of Calls},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {698--707},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.51},
doi = {10.1109/FOCS.2012.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HolensteinS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-4576,
author = {Thomas Holenstein and
Makrand Sinha},
title = {Constructing a Pseudorandom Generator Requires an Almost Linear Number
of Calls},
journal = {CoRR},
volume = {abs/1205.4576},
year = {2012},
url = {http://arxiv.org/abs/1205.4576},
eprinttype = {arXiv},
eprint = {1205.4576},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-4576.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PanagiotouS09,
author = {Konstantinos Panagiotou and
Makrand Sinha},
title = {Vertices of Degree k in Random Unlabeled Trees},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {41--45},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.007},
doi = {10.1016/J.ENDM.2009.07.007},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PanagiotouS09.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 2024-04-25 05:32 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:
