Sepehr Assadi, Yu Chen, Sanjeev Khanna. Polynomial pass lower bounds for graph streaming algorithms. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 265-276, ACM, 2019. [doi]
@inproceedings{AssadiCK19-0,
title = {Polynomial pass lower bounds for graph streaming algorithms},
author = {Sepehr Assadi and Yu Chen and Sanjeev Khanna},
year = {2019},
doi = {10.1145/3313276.3316361},
url = {https://doi.org/10.1145/3313276.3316361},
researchr = {https://researchr.org/publication/AssadiCK19-0},
cites = {0},
citedby = {0},
pages = {265-276},
booktitle = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019},
editor = {Moses Charikar and Edith Cohen},
publisher = {ACM},
isbn = {978-1-4503-6705-9},
}