Polynomial pass lower bounds for graph streaming algorithms - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Sepehr Assadi' in GoogleThis author has not been identified. Look up 'Yu Chen' in GoogleThis author has not been identified. Look up 'Sanjeev Khanna' in Google

runs on WebDSL