{"id":"https://openalex.org/W2064916075","doi":"https://doi.org/10.1142/s012962640400174x","title":"WORK-EFFICIENT ALGORITHMS FOR THE CONSTRUCTION OF LENGTH-LIMITED HUFFMAN CODES","display_name":"WORK-EFFICIENT ALGORITHMS FOR THE CONSTRUCTION OF LENGTH-LIMITED HUFFMAN CODES","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W2064916075","doi":"https://doi.org/10.1142/s012962640400174x","mag":"2064916075"},"language":"en","primary_location":{"id":"doi:10.1142/s012962640400174x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962640400174x","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/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MAREK KARPINSKI","raw_affiliation_strings":["Dept. of Computer Science, University of Bonn, Germany","Dept. of Computer Science, University of Bonn, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Germany#TAB#","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038877069","display_name":"Lawrence L. Larmore","orcid":null},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"LAWRENCE LARMORE","raw_affiliation_strings":["School of Computer Science, University of Nevada, Las Vegas, USA","[School of Computer Science, University of Nevada, Las Vegas, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Nevada, Las Vegas, USA","institution_ids":["https://openalex.org/I133999245"]},{"raw_affiliation_string":"[School of Computer Science, University of Nevada, Las Vegas, USA]","institution_ids":["https://openalex.org/I133999245"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050513868","display_name":"Yakov Nekrich","orcid":"https://orcid.org/0000-0003-3771-5088"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"YAKOV NEKRICH","raw_affiliation_strings":["Dept. of Computer Science, University of Bonn, Germany","Dept. of Computer Science, University of Bonn, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Germany#TAB#","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11226726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"14","issue":"01","first_page":"99","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9758999943733215,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9483000040054321,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.9730625152587891},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.7238969206809998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6274996995925903},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5392211079597473},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.523402988910675},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.414935439825058},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38949984312057495},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28827589750289917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27123549580574036},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.20548096299171448},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.169014573097229},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.15737494826316833},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.0882304310798645}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9730625152587891},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.7238969206809998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6274996995925903},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5392211079597473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.523402988910675},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.414935439825058},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38949984312057495},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28827589750289917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27123549580574036},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.20548096299171448},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.169014573097229},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.15737494826316833},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0882304310798645},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.0},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012962640400174x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962640400174x","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1986241425","https://openalex.org/W2020600762","https://openalex.org/W2042146958","https://openalex.org/W2060108852"],"related_works":["https://openalex.org/W2166346116","https://openalex.org/W3022794168","https://openalex.org/W4237802754","https://openalex.org/W4296567424","https://openalex.org/W2056723920","https://openalex.org/W2355839800","https://openalex.org/W2344988652","https://openalex.org/W2586352442","https://openalex.org/W1518463267","https://openalex.org/W2920861277"],"abstract_inverted_index":{"We":[0,28],"present":[1],"an":[2],"algorithm":[3],"for":[4],"parallel":[5],"construction":[6],"of":[7,24],"Huffman":[8,34],"codes":[9],"in":[10,39],"[Formula:":[11,40],"see":[12,41],"text]":[13,42],"time":[14,43],"with":[15,44],"p":[16],"processors,":[17],"where":[18],"p>1,":[19],"improving":[20],"the":[21],"previous":[22],"result":[23],"Levcopoulos":[25],"and":[26],"Przytycka.":[27],"also":[29],"show,":[30],"that":[31],"a":[32],"greedy":[33],"tree":[35],"can":[36],"be":[37],"constructed":[38],"n":[45],"processors.":[46]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}