{"id":"https://openalex.org/W2042146958","doi":"https://doi.org/10.1142/s0129626494000053","title":"A WORK-TIME TRADE-OFF IN PARALLEL COMPUTATION OF HUFFMAN TREES AND CONCAVE LEAST WEIGHT SUBSEQUENCE PROBLEM","display_name":"A WORK-TIME TRADE-OFF IN PARALLEL COMPUTATION OF HUFFMAN TREES AND CONCAVE LEAST WEIGHT SUBSEQUENCE PROBLEM","publication_year":1994,"publication_date":"1994-06-01","ids":{"openalex":"https://openalex.org/W2042146958","doi":"https://doi.org/10.1142/s0129626494000053","mag":"2042146958"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626494000053","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626494000053","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5005407145","display_name":"Christos Levcopoulos","orcid":"https://orcid.org/0000-0003-0983-7862"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"CHRISTOS LEVCOPOULOS","raw_affiliation_strings":["Department of Computer Science, Lund University S-211 00 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University S-211 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089548776","display_name":"Teresa M. Przytycka","orcid":"https://orcid.org/0000-0002-6261-277X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"TERESA M. PRZYTYCKA","raw_affiliation_strings":["Department of of Math. and Computer Science, Odense University DK-5230 Odense M, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of of Math. and Computer Science, Odense University DK-5230 Odense M, Denmark","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005407145"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.19087974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"04","issue":"01n02","first_page":"37","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9736999869346619,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9736999869346619,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9664999842643738,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9516000151634216,"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/huffman-coding","display_name":"Huffman coding","score":0.9085268378257751},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.742698073387146},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.6289777755737305},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6182693839073181},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.5863692760467529},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5182749629020691},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48346811532974243},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.463352233171463},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4632524251937866},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4608686864376068},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.447237491607666},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44159871339797974},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42549821734428406},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3683413565158844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32950276136398315},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.11380425095558167}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9085268378257751},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.742698073387146},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.6289777755737305},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6182693839073181},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.5863692760467529},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5182749629020691},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48346811532974243},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.463352233171463},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4632524251937866},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4608686864376068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.447237491607666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44159871339797974},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42549821734428406},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3683413565158844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32950276136398315},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.11380425095558167},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626494000053","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626494000053","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"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/W4323338832"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,20,35,68,78,83],"parallel":[3],"algorithm":[4,24,75,89],"for":[5,53,62,82],"the":[6,15,23,39,44,49,54,63,88],"Concave":[7],"Least":[8],"Weight":[9],"Subsequence":[10],"(CLWS)":[11],"problem":[12,42,65],"that":[13,76],"exhibits":[14,77],"following":[16],"work-time":[17],"trade-off:":[18,80],"Given":[19],"parameter":[21,85],"p,":[22,86],"runs":[25,90],"in":[26,71,91],"[Formula:":[27,92],"see":[28,93],"text]":[29,94],"time":[30,95],"using":[31,96],"p":[32,97],"processors.":[33,98],"By":[34],"known":[36],"reduction":[37],"of":[38],"Huffman":[40,55],"Tree":[41,56],"to":[43],"CLWS":[45],"problem,":[46],"we":[47,60],"obtain":[48],"same":[50],"complexity":[51],"bounds":[52],"problem.":[57],"However,":[58],"as":[59],"show,":[61],"later":[64],"there":[66],"exists":[67],"simpler":[69],"(and,":[70],"fact,":[72],"slightly":[73],"better)":[74],"similar":[79],"Namely,":[81],"given":[84],"p\u22651,":[87]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}