{"id":"https://openalex.org/W2002270599","doi":"https://doi.org/10.1145/1806689.1806773","title":"An optimal ancestry scheme and small universal posets","display_name":"An optimal ancestry scheme and small universal posets","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2002270599","doi":"https://doi.org/10.1145/1806689.1806773","mag":"2002270599"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806773","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","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/A5071967017","display_name":"Pierre Fraigniaud","orcid":"https://orcid.org/0000-0003-4534-4803"},"institutions":[{"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/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"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Fraigniaud","raw_affiliation_strings":["CNRS and Univ. Paris Diderot, Paris, France","CNRS & University Paris Diderot, Paris, France#TAB#"],"affiliations":[{"raw_affiliation_string":"CNRS and Univ. Paris Diderot, Paris, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS & University Paris Diderot, Paris, France#TAB#","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I169173203","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040995971","display_name":"Amos Korman","orcid":"https://orcid.org/0000-0001-8652-9228"},"institutions":[{"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"]},{"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Amos Korman","raw_affiliation_strings":["CNRS and Univ. Paris Diderot, Paris, France","CNRS & University Paris Diderot, Paris, France#TAB#"],"affiliations":[{"raw_affiliation_string":"CNRS and Univ. Paris Diderot, Paris, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS & University Paris Diderot, Paris, France#TAB#","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I169173203","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071967017"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I169173203","https://openalex.org/I204730241"],"apc_list":null,"apc_paid":null,"fwci":0.4655,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.72552838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"611","last_page":"620"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"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.9979000091552734,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9884999990463257,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9706000089645386,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7817938327789307},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6254562139511108},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.6232450008392334},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6154302954673767},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5921353697776794},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5665066838264465},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5640836954116821},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5631093382835388},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5138376355171204},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5127618908882141},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5061973929405212},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.503868043422699},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47872042655944824},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.46619004011154175},{"id":"https://openalex.org/keywords/star-product","display_name":"Star product","score":0.4661107659339905},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4576297402381897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2724519371986389},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08150827884674072}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7817938327789307},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6254562139511108},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.6232450008392334},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6154302954673767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5921353697776794},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5665066838264465},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5640836954116821},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5631093382835388},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5138376355171204},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5127618908882141},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5061973929405212},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.503868043422699},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47872042655944824},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.46619004011154175},{"id":"https://openalex.org/C195800304","wikidata":"https://www.wikidata.org/wiki/Q7601281","display_name":"Star product","level":2,"score":0.4661107659339905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4576297402381897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2724519371986389},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08150827884674072},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1806689.1806773","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.168.6626","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.6626","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.liafa.jussieu.fr/%7Epierref/POSTSCRIPTS/STOC2010XML.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.702.4842","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.702.4842","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.liafa.univ-paris-diderot.fr/%7Epandit/Ancestry-Tight.pdf","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":37,"referenced_works":["https://openalex.org/W1535627680","https://openalex.org/W1543879246","https://openalex.org/W1560626952","https://openalex.org/W1560716145","https://openalex.org/W1561798411","https://openalex.org/W1587867115","https://openalex.org/W1603384057","https://openalex.org/W1963528186","https://openalex.org/W1980229659","https://openalex.org/W1981272925","https://openalex.org/W1982169430","https://openalex.org/W1990376056","https://openalex.org/W1992186598","https://openalex.org/W2002364208","https://openalex.org/W2006162221","https://openalex.org/W2008857840","https://openalex.org/W2012134249","https://openalex.org/W2023425290","https://openalex.org/W2025590344","https://openalex.org/W2025876682","https://openalex.org/W2027181837","https://openalex.org/W2042604558","https://openalex.org/W2057994027","https://openalex.org/W2060963839","https://openalex.org/W2078093849","https://openalex.org/W2086812946","https://openalex.org/W2093031769","https://openalex.org/W2096304547","https://openalex.org/W2139539283","https://openalex.org/W2151523609","https://openalex.org/W2530695705","https://openalex.org/W4319782100","https://openalex.org/W6645619144","https://openalex.org/W6648089026","https://openalex.org/W6651043845","https://openalex.org/W6657337389","https://openalex.org/W6659431881"],"related_works":["https://openalex.org/W4254064397","https://openalex.org/W3033029084","https://openalex.org/W2957182409","https://openalex.org/W3143802155","https://openalex.org/W2015965805","https://openalex.org/W2789323833","https://openalex.org/W1975173901","https://openalex.org/W4300914096","https://openalex.org/W3131828648","https://openalex.org/W61453168"],"abstract_inverted_index":{"In":[0,100],"this":[1],"paper,":[2],"we":[3,37],"solve":[4],"the":[5,25,30,58,83,110,123,138,150],"ancestry":[6,40,92,117],"problem,":[7],"which":[8],"was":[9],"introduced":[10],"more":[11],"than":[12],"twenty":[13],"years":[14],"ago":[15],"by":[16,69],"Kannan":[17],"et":[18,71],"al.":[19,72],"[STOC":[20],"'88],":[21],"and":[22,88,175],"is":[23,119,162],"among":[24],"most":[26,158],"well-studied":[27],"problems":[28],"in":[29,85,97,106,122],"field":[31],"of":[32,108,112,125,140,144,152,170],"informative":[33],"labeling":[34,41],"schemes.":[35],"Specifically,":[36,129],"construct":[38],"an":[39],"scheme":[42,81,118,136],"for":[43,130,149],"n-node":[44],"trees":[45],"with":[46,155],"label":[47,78],"size":[48,145],"log2":[49,59],"n":[50,60],"+":[51,61],"O(log":[52],"log":[53,63],"n)":[54,64,148],"bits,":[55],"thus":[56],"matching":[57],"\u03a9(log":[62],"bits":[65],"lower":[66,168],"bound":[67,161,169],"given":[68],"Alstrup":[70],"[SODA":[73],"'03].":[74],"Besides":[75],"its":[76,103],"optimal":[77],"size,":[79],"our":[80,116,135],"assigns":[82],"labels":[84],"linear":[86],"time,":[87],"guarantees":[89],"that":[90],"any":[91,131],"query":[93],"can":[94],"be":[95],"answered":[96],"constant":[98],"time.":[99],"addition":[101],"to":[102,166,173],"potential":[104],"impact":[105],"terms":[107],"improving":[109],"performances":[111],"XML":[113],"search":[114],"engines,":[115],"also":[120],"useful":[121],"context":[124],"partially":[126],"ordered":[127],"sets.":[128],"fixed":[132],"integer":[133],"k,":[134],"enables":[137],"construction":[139],"a":[141,167],"universal":[142],"poset":[143],"O(nk":[146],"log4k":[147],"family":[151],"n-element":[153],"posets":[154],"tree-dimension":[156],"at":[157],"k.":[159],"This":[160],"almost":[163],"tight":[164],"thanks":[165],"nk-o(1)":[171],"due":[172],"Alon":[174],"Scheinerman":[176],"[Order":[177],"'88].":[178]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}