{"id":"https://openalex.org/W2606114621","doi":"https://doi.org/10.1137/130942152","title":"Estimating the Longest Increasing Sequence in Polylogarithmic Time","display_name":"Estimating the Longest Increasing Sequence in Polylogarithmic Time","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2606114621","doi":"https://doi.org/10.1137/130942152","mag":"2606114621"},"language":"en","primary_location":{"id":"doi:10.1137/130942152","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130942152","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/A5030610930","display_name":"Michael Saks","orcid":"https://orcid.org/0000-0003-1659-7190"},"institutions":[{"id":"https://openalex.org/I1321014770","display_name":"Association for Computing Machinery","ror":"https://ror.org/03wsadn68","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1321014770"]},{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]},{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]}],"countries":["NL","US"],"is_corresponding":true,"raw_author_name":"M. Saks","raw_affiliation_strings":["ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA","Rutgers University","Sandia National Laboratories, Livermore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA","institution_ids":["https://openalex.org/I1321014770"]},{"raw_affiliation_string":"Rutgers University","institution_ids":["https://openalex.org/I4210096112"]},{"raw_affiliation_string":"Sandia National Laboratories, Livermore","institution_ids":["https://openalex.org/I192454743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038687804","display_name":"C. Seshadhri","orcid":"https://orcid.org/0000-0003-2163-3555"},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]},{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]},{"id":"https://openalex.org/I1321014770","display_name":"Association for Computing Machinery","ror":"https://ror.org/03wsadn68","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1321014770"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"C. Seshadhri","raw_affiliation_strings":["ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA","Sandia National Laboratories, Livermore","Rutgers University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA","institution_ids":["https://openalex.org/I1321014770"]},{"raw_affiliation_string":"Sandia National Laboratories, Livermore","institution_ids":["https://openalex.org/I192454743"]},{"raw_affiliation_string":"Rutgers University","institution_ids":["https://openalex.org/I4210096112"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030610930"],"corresponding_institution_ids":["https://openalex.org/I1321014770","https://openalex.org/I192454743","https://openalex.org/I4210096112"],"apc_list":null,"apc_paid":null,"fwci":2.391,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.89737872,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"46","issue":"2","first_page":"774","last_page":"823"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"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/combinatorics","display_name":"Combinatorics","score":0.7810930013656616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7440086007118225},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.7016593813896179},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.6971991062164307},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6147522926330566},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5899297595024109},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.5840219259262085},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5707874298095703},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5530798435211182},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5387327075004578},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.4817345440387726},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.44097959995269775},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4395659863948822},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42073139548301697},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3608160614967346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3155386447906494},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.1100861132144928},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09680214524269104}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7810930013656616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7440086007118225},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7016593813896179},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.6971991062164307},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6147522926330566},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5899297595024109},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.5840219259262085},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5707874298095703},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5530798435211182},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5387327075004578},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4817345440387726},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.44097959995269775},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4395659863948822},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42073139548301697},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3608160614967346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3155386447906494},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.1100861132144928},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09680214524269104},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/130942152","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130942152","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2618794763","display_name":null,"funder_award_id":"332622","funder_id":"https://openalex.org/F4320306164","funder_display_name":"Simons Foundation"},{"id":"https://openalex.org/G3017597143","display_name":null,"funder_award_id":"DE-AC04-94AL85000","funder_id":"https://openalex.org/F4320338291","funder_display_name":"Sandia National Laboratories"},{"id":"https://openalex.org/G3697502473","display_name":null,"funder_award_id":"0832787","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4575172385","display_name":"AF: Small: Efficient Approximations for Dynamic Programs and Other Topics in Algorithms","funder_award_id":"1218711","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4639114463","display_name":null,"funder_award_id":"CCF-0832787","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5259826650","display_name":null,"funder_award_id":"CCF-1218711","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5799526528","display_name":null,"funder_award_id":"DE-AC04-94AL85000","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G5827802491","display_name":null,"funder_award_id":"DE-AC04-94AL85000","funder_id":"https://openalex.org/F4320332369","funder_display_name":"National Nuclear Security Administration"},{"id":"https://openalex.org/G6485281451","display_name":null,"funder_award_id":"DE-AC04-94AL85000","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7318852158","display_name":null,"funder_award_id":"AC04-94AL85000","funder_id":"https://openalex.org/F4320338291","funder_display_name":"Sandia National Laboratories"},{"id":"https://openalex.org/G8456466421","display_name":null,"funder_award_id":"AC04-94AL85000","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320332369","display_name":"National Nuclear Security Administration","ror":"https://ror.org/03sk1we31"},{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1528180898","https://openalex.org/W1970630090","https://openalex.org/W2018925011","https://openalex.org/W2064609684","https://openalex.org/W2066885472","https://openalex.org/W2069893028","https://openalex.org/W2073966617","https://openalex.org/W2169838205","https://openalex.org/W3023302315","https://openalex.org/W4233413206","https://openalex.org/W4235805661"],"related_works":["https://openalex.org/W3122601395","https://openalex.org/W2969919693","https://openalex.org/W2125120904","https://openalex.org/W4225868058","https://openalex.org/W2035123411","https://openalex.org/W2112772040","https://openalex.org/W2131191265","https://openalex.org/W2407321536","https://openalex.org/W4299725383","https://openalex.org/W2952147765"],"abstract_inverted_index":{"Finding":[0],"the":[1,4,17,20,46,49,64,68,75,83,114,125],"length":[2,47],"of":[3,19,48,51,59,67,80,100,121],"longest":[5],"increasing":[6],"subsequence":[7],"(LIS)":[8],"is":[9,70,78,130],"a":[10,33,97,110,147],"classic":[11],"algorithmic":[12],"problem.":[13,30],"Let":[14],"$n$":[15],"denote":[16],"size":[18],"array.":[21],"Simple":[22],"$O(n\\log":[23],"n)$":[24],"algorithms":[25,88],"are":[26],"known":[27,85,139],"for":[28,39,106],"this":[29],"We":[31],"develop":[32],"polylogarithmic":[34,86],"time":[35,66,87,129],"randomized":[36],"algorithm":[37,69,103,140],"that":[38],"any":[40,107],"constant":[41],"$\\delta":[42,60],">":[43],"0$,":[44],"estimates":[45],"LIS":[50],"an":[52,56,92,144],"array":[53],"to":[54,113,116],"within":[55,146],"additive":[57,93],"error":[58],"n$.":[61],"More":[62],"precisely,":[63],"running":[65,128],"$(\\log":[71],"n)^c":[72],"(1/\\delta)^{O(1/\\delta)}$,":[73],"where":[74],"exponent":[76],"$c$":[77],"independent":[79],"$\\delta$.":[81],"Previously,":[82],"best":[84,137],"could":[89,141],"only":[90,142],"achieve":[91],"$n/2$":[94],"approximation.":[95],"With":[96],"suitable":[98],"choice":[99],"parameters,":[101],"our":[102],"also":[104],"gives,":[105],"fixed":[108],"$\\tau>0$,":[109],"multiplicative":[111],"$(1+\\tau)$-approximation":[112],"distance":[115],"monotonicity":[117],"$\\varepsilon_f$":[118],"(the":[119],"fraction":[120],"entries":[122],"not":[123],"in":[124,132],"LIS),":[126],"whose":[127],"polynomial":[131],"$\\log(n)$":[133],"and":[134],"$1/\\varepsilon_f$.":[135],"The":[136],"previously":[138],"guarantee":[143],"approximation":[145],"factor":[148],"(arbitrarily":[149],"close":[150],"to)":[151],"2.":[152]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-19T08:33:51.333923","created_date":"2025-10-10T00:00:00"}