BibTeX record conf/stacs/AustrinKKN16

download as .bib file

@inproceedings{DBLP:conf/stacs/AustrinKKN16,
  author       = {Per Austrin and
                  Petteri Kaski and
                  Mikko Koivisto and
                  Jesper Nederlof},
  editor       = {Nicolas Ollinger and
                  Heribert Vollmer},
  title        = {Dense Subset Sum May Be the Hardest},
  booktitle    = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
                  2016, February 17-20, 2016, Orl{\'{e}}ans, France},
  series       = {LIPIcs},
  volume       = {47},
  pages        = {13:1--13:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2016.13},
  doi          = {10.4230/LIPICS.STACS.2016.13},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/AustrinKKN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics