BibTeX record conf/stoc/LeightonS86

download as .bib file

@inproceedings{DBLP:conf/stoc/LeightonS86,
  author       = {Frank Thomson Leighton and
                  Peter W. Shor},
  editor       = {Juris Hartmanis},
  title        = {Tight Bounds for Minimax Grid Matching, With Applications to the Average
                  Case Analysis of Algorithms},
  booktitle    = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
                  May 28-30, 1986, Berkeley, California, {USA}},
  pages        = {91--103},
  publisher    = {{ACM}},
  year         = {1986},
  url          = {https://doi.org/10.1145/12130.12140},
  doi          = {10.1145/12130.12140},
  timestamp    = {Tue, 06 Nov 2018 11:07:06 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/LeightonS86.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.