BibTeX record conf/stoc/SacerdoteT77

• > Home > conf/stoc/SacerdoteT77

@inproceedings{DBLP:conf/stoc/SacerdoteT77,
  author    = {George S. Sacerdote and
               Richard L. Tenney},
  title     = {The Decidability of the Reachability Problem for Vector Addition Systems
               (Preliminary Version)},
  booktitle = {Proceedings of the 9th Annual {ACM} Symposium on Theory of Computing,
               May 4-6, 1977, Boulder, Colorado, {USA}},
  pages     = {61--76},
  year      = {1977},
  crossref  = {DBLP:conf/stoc/STOC9},
  url       = {https://doi.org/10.1145/800105.803396},
  doi       = {10.1145/800105.803396},
  timestamp = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/SacerdoteT77},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/stoc/STOC9,
  editor    = {John E. Hopcroft and
               Emily P. Friedman and
               Michael A. Harrison},
  title     = {Proceedings of the 9th Annual {ACM} Symposium on Theory of Computing,
               May 4-6, 1977, Boulder, Colorado, {USA}},
  publisher = {{ACM}},
  year      = {1977},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/STOC9},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}