BibTeX record conf/stoc/Loveland69

download as .bib file

@inproceedings{DBLP:conf/stoc/Loveland69,
  author    = {Donald W. Loveland},
  title     = {On Minimal-Program Complexity Measures},
  booktitle = {Proceedings of the 1st Annual {ACM} Symposium on Theory of Computing,
               May 5-7, 1969, Marina del Rey, CA, {USA}},
  pages     = {61--65},
  year      = {1969},
  crossref  = {DBLP:conf/stoc/STOC1},
  url       = {https://doi.org/10.1145/800169.805422},
  doi       = {10.1145/800169.805422},
  timestamp = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/Loveland69},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC1,
  editor    = {Patrick C. Fischer and
               Seymour Ginsburg and
               Michael A. Harrison},
  title     = {Proceedings of the 1st Annual {ACM} Symposium on Theory of Computing,
               May 5-7, 1969, Marina del Rey, CA, {USA}},
  publisher = {{ACM}},
  year      = {1969},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/STOC1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics