BibTeX records: Morris Yau

download as .bib file

@inproceedings{DBLP:conf/soda/RaghavendraY20,
  author    = {Prasad Raghavendra and
               Morris Yau},
  editor    = {Shuchi Chawla},
  title     = {List Decodable Learning via Sum of Squares},
  booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages     = {161--180},
  publisher = {{SIAM}},
  year      = {2020},
  url       = {https://doi.org/10.1137/1.9781611975994.10},
  doi       = {10.1137/1.9781611975994.10},
  timestamp = {Fri, 31 Jan 2020 13:35:06 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/RaghavendraY20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-03004,
  author    = {Prasad Raghavendra and
               Morris Yau},
  title     = {List Decodable Subspace Recovery},
  journal   = {CoRR},
  volume    = {abs/2002.03004},
  year      = {2020},
  url       = {https://arxiv.org/abs/2002.03004},
  archivePrefix = {arXiv},
  eprint    = {2002.03004},
  timestamp = {Wed, 12 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2002-03004.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-09796,
  author    = {Yeshwanth Cherapanamjeri and
               Sidhanth Mohanty and
               Morris Yau},
  title     = {List Decodable Mean Estimation in Nearly Linear Time},
  journal   = {CoRR},
  volume    = {abs/2005.09796},
  year      = {2020},
  url       = {https://arxiv.org/abs/2005.09796},
  archivePrefix = {arXiv},
  eprint    = {2005.09796},
  timestamp = {Fri, 22 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2005-09796.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-04660,
  author    = {Prasad Raghavendra and
               Morris Yau},
  title     = {List Decodable Learning via Sum of Squares},
  journal   = {CoRR},
  volume    = {abs/1905.04660},
  year      = {2019},
  url       = {http://arxiv.org/abs/1905.04660},
  archivePrefix = {arXiv},
  eprint    = {1905.04660},
  timestamp = {Tue, 28 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1905-04660.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Yau16,
  author    = {Morris Yau},
  title     = {Almost Cubic Bound for Depth Three Circuits in {VP}},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {187},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/187},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/Yau16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics