{"id":"https://openalex.org/W2510793939","doi":"https://doi.org/10.1109/isit.2016.7541492","title":"Lossless compression of binary trees with correlated vertex names","display_name":"Lossless compression of binary trees with correlated vertex names","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2510793939","doi":"https://doi.org/10.1109/isit.2016.7541492","mag":"2510793939"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541492","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5004115333","display_name":"Abram Magner","orcid":"https://orcid.org/0000-0002-3082-9915"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Abram Magner","raw_affiliation_strings":["Coordinated Science Laboratory, Univ. of Illinois at Urbana-Champaign, USA","Coordinated Science Laboratory, Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA"],"affiliations":[{"raw_affiliation_string":"Coordinated Science Laboratory, Univ. of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Coordinated Science Laboratory, Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011996079","display_name":"Krzysztof Turowski","orcid":"https://orcid.org/0000-0003-3871-1038"},"institutions":[{"id":"https://openalex.org/I169333911","display_name":"Gda\u0144sk University of Technology","ror":"https://ror.org/006x4sc24","country_code":"PL","type":"education","lineage":["https://openalex.org/I169333911"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Krzysztof Turowski","raw_affiliation_strings":["Dept. of Algorithms and System Modeling, Gdansk University of Technology, Poland","Dept. of Algorithms and System Modeling, Gdansk University of Technology, Gdansk, Poland"],"affiliations":[{"raw_affiliation_string":"Dept. of Algorithms and System Modeling, Gdansk University of Technology, Poland","institution_ids":["https://openalex.org/I169333911"]},{"raw_affiliation_string":"Dept. of Algorithms and System Modeling, Gdansk University of Technology, Gdansk, Poland","institution_ids":["https://openalex.org/I169333911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019536160","display_name":"Wojciech Szpankowski","orcid":"https://orcid.org/0000-0001-9062-0067"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wojciech Szpankowski","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004115333"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":2.6661,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.92134229,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1217","last_page":"1221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9919999837875366,"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/lossless-compression","display_name":"Lossless compression","score":0.7944444417953491},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6863821744918823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6015233993530273},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5977275967597961},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5615947246551514},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5587133169174194},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.5217952728271484},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5128982067108154},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5116620063781738},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4663362503051758},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46260058879852295},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.45725932717323303},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.4426953196525574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44115734100341797},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3618702292442322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3540571928024292},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.16683748364448547},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1442282795906067},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07101863622665405}],"concepts":[{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.7944444417953491},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6863821744918823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6015233993530273},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5977275967597961},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5615947246551514},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5587133169174194},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.5217952728271484},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5128982067108154},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5116620063781738},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4663362503051758},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46260058879852295},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.45725932717323303},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.4426953196525574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44115734100341797},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3618702292442322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3540571928024292},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.16683748364448547},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1442282795906067},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07101863622665405},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541492","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W656781005","https://openalex.org/W1975373301","https://openalex.org/W2005437133","https://openalex.org/W2029852131","https://openalex.org/W2042049682","https://openalex.org/W2048405441","https://openalex.org/W2059271044","https://openalex.org/W2065060855","https://openalex.org/W2094341933","https://openalex.org/W2094494177","https://openalex.org/W2110940943","https://openalex.org/W2123014390","https://openalex.org/W2170661743","https://openalex.org/W2963957816","https://openalex.org/W3102335961","https://openalex.org/W3105785125","https://openalex.org/W6674404025"],"related_works":["https://openalex.org/W4376140277","https://openalex.org/W2077383771","https://openalex.org/W2091985989","https://openalex.org/W4367055576","https://openalex.org/W2011933350","https://openalex.org/W2914983903","https://openalex.org/W2019778981","https://openalex.org/W1971148082","https://openalex.org/W2146997899","https://openalex.org/W2157858201"],"abstract_inverted_index":{"Compression":[0],"schemes":[1,136,153],"for":[2,123,131,138,146],"advanced":[3,49],"data":[4,19,29,50],"structures":[5,51],"have":[6,42],"become":[7],"the":[8,110,114,121,155],"challenge":[9],"of":[10,48,87,100,113,126],"today.":[11],"Information":[12],"theory":[13],"has":[14],"traditionally":[15],"dealt":[16],"with":[17,67,81,141],"conventional":[18],"such":[20,52],"as":[21,53],"text,":[22],"image,":[23],"or":[24],"video.":[25],"In":[26,57],"contrast,":[27],"most":[28],"available":[30],"today":[31],"is":[32],"multi-type":[33],"and":[34,90,144],"context":[35],"dependent.":[36],"To":[37],"meet":[38],"this":[39,58,62],"challenge,":[40],"we":[41,60,79,95,129],"recently":[43],"initiated":[44],"a":[45,101,106],"systematic":[46],"study":[47],"unlabeled":[54],"graphs":[55],"[1].":[56],"paper,":[59],"continue":[61],"program":[63],"by":[64],"considering":[65],"trees":[66,84,140],"statistically":[68],"correlated":[69,142],"vertex":[70,102,116],"names.":[71],"Trees":[72],"come":[73],"in":[74,105],"many":[75],"forms,":[76],"but":[77],"here":[78],"deal":[80],"binary":[82],"plane":[83,139],"(where":[85],"order":[86],"subtrees":[88],"matters)":[89],"their":[91],"non-plane":[92,147],"version.":[93],"Furthermore,":[94],"assume":[96],"that":[97,151],"each":[98],"symbol":[99,112],"name":[103],"depends":[104],"Markovian":[107],"sense":[108],"on":[109],"corresponding":[111],"parent":[115],"name.":[117],"We":[118,149],"first":[119],"evaluate":[120],"entropy":[122],"both":[124],"types":[125],"trees.":[127,148],"Then":[128],"propose":[130],"known":[132],"sources":[133],"two":[134,159],"compression":[135],"COMPRESSPTREE":[137],"names,":[143],"COMPRESSNPTREE":[145],"show":[150],"these":[152],"achieve":[154],"lower":[156],"bound":[157],"within":[158],"bits.":[160]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}