{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T04:42:21Z","timestamp":1786077741750,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806773","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"611-620","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["An optimal ancestry scheme and small universal posets"],"prefix":"10.1145","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[{"name":"CNRS and Univ. Paris Diderot, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amos","family":"Korman","sequence":"additional","affiliation":[{"name":"CNRS and Univ. Paris Diderot, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703437211"},{"key":"e_1_3_2_1_2_1","volume-title":"Morgan Kaufmann","author":"Abiteboul S.","year":"1999","unstructured":"S. Abiteboul , P. Buneman and D. Suciu . Data on the Web: From Relations to Semistructured Data and XML . Morgan Kaufmann , ( 1999 ). S. Abiteboul, P. Buneman and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, (1999)."},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA)","year":"2001","unstructured":"Abiteboul, S., Kaplan, H., and Milo, T .: Compact labeling schemes for ancestor queries . In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA) , 2001 . Abiteboul, S., Kaplan, H., and Milo, T.: Compact labeling schemes for ancestor queries. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2001."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Alstrup S.","year":"2003","unstructured":"S. Alstrup , P. Bille and T. Rauhe . Labeling Schemes for Small Distances in Trees . In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA) , 2003 . S. Alstrup, P. Bille and T. Rauhe. Labeling Schemes for Small Distances in Trees. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1155-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652151"},{"key":"e_1_3_2_1_7_1","first-page":"947","volume-title":"Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Alstrup S.","year":"2002","unstructured":"S. Alstrup and T. Rauhe . Improved labeling scheme for ancestor queries . In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 947 -- 953 , 2002 . S. Alstrup and T. Rauhe. Improved labeling scheme for ancestor queries. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 947--953, 2002."},{"key":"e_1_3_2_1_8_1","first-page":"11","volume":"5","author":"Alon N.","year":"1988","unstructured":"N. Alon and E. R. Scheinerman . Degrees of Freedom Versus Dimension for Containment Orders. In Order 5 ( 1988 ), 11 -- 16 . N. Alon and E. R. Scheinerman. Degrees of Freedom Versus Dimension for Containment Orders. In Order 5 (1988), 11--16.","journal-title":"Degrees of Freedom Versus Dimension for Containment Orders. In Order"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01111300"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00020-1"},{"key":"e_1_3_2_1_11_1","volume-title":"North-Holland","author":"Fraisse R.","year":"1953","unstructured":"R. Fraisse Theory of relations . North-Holland , Amsterdam , 1953 . R. Fraisse Theory of relations. North-Holland, Amsterdam, 1953."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684110"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873639"},{"key":"e_1_3_2_1_14_1","first-page":"210","volume-title":"Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Gavoille C.","year":"2001","unstructured":"C. Gavoille , D. Peleg , S. P\u00e9rennes and R. Raz . Distance labeling in graphs . In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 210 -- 219 , 2001 . C. Gavoille, D. Peleg, S. P\u00e9rennes and R. Raz. Distance labeling in graphs. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 210--219, 2001."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2004.01.008"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.7146\/math.scand.a-10468"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0096607-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433912"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721855"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0025-1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645933.673351"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Kaplan H.","year":"2002","unstructured":"H. Kaplan , T. Milo and R. Shabo . A Comparison of Labeling Schemes for Ancestor Queries . In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA) , 2002 . H. Kaplan, T. Milo and R. Shabo. A Comparison of Labeling Schemes for Ancestor Queries. In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2002."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405049"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039493"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and partially ordered sets: Dimension theory","author":"Trotter W. T.","year":"1992","unstructured":"W. T. Trotter . Combinatorics and partially ordered sets: Dimension theory . The Johns Hopkins University Press , ( 1992 ). W. T. Trotter. Combinatorics and partially ordered sets: Dimension theory. The Johns Hopkins University Press, (1992)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(77)90048-X"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1962-0172273-0"},{"key":"e_1_3_2_1_30_1","unstructured":"W3C.Extensive markup language (XML) 1.0. http:\/\/www.w3.org\/TR\/REC-xml. W3C.Extensive markup language (XML) 1.0. http:\/\/www.w3.org\/TR\/REC-xml."},{"key":"e_1_3_2_1_31_1","unstructured":"W3C. Exensive stylesheet language (xsl) 1.0. http:\/\/www.w3.org\/Style\/XSL\/. W3C. Exensive stylesheet language (xsl) 1.0. http:\/\/www.w3.org\/Style\/XSL\/."},{"key":"e_1_3_2_1_32_1","unstructured":"W3C. Xsl transformations (xslt) specification. http:\/\/www.w3.org\/TR\/WD-xslt W3C. Xsl transformations (xslt) specification. http:\/\/www.w3.org\/TR\/WD-xslt"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806773","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":32,"alternative-id":["10.1145\/1806689.1806773","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806773","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}