"Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, ..."

Sepehr Assadi et al. (2020)

> Home

Details and statistics

DOI: 10.1109/FOCS46700.2020.00041

access: closed

type: Conference or Workshop Paper

metadata version: 2021-01-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/AssadiKSY20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/AssadiKSY20
Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu:
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. FOCS 2020: 354-364

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.