{"id":"https://openalex.org/W2164966011","doi":"https://doi.org/10.1142/s0129054192000024","title":"OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES","display_name":"OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES","publication_year":1992,"publication_date":"1992-03-01","ids":{"openalex":"https://openalex.org/W2164966011","doi":"https://doi.org/10.1142/s0129054192000024","mag":"2164966011"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054192000024","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054192000024","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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/A5086528192","display_name":"Stephan Olariu","orcid":"https://orcid.org/0000-0002-3776-216X"},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"STEPHAN OLARIU","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, USA","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109548590","display_name":"James L. Schwing","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JAMES L. SCHWING","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, USA","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100639601","display_name":"Jingyuan Zhang","orcid":"https://orcid.org/0000-0001-6644-4673"},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JINGYUAN ZHANG","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, USA","institution_ids":["https://openalex.org/I81365321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I81365321"],"apc_list":null,"apc_paid":null,"fwci":1.1105,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83285933,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"03","issue":"01","first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9973999857902527,"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.9973999857902527,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9817000031471252,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/decoding-methods","display_name":"Decoding methods","score":0.7480041980743408},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.7260407209396362},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.6953115463256836},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6934528946876526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.599774956703186},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5969853401184082},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.591515839099884},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5458999872207642},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5343773365020752},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5159431099891663},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4869300127029419},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48511993885040283},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4737164378166199},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.45699235796928406},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.44717738032341003},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.4442351162433624},{"id":"https://openalex.org/keywords/binary-expression-tree","display_name":"Binary expression tree","score":0.42293354868888855},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.4147777855396271},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35967904329299927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3370375335216522},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2978824973106384},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.28004783391952515},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2679063379764557},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15814080834388733},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07850918173789978}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7480041980743408},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.7260407209396362},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.6953115463256836},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6934528946876526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.599774956703186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5969853401184082},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.591515839099884},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5458999872207642},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5343773365020752},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5159431099891663},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4869300127029419},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48511993885040283},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4737164378166199},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.45699235796928406},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.44717738032341003},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.4442351162433624},{"id":"https://openalex.org/C166055160","wikidata":"https://www.wikidata.org/wiki/Q4913895","display_name":"Binary expression tree","level":3,"score":0.42293354868888855},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.4147777855396271},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35967904329299927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3370375335216522},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2978824973106384},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.28004783391952515},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2679063379764557},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15814080834388733},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07850918173789978},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054192000024","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054192000024","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W4244673516","https://openalex.org/W2107381954","https://openalex.org/W3169685561","https://openalex.org/W2382364329","https://openalex.org/W3022865202","https://openalex.org/W2375800038","https://openalex.org/W2355273608","https://openalex.org/W2501849745","https://openalex.org/W2117536196"],"abstract_inverted_index":{"Encoding":[0],"the":[1,33,41,62,65,89],"shape":[2,43,63],"of":[3,14,45,64,92],"a":[4,8,12,51,71],"binary":[5,34,48,67],"tree":[6,35,49,72],"is":[7],"basic":[9],"step":[10],"in":[11,16,50,78,88],"number":[13],"algorithms":[15,30,76],"integrated":[17],"circuit":[18],"design,":[19],"automated":[20],"theorem":[21],"proving,":[22],"and":[23],"game":[24],"playing.":[25],"We":[26],"propose":[27],"cost-optimal":[28],"parallel":[29],"to":[31],"solve":[32],"encoding/decoding":[36],"problem.":[37],"Specifically,":[38],"we":[39,60],"encode":[40],"relevant":[42],"information":[44],"an":[46,56],"n-node":[47],"2n":[52,58],"bitstring.":[53],"Conversely,":[54],"given":[55],"arbitrary":[57],"bitstring":[59],"reconstruct":[61],"corresponding":[66],"tree,":[68],"if":[69],"such":[70],"exists.":[73],"All":[74],"our":[75],"run":[77],"O":[79,84],"(log":[80],"n)":[81,86],"time":[82],"using":[83],"(n/log":[85],"processors":[87],"EREW-PRAM":[90],"model":[91],"computation.":[93]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}