{"id":"https://openalex.org/W2275573407","doi":"https://doi.org/10.1145/2794076","title":"An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets","display_name":"An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets","publication_year":2016,"publication_date":"2016-02-12","ids":{"openalex":"https://openalex.org/W2275573407","doi":"https://doi.org/10.1145/2794076","mag":"2275573407"},"language":"en","primary_location":{"id":"doi:10.1145/2794076","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2794076","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1611.02589","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Pierre Fraigniaud","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Fraigniaud","raw_affiliation_strings":["CNRS and University Paris Diderot, France"],"affiliations":[{"raw_affiliation_string":"CNRS and University Paris Diderot, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":null,"display_name":"Amos Korman","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Amos Korman","raw_affiliation_strings":["CNRS and University Paris Diderot, France"],"affiliations":[{"raw_affiliation_string":"CNRS and University Paris Diderot, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I169173203","https://openalex.org/I204730241"],"apc_list":null,"apc_paid":null,"fwci":0.7237,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7382109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"63","issue":"1","first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4165000021457672,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4165000021457672,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10237","display_name":"Cryptography and Data Security","score":0.15549999475479126,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.10689999908208847,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/scheme","display_name":"Scheme (mathematics)","score":0.8149999976158142},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6087999939918518},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.590399980545044},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.546999990940094},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46149998903274536},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4496999979019165},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.42489999532699585}],"concepts":[{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.8149999976158142},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6087999939918518},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.590399980545044},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.546999990940094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5072000026702881},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4918000102043152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46790000796318054},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46149998903274536},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4496999979019165},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.42489999532699585},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.4223000109195709},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4066999852657318},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39730000495910645},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.35199999809265137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3472999930381775},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2815999984741211},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26899999380111694}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2794076","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2794076","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1611.02589","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1611.02589","pdf_url":"https://arxiv.org/pdf/1611.02589","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01393643v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01393643","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the ACM (JACM), 2016, 63, pp.1 - 31. ⟨10.1145/2794076⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1611.02589","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1611.02589","pdf_url":"https://arxiv.org/pdf/1611.02589","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1485486436","https://openalex.org/W1543879246","https://openalex.org/W1560626952","https://openalex.org/W1594470187","https://openalex.org/W1963528186","https://openalex.org/W1980229659","https://openalex.org/W1992186598","https://openalex.org/W2002270599","https://openalex.org/W2006162221","https://openalex.org/W2008857840","https://openalex.org/W2012134249","https://openalex.org/W2018804864","https://openalex.org/W2023425290","https://openalex.org/W2025590344","https://openalex.org/W2042604558","https://openalex.org/W2045117606","https://openalex.org/W2046229991","https://openalex.org/W2057994027","https://openalex.org/W2060963839","https://openalex.org/W2068618567","https://openalex.org/W2078093849","https://openalex.org/W2093031769","https://openalex.org/W2096304547","https://openalex.org/W2115083710","https://openalex.org/W2137580272","https://openalex.org/W2247301512","https://openalex.org/W2530695705","https://openalex.org/W2752964345"],"related_works":[],"abstract_inverted_index":{"In":[0,130,188],"this":[1,298],"article,":[2],"we":[3,190],"solve":[4],"the":[5,14,58,63,93,133,147,167,224,247,265,279],"ancestry":[6,26,118,149,181,242],"-labeling":[7,195],"scheme":[8,73,112,119,150,182,196,243],"problem,":[9],"which":[10],"aims":[11],"at":[12,143,174,290],"assigning":[13],"shortest":[15],"possible":[16],"labels":[17,39,198,206,225],"(bit":[18],"strings)":[19],"to":[20,246,295,303,314],"nodes":[21,31],"of":[22,65,128,135,142,154,169,185,202,207,249,267,271,281,289,307],"rooted":[23],"trees,":[24],"so":[25],"queries":[27],"between":[28],"any":[29,232,258],"two":[30],"can":[32,234],"be":[33,184,235],"answered":[34,236],"by":[35,50,106,313],"inspecting":[36],"their":[37],"assigned":[38],"only.":[40],"This":[41],"problem":[42],"was":[43],"introduced":[44],"more":[45],"than":[46],"20":[47],"years":[48],"ago":[49],"Kannan":[51],"et":[52,108],"al.":[53,109],"[1988]":[54],"and":[55,229,316],"is":[56,113,173,300],"among":[57],"most":[59,144,170,175,291],"well-studied":[60],"problems":[61],"in":[62,226,237],"field":[64],"informative":[66],"labeling":[67],"schemes.":[68],"We":[69],"construct":[70],"an":[71,180,193],"ancestry-labeling":[72],"for":[74,132,257,278],"n":[75,83,88,96,100,136,157,199,211,275,282,308],"-node":[76,137,200],"trees":[77,138,172,201],"with":[78,139,205,285],"label":[79,152],"size":[80,153,208,272],"log":[81,87,94,99,155,209],"2":[82,95,156,160,210,214],"+":[84,97,158,162,212,216],"O":[85,163,217],"(log":[86],")":[89,101,277],"bits,":[90],"thus":[91],"matching":[92],"\u03a9(log":[98],"bits":[102],"lower":[103,305],"bound":[104,299,306],"given":[105],"Alstrup":[107],"[2003].":[110],"Our":[111],"based":[114],"on":[115,124],"a":[116,125,140,268,286,304],"simplified":[117,148],"that":[120,197,231],"operates":[121],"extremely":[122],"well":[123],"restricted":[126],"set":[127,134],"trees.":[129],"particular,":[131],"depth":[141,168,203],"d":[145,161,204,215],",":[146,262],"enjoys":[151],"2log":[159],"(1)":[164,218,312],"bits.":[165,219],"Since":[166],"XML":[171],"some":[176],"small":[177,250],"constant,":[178],"such":[179],"may":[183],"practical":[186],"use.":[187],"addition,":[189],"also":[191],"obtain":[192],"adjacency":[194],"3log":[213],"All":[220],"our":[221,241],"schemes":[222],"assign":[223],"linear":[227],"time,":[228],"guarantee":[230],"query":[233],"constant":[238],"time.":[239],"Finally,":[240],"finds":[244],"applications":[245],"construction":[248,266],"universal":[251,269],"partially":[252],"ordered":[253],"sets":[254],"(posets).":[255],"Specifically,":[256],"fixed":[259],"integer":[260],"k":[261,276,292,309],"it":[263],"enables":[264],"poset":[270],"\u00d5":[273],"(":[274],"family":[280],"-element":[283],"posets":[284],"tree":[287],"dimension":[288],".":[293],"Up":[294],"lower-order":[296],"terms,":[297],"tight":[301],"thanks":[302],"\u2212":[310],"o":[311],"Alon":[315],"Scheinerman":[317],"[1988].":[318]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}