Polynomial pass lower bounds for graph streaming algorithms
- Award ID(s):
- 1763514
- PAR ID:
- 10163306
- Date Published:
- Journal Name:
- Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019
- Page Range / eLocation ID:
- 265 to 276
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

