{"id":"https://openalex.org/W3034398078","doi":"https://doi.org/10.1145/3357713.3384240","title":"Dynamic algorithms for LIS and distance to monotonicity","display_name":"Dynamic algorithms for LIS and distance to monotonicity","publication_year":2020,"publication_date":"2020-06-22","ids":{"openalex":"https://openalex.org/W3034398078","doi":"https://doi.org/10.1145/3357713.3384240","mag":"3034398078"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384240","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5062318856","display_name":"Michael Mitzenmacher","orcid":"https://orcid.org/0000-0001-5430-5457"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Mitzenmacher","raw_affiliation_strings":["Harvard University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087093711","display_name":"Saeed Seddighin","orcid":"https://orcid.org/0000-0002-3951-7096"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saeed Seddighin","raw_affiliation_strings":["Harvard University, USA"],"raw_orcid":"https://orcid.org/0000-0002-3951-7096","affiliations":[{"raw_affiliation_string":"Harvard University, USA","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"apc_list":null,"apc_paid":null,"fwci":3.0338,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.92197213,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"671","last_page":"684"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T10237","display_name":"Cryptography and Data Security","score":0.9965999722480774,"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/monotonic-function","display_name":"Monotonic function","score":0.84979248046875},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7319269180297852},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6472440361976624},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6089849472045898},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.6001268029212952},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5513496398925781},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.48306968808174133},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.47098419070243835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45789745450019836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3905099034309387},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3347119688987732},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06669533252716064},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06066128611564636}],"concepts":[{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.84979248046875},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7319269180297852},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6472440361976624},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6089849472045898},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.6001268029212952},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5513496398925781},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.48306968808174133},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.47098419070243835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45789745450019836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3905099034309387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3347119688987732},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06669533252716064},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06066128611564636},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384240","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4429964546","display_name":null,"funder_award_id":"CCF- 1535795, CCF-1563710","funder_id":"https://openalex.org/F4320315254","funder_display_name":"Innovative Research Group Project of the National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320315254","display_name":"Innovative Research Group Project of the National Natural Science Foundation of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W199049232","https://openalex.org/W1586809440","https://openalex.org/W1599305879","https://openalex.org/W1602103078","https://openalex.org/W1881597093","https://openalex.org/W2029132631","https://openalex.org/W2061448976","https://openalex.org/W2061705660","https://openalex.org/W2069893028","https://openalex.org/W2093101813","https://openalex.org/W2115873073","https://openalex.org/W2120724233","https://openalex.org/W2153715991","https://openalex.org/W2571471359","https://openalex.org/W2626928698","https://openalex.org/W2780293396","https://openalex.org/W2781953983","https://openalex.org/W2902509208","https://openalex.org/W2952534071","https://openalex.org/W2962710088","https://openalex.org/W2963645943","https://openalex.org/W2964007110","https://openalex.org/W2964264613","https://openalex.org/W2971374205","https://openalex.org/W2972259791","https://openalex.org/W2998685384","https://openalex.org/W4231006448","https://openalex.org/W4231553787","https://openalex.org/W4235082106","https://openalex.org/W4241556879","https://openalex.org/W4249036581","https://openalex.org/W4256405312","https://openalex.org/W4404848401","https://openalex.org/W6608163828","https://openalex.org/W6631627942","https://openalex.org/W6654900760"],"related_works":["https://openalex.org/W25732909","https://openalex.org/W4323338832","https://openalex.org/W4289596129","https://openalex.org/W3083981518","https://openalex.org/W4225868058","https://openalex.org/W1999879627","https://openalex.org/W2088055539","https://openalex.org/W1574834681","https://openalex.org/W2389167168","https://openalex.org/W1746697883"],"abstract_inverted_index":{"In":[0,26],"this":[1,27],"paper,":[2],"we":[3],"provide":[4],"new":[5],"approximation":[6,60,86],"algorithms":[7],"for":[8,49,75,88,96],"dynamic":[9],"variations":[10],"of":[11,30],"the":[12,19,31,56,62],"longest":[13,63],"increasing":[14,64],"subsequence":[15,65],"(LIS)":[16],"problem,":[17],"and":[18,82],"complementary":[20],"distance":[21,67],"to":[22,61,68],"monotonicity":[23],"(DTM)":[24],"problem.":[25],"setting,":[28],"operations":[29],"following":[32],"form":[33],"arrive":[34],"sequentially:":[35],"(i)":[36],"add":[37],"an":[38,42,47,59],"element,":[39,43],"(ii)":[40],"remove":[41],"or":[44],"(iii)":[45],"substitute":[46],"element":[48],"another.":[50],"At":[51],"every":[52],"point":[53],"in":[54],"time,":[55],"algorithm":[57,74,87],"has":[58],"(or":[66],"monotonicity).":[69],"We":[70],"present":[71],"a":[72,83],"(1+\u0454)-approximation":[73],"DTM":[76],"with":[77,90],"polylogarithmic":[78],"worst-case":[79,91],"update":[80,92],"time":[81,93],"constant":[84,98],"factor":[85],"LIS":[89],"\u00d5(n":[94],"\u0454)":[95],"any":[97],"\u0454":[99],">":[100],"0.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}