{"id":"https://openalex.org/W2104592606","doi":"https://doi.org/10.1080/00207169708804607","title":"Tight \u03a9(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence","display_name":"Tight \u03a9(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2104592606","doi":"https://doi.org/10.1080/00207169708804607","mag":"2104592606"},"language":"en","primary_location":{"id":"doi:10.1080/00207169708804607","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169708804607","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5007306645","display_name":"Prakash Ramanan","orcid":null},"institutions":[{"id":"https://openalex.org/I39587148","display_name":"Wichita State University","ror":"https://ror.org/00c4e7y75","country_code":"US","type":"education","lineage":["https://openalex.org/I39587148"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Prakash Ramanan","raw_affiliation_strings":["Department of Computer Science , Wichita State University , Wichita, KS, 67260-0083","Department of Computer Science Wichita State University Wichita, KS 67260-0083"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Wichita State University , Wichita, KS, 67260-0083","institution_ids":["https://openalex.org/I39587148"]},{"raw_affiliation_string":"Department of Computer Science Wichita State University Wichita, KS 67260-0083","institution_ids":["https://openalex.org/I39587148"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007306645"],"corresponding_institution_ids":["https://openalex.org/I39587148"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.16281751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"65","issue":"3-4","first_page":"161","last_page":"164"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9785000085830688,"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"}},"topics":[{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9785000085830688,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9781000018119812,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9696000218391418,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8389739990234375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8211043477058411},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.794541597366333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7726863622665405},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7458601593971252},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.7336341142654419},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.563813328742981},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5390298962593079},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.49454209208488464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3495381474494934}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.8389739990234375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8211043477058411},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.794541597366333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7726863622665405},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7458601593971252},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.7336341142654419},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.563813328742981},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5390298962593079},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.49454209208488464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3495381474494934},{"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/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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169708804607","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169708804607","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W2059985428","https://openalex.org/W2069893028","https://openalex.org/W2147543351"],"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/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W4323338832","https://openalex.org/W3094761360"],"abstract_inverted_index":{"The":[0,68],"longest":[1,17,85],"increasing":[2,18,86],"subsequence":[3,19],"problem":[4,78],"is":[5,23,49],"as":[6],"follows:":[7],"Given":[8],"a":[9,16,24,37,53,84],"sequence":[10],"of":[11,20,79,83],"n":[12],"real":[13],"numbers,":[14],"find":[15],".":[21],"There":[22],"well-known":[25],"O(n":[26],"lg":[27,40,56],"n)-time":[28],"comparison":[29,46],"tree":[30,47,66],"algorithm":[31],"for":[32],"solving":[33],"this":[34],"problem.":[35],"Also,":[36],"tight":[38,54],"\u03a9(n":[39,55],"n)":[41,57],"lower":[42,58,70],"bound":[43,59],"in":[44,60],"the":[45,61,75,81],"model":[48],"known.":[50],"We":[51],"prove":[52],"more":[62],"powerful":[63],"algebraic":[64],"decision":[65],"model.":[67],"above":[69],"bounds":[71],"also":[72],"apply":[73],"to":[74],"apparently":[76],"simpler":[77],"finding":[80],"length":[82],"subsequence.":[87]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}