BibTeX record conf/stacs/BeraC17

download as .bib file

@inproceedings{DBLP:conf/stacs/BeraC17,
  author       = {Suman K. Bera and
                  Amit Chakrabarti},
  editor       = {Heribert Vollmer and
                  Brigitte Vall{\'{e}}e},
  title        = {Towards Tighter Space Bounds for Counting Triangles and Other Substructures
                  in Graph Streams},
  booktitle    = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
                  2017, March 8-11, 2017, Hannover, Germany},
  series       = {LIPIcs},
  volume       = {66},
  pages        = {11:1--11:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2017.11},
  doi          = {10.4230/LIPICS.STACS.2017.11},
  timestamp    = {Thu, 07 Jul 2022 09:21:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BeraC17.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.