BibTeX record conf/innovations/Legenstein0PV18

download as .bib file

@inproceedings{DBLP:conf/innovations/Legenstein0PV18,
  author       = {Robert Legenstein and
                  Wolfgang Maass and
                  Christos H. Papadimitriou and
                  Santosh S. Vempala},
  editor       = {Anna R. Karlin},
  title        = {Long Term Memory and the Densest K-Subgraph Problem},
  booktitle    = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2018, January 11-14, 2018, Cambridge, MA, {USA}},
  series       = {LIPIcs},
  volume       = {94},
  pages        = {57:1--57:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2018.57},
  doi          = {10.4230/LIPICS.ITCS.2018.57},
  timestamp    = {Thu, 09 Sep 2021 15:47:52 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/Legenstein0PV18.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.