{"id":"https://openalex.org/W3171167615","doi":"https://doi.org/10.1145/3406325.3451038","title":"Almost optimal super-constant-pass streaming lower bounds for reachability","display_name":"Almost optimal super-constant-pass streaming lower bounds for reachability","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3171167615","doi":"https://doi.org/10.1145/3406325.3451038","mag":"3171167615"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451038","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451038","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451038","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451038","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100611490","display_name":"Lijie Chen","orcid":"https://orcid.org/0000-0002-6084-4729"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lijie Chen","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050781652","display_name":"Gillat Kol","orcid":"https://orcid.org/0009-0007-4725-6694"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gillat Kol","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114050387","display_name":"Dmitry Paramonov","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dmitry Paramonov","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053649149","display_name":"Raghuvansh R. Saxena","orcid":"https://orcid.org/0009-0002-7006-6710"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raghuvansh R. Saxena","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103280080","display_name":"Zhao Song","orcid":"https://orcid.org/0000-0003-4589-5234"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhao Song","raw_affiliation_strings":["Institute for Advanced Study at Princeton, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study at Princeton, USA","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055157975","display_name":"Huacheng Yu","orcid":"https://orcid.org/0000-0003-1450-1896"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Huacheng Yu","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8266,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87250926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"570","last_page":"583"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8499693870544434},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5982406735420227},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5829047560691833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5603052973747253},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5331892967224121},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5270559787750244},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5189785361289978},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5141180157661438},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.47302770614624023},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45001381635665894},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.44998547434806824},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4364125728607178},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42476707696914673},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42323824763298035},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3511813282966614},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2895280420780182}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8499693870544434},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5982406735420227},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5829047560691833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5603052973747253},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5331892967224121},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5270559787750244},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5189785361289978},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5141180157661438},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.47302770614624023},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45001381635665894},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.44998547434806824},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4364125728607178},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42476707696914673},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42323824763298035},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3511813282966614},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2895280420780182},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451038","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451038","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451038","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3406325.3451038","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451038","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451038","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3171167615.pdf","grobid_xml":"https://content.openalex.org/works/W3171167615.grobid-xml"},"referenced_works_count":54,"referenced_works":["https://openalex.org/W138321218","https://openalex.org/W1514707655","https://openalex.org/W1595640791","https://openalex.org/W1617753329","https://openalex.org/W1761167196","https://openalex.org/W1941041180","https://openalex.org/W1983670009","https://openalex.org/W1989796026","https://openalex.org/W2001552595","https://openalex.org/W2014989559","https://openalex.org/W2023600080","https://openalex.org/W2038521541","https://openalex.org/W2059867647","https://openalex.org/W2060383163","https://openalex.org/W2076458424","https://openalex.org/W2101043704","https://openalex.org/W2121689290","https://openalex.org/W2148137544","https://openalex.org/W2165753192","https://openalex.org/W2225326649","https://openalex.org/W2279901945","https://openalex.org/W2295428206","https://openalex.org/W2300360052","https://openalex.org/W2310290370","https://openalex.org/W2344844563","https://openalex.org/W2547958265","https://openalex.org/W2567730220","https://openalex.org/W2569757174","https://openalex.org/W2768857456","https://openalex.org/W2788015272","https://openalex.org/W2888820341","https://openalex.org/W2922098626","https://openalex.org/W2949524113","https://openalex.org/W2949572027","https://openalex.org/W2952295827","https://openalex.org/W2952341094","https://openalex.org/W2953264324","https://openalex.org/W2963298291","https://openalex.org/W2963702123","https://openalex.org/W2983782154","https://openalex.org/W2996839476","https://openalex.org/W3017378904","https://openalex.org/W3022506034","https://openalex.org/W3035645591","https://openalex.org/W3100689448","https://openalex.org/W3116253690","https://openalex.org/W3126291939","https://openalex.org/W3127944880","https://openalex.org/W3137706500","https://openalex.org/W4252630569","https://openalex.org/W4253069973","https://openalex.org/W4298280542","https://openalex.org/W4302338090","https://openalex.org/W4400691701"],"related_works":["https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736","https://openalex.org/W2060144422","https://openalex.org/W2141183298","https://openalex.org/W2315923944"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"almost":[3,39],"quadratic":[4,40],"n2\u2212o(1)":[5],"lower":[6,42],"bound":[7],"on":[8],"the":[9,18,32],"space":[10,41],"consumption":[11],"of":[12],"any":[13,26],"o(\u221alogn)-pass":[14],"streaming":[15],"algorithm":[16,28],"solving":[17],"(directed)":[19],"s-t":[20],"reachability":[21],"problem.":[22],"This":[23],"means":[24],"that":[25],"such":[27],"must":[29],"essentially":[30],"store":[31],"entire":[33],"graph.":[34],"As":[35],"corollaries,":[36],"we":[37],"obtain":[38],"bounds":[43],"for":[44],"additional":[45],"fundamental":[46],"problems,":[47],"including":[48],"maximum":[49],"matching,":[50],"shortest":[51],"path,":[52],"matrix":[53],"rank,":[54],"and":[55],"linear":[56],"programming.":[57]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}