BibTeX record conf/stoc/FeldmanGRVX13

download as .bib file

@inproceedings{DBLP:conf/stoc/FeldmanGRVX13,
  author       = {Vitaly Feldman and
                  Elena Grigorescu and
                  Lev Reyzin and
                  Santosh S. Vempala and
                  Ying Xiao},
  editor       = {Dan Boneh and
                  Tim Roughgarden and
                  Joan Feigenbaum},
  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},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2488608.2488692},
  doi          = {10.1145/2488608.2488692},
  timestamp    = {Thu, 24 Oct 2019 15:31:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/FeldmanGRVX13.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.