Statistical algorithms and a lower bound for detecting planted cliques

Statistical algorithms and a lower bound for detecting planted cliques. Feldman, V., Grigorescu, E., Reyzin, L., Vempala, S., & Xiao, Y. In Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pages 655–664, 2013.

Paper doi bibtex

@inproceedings{DBLP:conf/stoc/FeldmanGRVX13,
  author    = {Vitaly Feldman and
               Elena Grigorescu and
               Lev Reyzin and
               Santosh Vempala and
               Ying Xiao},
  title     = {Statistical algorithms and a lower bound for detecting planted cliques},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  pages     = {655--664},
  year      = {2013},
  crossref  = {DBLP:conf/stoc/2013},
  url       = {https://doi.org/10.1145/2488608.2488692},
  doi       = {10.1145/2488608.2488692},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/FeldmanGRVX13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0

{"_id":"YQNSFeTT8EhDBaYpp","bibbaseid":"feldman-grigorescu-reyzin-vempala-xiao-statisticalalgorithmsandalowerboundfordetectingplantedcliques-2013","downloads":0,"creationDate":"2019-02-04T10:40:08.927Z","title":"Statistical algorithms and a lower bound for detecting planted cliques","author_short":["Feldman, V.","Grigorescu, E.","Reyzin, L.","Vempala, S.","Xiao, Y."],"year":2013,"bibtype":"inproceedings","biburl":"https://dblp.org/pid/v/SantoshVempala.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Vitaly"],"propositions":[],"lastnames":["Feldman"],"suffixes":[]},{"firstnames":["Elena"],"propositions":[],"lastnames":["Grigorescu"],"suffixes":[]},{"firstnames":["Lev"],"propositions":[],"lastnames":["Reyzin"],"suffixes":[]},{"firstnames":["Santosh"],"propositions":[],"lastnames":["Vempala"],"suffixes":[]},{"firstnames":["Ying"],"propositions":[],"lastnames":["Xiao"],"suffixes":[]}],"title":"Statistical algorithms and a lower bound for detecting planted cliques","booktitle":"Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013","pages":"655–664","year":"2013","crossref":"DBLP:conf/stoc/2013","url":"https://doi.org/10.1145/2488608.2488692","doi":"10.1145/2488608.2488692","timestamp":"Tue, 06 Nov 2018 00:00:00 +0100","biburl":"https://dblp.org/rec/bib/conf/stoc/FeldmanGRVX13","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/stoc/FeldmanGRVX13,\n author = {Vitaly Feldman and\n Elena Grigorescu and\n Lev Reyzin and\n Santosh Vempala and\n Ying Xiao},\n title = {Statistical algorithms and a lower bound for detecting planted cliques},\n booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,\n USA, June 1-4, 2013},\n pages = {655--664},\n year = {2013},\n crossref = {DBLP:conf/stoc/2013},\n url = {https://doi.org/10.1145/2488608.2488692},\n doi = {10.1145/2488608.2488692},\n timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/bib/conf/stoc/FeldmanGRVX13},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Feldman, V.","Grigorescu, E.","Reyzin, L.","Vempala, S.","Xiao, Y."],"key":"DBLP:conf/stoc/FeldmanGRVX13","id":"DBLP:conf/stoc/FeldmanGRVX13","bibbaseid":"feldman-grigorescu-reyzin-vempala-xiao-statisticalalgorithmsandalowerboundfordetectingplantedcliques-2013","role":"author","urls":{"Paper":"https://doi.org/10.1145/2488608.2488692"},"downloads":0},"search_terms":["statistical","algorithms","lower","bound","detecting","planted","cliques","feldman","grigorescu","reyzin","vempala","xiao"],"keywords":[],"authorIDs":[],"dataSources":["o5MdET8K3qoMZxPKp"]}