{"id":"https://openalex.org/W2018407082","doi":"https://doi.org/10.1137/090770801","title":"Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence","display_name":"Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2018407082","doi":"https://doi.org/10.1137/090770801","mag":"2018407082"},"language":"en","primary_location":{"id":"doi:10.1137/090770801","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090770801","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078455094","display_name":"Anna G\u00e1l","orcid":"https://orcid.org/0000-0001-9772-3966"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anna G\u00e1l","raw_affiliation_strings":["panni@cs.utexas.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"panni@cs.utexas.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036468719","display_name":"Parikshit Gopalan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Parikshit Gopalan","raw_affiliation_strings":["parik@microsoft.com#TAB#"],"affiliations":[{"raw_affiliation_string":"parik@microsoft.com#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078455094"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.10332976,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"39","issue":"8","first_page":"3463","last_page":"3479"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.7626792788505554},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.7586901187896729},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.7570244073867798},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7263423800468445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6855460405349731},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6638845205307007},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6584001183509827},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6503028869628906},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6198108792304993},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.590967059135437},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5333245992660522},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.47866806387901306},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4468897581100464},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42982620000839233},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42892730236053467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34667912125587463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15597152709960938}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7626792788505554},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.7586901187896729},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.7570244073867798},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7263423800468445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6855460405349731},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6638845205307007},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6584001183509827},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6503028869628906},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6198108792304993},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.590967059135437},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5333245992660522},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.47866806387901306},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4468897581100464},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42982620000839233},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42892730236053467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34667912125587463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15597152709960938},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":3,"locations":[{"id":"doi:10.1137/090770801","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090770801","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.3645","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.3645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/panni/lissubm.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.9336","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.9336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cc.gatech.edu/~parik/RESEARCH/lis-lb.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W583936781","https://openalex.org/W1523914522","https://openalex.org/W1965972569","https://openalex.org/W2018543684","https://openalex.org/W2054081892","https://openalex.org/W2064379477","https://openalex.org/W2065937173","https://openalex.org/W2066885472","https://openalex.org/W2078427855","https://openalex.org/W2080745194","https://openalex.org/W2085788081","https://openalex.org/W2086366030","https://openalex.org/W2107917944","https://openalex.org/W2114607430","https://openalex.org/W2340787257","https://openalex.org/W2610179052"],"related_works":["https://openalex.org/W1540010783","https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W4225868058","https://openalex.org/W4389489786","https://openalex.org/W2152064395","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W3094761360"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,7],"any":[3],"deterministic":[4],"streaming":[5],"algorithm":[6],"makes":[8],"a":[9,19,32,43,65,95,101],"constant":[10,20],"number":[11],"of":[12,23,26,34,51],"passes":[13],"over":[14],"the":[15,24,27,52,82],"input":[16],"and":[17,99],"gives":[18],"factor":[21],"approximation":[22,78],"length":[25,35],"longest":[28],"increasing":[29],"subsequence":[30],"in":[31],"sequence":[33],"n":[36],"must":[37],"use":[38],"space":[39],"$\\Omega(\\sqrt{n})$.":[40],"This":[41],"proves":[42],"conjecture":[44],"made":[45],"by":[46],"Gopalan":[47],"et":[48],"al.":[49],"[Proceedings":[50],"18th":[53],"Annual":[54],"ACM\u2013SIAM":[55],"Symposium":[56],"on":[57,93],"Discrete":[58],"Algorithms,":[59],"2007,":[60],"pp.":[61],"318\u2013327]":[62],"who":[63],"proved":[64],"matching":[66],"upper":[67],"bound.":[68],"Our":[69,89],"results":[70],"yield":[71],"asymptotically":[72],"tight":[73],"lower":[74],"bounds":[75],"for":[76,106],"all":[77],"factors,":[79],"thus":[80],"resolving":[81],"main":[83],"open":[84],"problem":[85,98],"from":[86],"their":[87],"paper.":[88],"proof":[90],"is":[91],"based":[92],"analyzing":[94],"related":[96],"communication":[97],"proving":[100],"direct":[102],"sum":[103],"type":[104],"property":[105],"it.":[107]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}