1. Graph sketches
2. Sepehr Assadi , Michael Kapralov , and Sanjeev Khanna . 2019 . A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling. In 10th Innovations in Theoretical Computer Science , ITCS 2019. Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6. Sepehr Assadi, Michael Kapralov, and Sanjeev Khanna. 2019. A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling. In 10th Innovations in Theoretical Computer Science, ITCS 2019. Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6.
3. Size Bounds and Query Plans for Relational Joins
4. Suman K Bera and Amit Chakrabarti . 2017 . Towards tighter space bounds for counting triangles and other substructures in graph streams . In 34th Symposium on Theoretical Aspects of Computer Science. Suman K Bera and Amit Chakrabarti. 2017. Towards tighter space bounds for counting triangles and other substructures in graph streams. In 34th Symposium on Theoretical Aspects of Computer Science.