{"id":"https://openalex.org/W2020600762","doi":"https://doi.org/10.1137/s0097539792233245","title":"Constructing Huffman Trees in Parallel","display_name":"Constructing Huffman Trees in Parallel","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W2020600762","doi":"https://doi.org/10.1137/s0097539792233245","mag":"2020600762"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792233245","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792233245","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/A5038877069","display_name":"Lawrence L. Larmore","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lawrence L. Larmore","raw_affiliation_strings":[],"affiliations":[]},{"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":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038877069"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3522,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.89127449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"24","issue":"6","first_page":"1163","last_page":"1169"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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":0.9998999834060669,"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.9866999983787537,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.978600025177002,"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/huffman-coding","display_name":"Huffman coding","score":0.976616382598877},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.8609984517097473},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.569487452507019},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5079517960548401},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.5005683898925781},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.48765337467193604},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.45658817887306213},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4512079656124115},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.4479045569896698},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4227827489376068},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4213936924934387},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3922886252403259},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3883151412010193},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38561367988586426},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.3741976022720337},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32716408371925354},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.25925934314727783},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.13946321606636047},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.12469390034675598},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.06638079881668091}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.976616382598877},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.8609984517097473},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.569487452507019},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5079517960548401},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.5005683898925781},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.48765337467193604},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.45658817887306213},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4512079656124115},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.4479045569896698},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4227827489376068},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4213936924934387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3922886252403259},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3883151412010193},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38561367988586426},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.3741976022720337},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32716408371925354},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.25925934314727783},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.13946321606636047},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.12469390034675598},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.06638079881668091},{"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/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539792233245","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792233245","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.3927","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.3927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cherubino.med.jhmi.edu//~przytyck/phuff.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1981320868","https://openalex.org/W2015784096","https://openalex.org/W2016871180","https://openalex.org/W2046569320","https://openalex.org/W2057640376","https://openalex.org/W2096827683","https://openalex.org/W2152978478","https://openalex.org/W2160178218","https://openalex.org/W3159663081"],"related_works":["https://openalex.org/W3022794168","https://openalex.org/W2586352442","https://openalex.org/W2355839800","https://openalex.org/W2344988652","https://openalex.org/W2166346116","https://openalex.org/W2920861277","https://openalex.org/W2914103308","https://openalex.org/W2786516964","https://openalex.org/W3124939005","https://openalex.org/W1607635215"],"abstract_inverted_index":{"We":[0,10],"present":[1],"a":[2,26,44,87],"parallel":[3,27,62],"algorithm":[4,28,63,91],"for":[5,64,86,92],"the":[6,12,17,31,57,70,75],"Huffman":[7,13,65,71,93],"coding":[8,14,72],"problem.":[9],"reduce":[11],"problem":[15,23,33,73,77],"to":[16,56,74],"concave":[18],"least":[19],"weight":[20],"subsequence":[21],"(CLWS)":[22],"and":[24],"give":[25],"that":[29],"solves":[30],"latter":[32],"in":[34],"$O(\\sqrt":[35],"n":[36,41],"\\log":[37],"n)$":[38],"time":[39],"with":[40],"processors":[42],"on":[43],"concurrent":[45],"read":[46],"exclusive":[47],"write":[48],"parameter":[49],"random-access":[50],"machine":[51],"(CREW":[52],"PRAM).":[53],"This":[54,67],"leads":[55],"first":[58],"sublinear-time":[59],"$o(n^2":[60],")$-total-work":[61],"coding.":[66,94],"reduction":[68],"of":[69],"CLWS":[76],"also":[78],"yields":[79],"an":[80],"alternative":[81],"$O(n\\log":[82],"n)$-time":[83],"(or":[84],"linear-time,":[85],"sorted":[88],"input":[89],"sequence)":[90]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}