Show simple item record

dc.contributor.authorChen, Lijie
dc.contributor.authorKol, Gillat
dc.contributor.authorParamonov, Dmitry
dc.contributor.authorSaxena, Raghuvansh R.
dc.contributor.authorSong, Zhao
dc.contributor.authorYu, Huacheng
dc.date.accessioned2022-10-21T17:18:09Z
dc.date.available2022-10-21T17:18:09Z
dc.date.issued2021-06-15
dc.identifier.isbn978-1-4503-8053-9
dc.identifier.urihttps://hdl.handle.net/1721.1/145931
dc.publisherACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computingen_US
dc.relation.isversionofhttps://doi.org/10.1145/3406325.3451038en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computingen_US
dc.titleAlmost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachabilityen_US
dc.typeArticleen_US
dc.identifier.citationChen, Lijie, Kol, Gillat, Paramonov, Dmitry, Saxena, Raghuvansh R., Song, Zhao et al. 2021. "Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability."
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.identifier.mitlicensePUBLISHER_POLICY
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-10-20T14:18:48Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2022-10-20T14:18:48Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record