@InProceedings{bera_et_al:LIPIcs.STACS.2017.11,
author = {Bera, Suman K. and Chakrabarti, Amit},
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)},
pages = {11:1--11:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.11},
URN = {urn:nbn:de:0030-drops-70222},
doi = {10.4230/LIPIcs.STACS.2017.11},
annote = {Keywords: data streaming, graph algorithms, triangles, subgraph counting, lower bounds}
}