%0 Conference Paper %1 DBLP:conf/stacs/BeraC17 %A Bera, Suman K. %A Chakrabarti, Amit %B 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany %D 2017 %K algorithms enumeration streaming %P 11:1--11:14 %R 10.4230/LIPIcs.STACS.2017.11 %T Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams %U https://doi.org/10.4230/LIPIcs.STACS.2017.11

@inproceedings{DBLP:conf/stacs/BeraC17, added-at = {2018-09-14T17:28:17.000+0200}, author = {Bera, Suman K. and Chakrabarti, Amit}, bibsource = {dblp computer science bibliography, https://dblp.org}, biburl = {https://www.bibsonomy.org/bibtex/2cea781611d7b65cc07b9469882a4bd25/prathyush}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS} 2017, March 8-11, 2017, Hannover, Germany}, crossref = {DBLP:conf/stacs/2017}, doi = {10.4230/LIPIcs.STACS.2017.11}, interhash = {60263007fadd2506bbc3b23affa2f85f}, intrahash = {cea781611d7b65cc07b9469882a4bd25}, keywords = {algorithms enumeration streaming}, pages = {11:1--11:14}, timestamp = {2018-09-14T17:28:17.000+0200}, title = {Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams}, url = {https://doi.org/10.4230/LIPIcs.STACS.2017.11}, year = 2017 }