skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 10:00 PM ET on Friday, December 8 until 2:00 AM ET on Saturday, December 9 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the NSF-PAR

This content will become publicly available on June 2, 2024

Title: On Regularity Lemma and Barriers in Streaming and Dynamic Matching
Award ID(s):
2008305
NSF-PAR ID:
10432480
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
Page Range / eLocation ID:
131 to 144
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email