BibTeX records: Aarthi Sundaram

download as .bib file

@article{DBLP:journals/cc/GharibianSSSY22,
  author       = {Sevag Gharibian and
                  Miklos Santha and
                  Jamie Sikora and
                  Aarthi Sundaram and
                  Justin Yirka},
  title        = {Quantum generalizations of the polynomial hierarchy with applications
                  to {QMA(2)}},
  journal      = {Comput. Complex.},
  volume       = {31},
  number       = {2},
  pages        = {13},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00037-022-00231-8},
  doi          = {10.1007/S00037-022-00231-8},
  timestamp    = {Thu, 06 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/GharibianSSSY22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/concurrency/SundaramS22,
  author       = {Aarthi Sundaram and
                  Chitrakala Sakthivel},
  title        = {Object detection and estimation: {A} hybrid image segmentation technique
                  using convolutional neural network model},
  journal      = {Concurr. Comput. Pract. Exp.},
  volume       = {34},
  number       = {21},
  year         = {2022},
  url          = {https://doi.org/10.1002/cpe.7114},
  doi          = {10.1002/CPE.7114},
  timestamp    = {Sat, 10 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/concurrency/SundaramS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2210-06419,
  author       = {Andrew M. Childs and
                  Robin Kothari and
                  Matt Kovacs{-}Deak and
                  Aarthi Sundaram and
                  Daochen Wang},
  title        = {Quantum divide and conquer},
  journal      = {CoRR},
  volume       = {abs/2210.06419},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.06419},
  doi          = {10.48550/ARXIV.2210.06419},
  eprinttype    = {arXiv},
  eprint       = {2210.06419},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-06419.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2211-07629,
  author       = {Michael E. Beverland and
                  Prakash Murali and
                  Matthias Troyer and
                  Krysta M. Svore and
                  Torsten Hoefler and
                  Vadym Kliuchnikov and
                  Guang Hao Low and
                  Mathias Soeken and
                  Aarthi Sundaram and
                  Alexander Vaschillo},
  title        = {Assessing requirements to scale to practical quantum advantage},
  journal      = {CoRR},
  volume       = {abs/2211.07629},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2211.07629},
  doi          = {10.48550/ARXIV.2211.07629},
  eprinttype    = {arXiv},
  eprint       = {2211.07629},
  timestamp    = {Wed, 16 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2211-07629.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/ArunachalamGS21,
  author       = {Srinivasan Arunachalam and
                  Alex Bredariol Grilo and
                  Aarthi Sundaram},
  title        = {Quantum Hardness of Learning Shallow Classical Circuits},
  journal      = {{SIAM} J. Comput.},
  volume       = {50},
  number       = {3},
  pages        = {972--1013},
  year         = {2021},
  url          = {https://doi.org/10.1137/20M1344202},
  doi          = {10.1137/20M1344202},
  timestamp    = {Wed, 14 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ArunachalamGS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/ArunachalamGGOS21,
  author       = {Srinivasan Arunachalam and
                  Alex B. Grilo and
                  Tom Gur and
                  Igor C. Oliveira and
                  Aarthi Sundaram},
  title        = {Quantum learning algorithms imply circuit lower bounds},
  booktitle    = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2021, Denver, CO, USA, February 7-10, 2022},
  pages        = {562--573},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/FOCS52979.2021.00062},
  doi          = {10.1109/FOCS52979.2021.00062},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/ArunachalamGGOS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icml/WangSKKR21,
  author       = {Daochen Wang and
                  Aarthi Sundaram and
                  Robin Kothari and
                  Ashish Kapoor and
                  Martin Roetteler},
  editor       = {Marina Meila and
                  Tong Zhang},
  title        = {Quantum algorithms for reinforcement learning with a generative model},
  booktitle    = {Proceedings of the 38th International Conference on Machine Learning,
                  {ICML} 2021, 18-24 July 2021, Virtual Event},
  series       = {Proceedings of Machine Learning Research},
  volume       = {139},
  pages        = {10916--10926},
  publisher    = {{PMLR}},
  year         = {2021},
  url          = {http://proceedings.mlr.press/v139/wang21w.html},
  timestamp    = {Wed, 25 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icml/WangSKKR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tcc/BroadbentJLPS21,
  author       = {Anne Broadbent and
                  Stacey Jeffery and
                  S{\'{e}}bastien Lord and
                  Supartha Podder and
                  Aarthi Sundaram},
  editor       = {Kobbi Nissim and
                  Brent Waters},
  title        = {Secure Software Leasing Without Assumptions},
  booktitle    = {Theory of Cryptography - 19th International Conference, {TCC} 2021,
                  Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {13042},
  pages        = {90--120},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-90459-3\_4},
  doi          = {10.1007/978-3-030-90459-3\_4},
  timestamp    = {Wed, 10 Nov 2021 16:16:02 +0100},
  biburl       = {https://dblp.org/rec/conf/tcc/BroadbentJLPS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2101-08939,
  author       = {Robert Rand and
                  Aarthi Sundaram and
                  Kartik Singhal and
                  Brad Lackey},
  title        = {Static Analysis of Quantum Programs via Gottesman Types},
  journal      = {CoRR},
  volume       = {abs/2101.08939},
  year         = {2021},
  url          = {https://arxiv.org/abs/2101.08939},
  eprinttype    = {arXiv},
  eprint       = {2101.08939},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2101-08939.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2112-08451,
  author       = {Daochen Wang and
                  Aarthi Sundaram and
                  Robin Kothari and
                  Ashish Kapoor and
                  Martin Roetteler},
  title        = {Quantum Algorithms for Reinforcement Learning with a Generative Model},
  journal      = {CoRR},
  volume       = {abs/2112.08451},
  year         = {2021},
  url          = {https://arxiv.org/abs/2112.08451},
  eprinttype    = {arXiv},
  eprint       = {2112.08451},
  timestamp    = {Wed, 05 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2112-08451.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/corr/abs-2109-02197,
  author       = {Robert Rand and
                  Aarthi Sundaram and
                  Kartik Singhal and
                  Brad Lackey},
  editor       = {Beno{\^{\i}}t Valiron and
                  Shane Mansfield and
                  Pablo Arrighi and
                  Prakash Panangaden},
  title        = {Gottesman Types for Quantum Programs},
  booktitle    = {Proceedings 17th International Conference on Quantum Physics and Logic,
                  {QPL} 2020, Paris, France, June 2 - 6, 2020},
  series       = {{EPTCS}},
  volume       = {340},
  pages        = {279--290},
  year         = {2020},
  url          = {https://doi.org/10.4204/EPTCS.340.14},
  doi          = {10.4204/EPTCS.340.14},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2109-02197.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2012-01920,
  author       = {Srinivasan Arunachalam and
                  Alex B. Grilo and
                  Tom Gur and
                  Igor C. Oliveira and
                  Aarthi Sundaram},
  title        = {Quantum learning algorithms imply circuit lower bounds},
  journal      = {CoRR},
  volume       = {abs/2012.01920},
  year         = {2020},
  url          = {https://arxiv.org/abs/2012.01920},
  eprinttype    = {arXiv},
  eprint       = {2012.01920},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2012-01920.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ArunachalamGGOS20,
  author       = {Srinivasan Arunachalam and
                  Alex Bredariol Grilo and
                  Tom Gur and
                  Igor C. Oliveira and
                  Aarthi Sundaram},
  title        = {Quantum learning algorithms imply circuit lower bounds},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR20-185}},
  year         = {2020},
  url          = {https://eccc.weizmann.ac.il/report/2020/185},
  eprinttype    = {ECCC},
  eprint       = {TR20-185},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ArunachalamGGOS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1903-02840,
  author       = {Srinivasan Arunachalam and
                  Alex Bredariol Grilo and
                  Aarthi Sundaram},
  title        = {Quantum hardness of learning shallow classical circuits},
  journal      = {CoRR},
  volume       = {abs/1903.02840},
  year         = {2019},
  url          = {http://arxiv.org/abs/1903.02840},
  eprinttype    = {arXiv},
  eprint       = {1903.02840},
  timestamp    = {Tue, 02 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1903-02840.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ArunachalamGS19,
  author       = {Srinivasan Arunachalam and
                  Alex Bredariol Grilo and
                  Aarthi Sundaram},
  title        = {Quantum hardness of learning shallow classical circuits},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR19-041}},
  year         = {2019},
  url          = {https://eccc.weizmann.ac.il/report/2019/041},
  eprinttype    = {ECCC},
  eprint       = {TR19-041},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ArunachalamGS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/IvanyosKQSS18,
  author       = {G{\'{a}}bor Ivanyos and
                  Raghav Kulkarni and
                  Youming Qiao and
                  Miklos Santha and
                  Aarthi Sundaram},
  title        = {On the complexity of trial and error for constraint satisfaction problems},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {92},
  pages        = {48--64},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.jcss.2017.07.005},
  doi          = {10.1016/J.JCSS.2017.07.005},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/IvanyosKQSS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/AradSSZ18,
  author       = {Itai Arad and
                  Miklos Santha and
                  Aarthi Sundaram and
                  Shengyu Zhang},
  title        = {Linear-Time Algorithm for Quantum 2SAT},
  journal      = {Theory Comput.},
  volume       = {14},
  number       = {1},
  pages        = {1--27},
  year         = {2018},
  url          = {https://doi.org/10.4086/toc.2018.v014a001},
  doi          = {10.4086/TOC.2018.V014A001},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toc/AradSSZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/GharibianSSSY18,
  author       = {Sevag Gharibian and
                  Miklos Santha and
                  Jamie Sikora and
                  Aarthi Sundaram and
                  Justin Yirka},
  editor       = {Igor Potapov and
                  Paul G. Spirakis and
                  James Worrell},
  title        = {Quantum Generalizations of the Polynomial Hierarchy with Applications
                  to {QMA(2)}},
  booktitle    = {43rd International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series       = {LIPIcs},
  volume       = {117},
  pages        = {58:1--58:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2018.58},
  doi          = {10.4230/LIPICS.MFCS.2018.58},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/GharibianSSSY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1805-11139,
  author       = {Sevag Gharibian and
                  Miklos Santha and
                  Jamie Sikora and
                  Aarthi Sundaram and
                  Justin Yirka},
  title        = {Quantum generalizations of the polynomial hierarchy with applications
                  to {QMA(2)}},
  journal      = {CoRR},
  volume       = {abs/1805.11139},
  year         = {2018},
  url          = {http://arxiv.org/abs/1805.11139},
  eprinttype    = {arXiv},
  eprint       = {1805.11139},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-11139.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/AradSSZ16,
  author       = {Itai Arad and
                  Miklos Santha and
                  Aarthi Sundaram and
                  Shengyu Zhang},
  editor       = {Ioannis Chatzigiannakis and
                  Michael Mitzenmacher and
                  Yuval Rabani and
                  Davide Sangiorgi},
  title        = {Linear Time Algorithm for Quantum 2SAT},
  booktitle    = {43rd International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2016, July 11-15, 2016, Rome, Italy},
  series       = {LIPIcs},
  volume       = {55},
  pages        = {15:1--15:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2016.15},
  doi          = {10.4230/LIPICS.ICALP.2016.15},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/AradSSZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/AradBGSSZ16,
  author       = {Itai Arad and
                  Adam Bouland and
                  Daniel Grier and
                  Miklos Santha and
                  Aarthi Sundaram and
                  Shengyu Zhang},
  editor       = {Piotr Faliszewski and
                  Anca Muscholl and
                  Rolf Niedermeier},
  title        = {On the Complexity of Probabilistic Trials for Hidden Satisfiability
                  Problems},
  booktitle    = {41st International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
  series       = {LIPIcs},
  volume       = {58},
  pages        = {12:1--12:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2016.12},
  doi          = {10.4230/LIPICS.MFCS.2016.12},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/AradBGSSZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/AradBGSSZ16,
  author       = {Itai Arad and
                  Adam Bouland and
                  Daniel Grier and
                  Miklos Santha and
                  Aarthi Sundaram and
                  Shengyu Zhang},
  title        = {On the complexity of probabilistic trials for hidden satisfiability
                  problems},
  journal      = {CoRR},
  volume       = {abs/1606.03585},
  year         = {2016},
  url          = {http://arxiv.org/abs/1606.03585},
  eprinttype    = {arXiv},
  eprint       = {1606.03585},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/AradBGSSZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/AradSSZ15,
  author       = {Itai Arad and
                  Miklos Santha and
                  Aarthi Sundaram and
                  Shengyu Zhang},
  title        = {Linear time algorithm for quantum 2SAT},
  journal      = {CoRR},
  volume       = {abs/1508.06340},
  year         = {2015},
  url          = {http://arxiv.org/abs/1508.06340},
  eprinttype    = {arXiv},
  eprint       = {1508.06340},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/AradSSZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/IvanyosKQSS14,
  author       = {G{\'{a}}bor Ivanyos and
                  Raghav Kulkarni and
                  Youming Qiao and
                  Miklos Santha and
                  Aarthi Sundaram},
  editor       = {Javier Esparza and
                  Pierre Fraigniaud and
                  Thore Husfeldt and
                  Elias Koutsoupias},
  title        = {On the Complexity of Trial and Error for Constraint Satisfaction Problems},
  booktitle    = {Automata, Languages, and Programming - 41st International Colloquium,
                  {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8572},
  pages        = {663--675},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-43948-7\_55},
  doi          = {10.1007/978-3-662-43948-7\_55},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/IvanyosKQSS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/IvanyosKQSS14,
  author       = {G{\'{a}}bor Ivanyos and
                  Raghav Kulkarni and
                  Youming Qiao and
                  Miklos Santha and
                  Aarthi Sundaram},
  title        = {On the Complexity of Trial and Error for Constraint Satisfaction Problems},
  journal      = {CoRR},
  volume       = {abs/1406.5336},
  year         = {2014},
  url          = {http://arxiv.org/abs/1406.5336},
  eprinttype    = {arXiv},
  eprint       = {1406.5336},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/IvanyosKQSS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/IvanyosKQSS14,
  author       = {G{\'{a}}bor Ivanyos and
                  Raghav Kulkarni and
                  Youming Qiao and
                  Miklos Santha and
                  Aarthi Sundaram},
  title        = {On the complexity of trial and error for constraint satisfaction problems},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR14-034}},
  year         = {2014},
  url          = {https://eccc.weizmann.ac.il/report/2014/034},
  eprinttype    = {ECCC},
  eprint       = {TR14-034},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/IvanyosKQSS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.