@article{DBLP:journals/jacm/FeldmanGRVX17,
  author    = {Vitaly Feldman and
               Elena Grigorescu and
               Lev Reyzin and
               Santosh Srinivas Vempala and
               Ying Xiao},
  title     = {Statistical Algorithms and a Lower Bound for Detecting Planted Cliques},
  journal   = {J. {ACM}},
  volume    = {64},
  number    = {2},
  pages     = {8:1--8:37},
  year      = {2017},
  url       = {https://doi.org/10.1145/3046674},
  doi       = {10.1145/3046674},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/jacm/FeldmanGRVX17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"ehTNpWHdXwM9uKr2d","bibbaseid":"feldman-grigorescu-reyzin-vempala-xiao-statisticalalgorithmsandalowerboundfordetectingplantedcliques-2017","downloads":0,"creationDate":"2019-02-04T10:40:08.862Z","title":"Statistical Algorithms and a Lower Bound for Detecting Planted Cliques","author_short":["Feldman, V.","Grigorescu, E.","Reyzin, L.","Vempala, S. S.","Xiao, Y."],"year":2017,"bibtype":"article","biburl":"https://dblp.org/pid/v/SantoshVempala.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Vitaly"],"propositions":[],"lastnames":["Feldman"],"suffixes":[]},{"firstnames":["Elena"],"propositions":[],"lastnames":["Grigorescu"],"suffixes":[]},{"firstnames":["Lev"],"propositions":[],"lastnames":["Reyzin"],"suffixes":[]},{"firstnames":["Santosh","Srinivas"],"propositions":[],"lastnames":["Vempala"],"suffixes":[]},{"firstnames":["Ying"],"propositions":[],"lastnames":["Xiao"],"suffixes":[]}],"title":"Statistical Algorithms and a Lower Bound for Detecting Planted Cliques","journal":"J. ACM","volume":"64","number":"2","pages":"8:1–8:37","year":"2017","url":"https://doi.org/10.1145/3046674","doi":"10.1145/3046674","timestamp":"Tue, 06 Nov 2018 00:00:00 +0100","biburl":"https://dblp.org/rec/bib/journals/jacm/FeldmanGRVX17","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/jacm/FeldmanGRVX17,\n author = {Vitaly Feldman and\n Elena Grigorescu and\n Lev Reyzin and\n Santosh Srinivas Vempala and\n Ying Xiao},\n title = {Statistical Algorithms and a Lower Bound for Detecting Planted Cliques},\n journal = {J. {ACM}},\n volume = {64},\n number = {2},\n pages = {8:1--8:37},\n year = {2017},\n url = {https://doi.org/10.1145/3046674},\n doi = {10.1145/3046674},\n timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/bib/journals/jacm/FeldmanGRVX17},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Feldman, V.","Grigorescu, E.","Reyzin, L.","Vempala, S. S.","Xiao, Y."],"key":"DBLP:journals/jacm/FeldmanGRVX17","id":"DBLP:journals/jacm/FeldmanGRVX17","bibbaseid":"feldman-grigorescu-reyzin-vempala-xiao-statisticalalgorithmsandalowerboundfordetectingplantedcliques-2017","role":"author","urls":{"Paper":"https://doi.org/10.1145/3046674"},"downloads":0},"search_terms":["statistical","algorithms","lower","bound","detecting","planted","cliques","feldman","grigorescu","reyzin","vempala","xiao"],"keywords":[],"authorIDs":[],"dataSources":["o5MdET8K3qoMZxPKp"]}