BibTeX record conf/soda/LiLS00

download as .bib file

@inproceedings{DBLP:conf/soda/LiLS00,
  author       = {Yi Li and
                  Philip M. Long and
                  Aravind Srinivasan},
  editor       = {David B. Shmoys},
  title        = {Improved bounds on the sample complexity of learning},
  booktitle    = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
  pages        = {309--318},
  publisher    = {{ACM/SIAM}},
  year         = {2000},
  url          = {http://dl.acm.org/citation.cfm?id=338219.338267},
  timestamp    = {Fri, 07 Dec 2012 17:02:09 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/LiLS00.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.