1. Graph sketches
2. Khanh Do Ba , Piotr Indyk , Eric Price , and David P. Woodruff . 2010. Lower Bounds for Sparse Recovery . In Proceedings of the Twenty-First Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2010 , Austin, Texas, USA, January 17--19 , 2010 , Moses Charikar (Ed.). SIAM, 1190--1197. https://doi.org/10.1137/1. 9781611973075.95 10.1137/1 Khanh Do Ba, Piotr Indyk, Eric Price, and David P. Woodruff. 2010. Lower Bounds for Sparse Recovery. In Proceedings of the Twenty-First Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17--19, 2010, Moses Charikar (Ed.). SIAM, 1190--1197. https://doi.org/10.1137/1. 9781611973075.95
3. Streaming algorithm for graph spanners—single pass and constant processing time per edge
4. Yi-Jun Chang , Martin Farach-Colton , Tsan-sheng Hsu, and Meng-Tsung Tsai . 2020 . Streaming Complexity of Spanning Tree Computation. In 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020 , March 10 --13 , 2020, Montpellier, France (LIPIcs, Vol. 154). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 34:1--34: 19 . https://doi.org/10.4230/LIPIcs.STACS.2020.34 10.4230/LIPIcs.STACS.2020.34 Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, and Meng-Tsung Tsai. 2020. Streaming Complexity of Spanning Tree Computation. In 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10--13, 2020, Montpellier, France (LIPIcs, Vol. 154). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 34:1--34:19. https://doi.org/10.4230/LIPIcs.STACS.2020.34