{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:53Z","timestamp":1750694693225,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T00:00:00Z","timestamp":1249948800000},"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":[[2009,8,11]]},"DOI":"10.1145\/1583991.1584031","type":"proceedings-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T18:34:59Z","timestamp":1250534099000},"page":"131-137","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["On randomized representations of graphs using short labels"],"prefix":"10.1145","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[{"name":"CNRS and Univ. Paris Diderot, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos","family":"Korman","sequence":"additional","affiliation":[{"name":"CNRS and Univ. Paris Diderot, paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,8,11]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1137\/S0097539703437211"},{"key":"e_1_3_2_1_2_1","first-page":"547","volume-title":"12th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Abiteboul S.","year":"2001","unstructured":"S. Abiteboul , H. Kaplan , and T. Milo . Compact labeling schemes for ancestor queries . In 12th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 547 -- 556 , 2001 . S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 547--556, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1137\/S0895480103433409"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/645413.652151"},{"key":"e_1_3_2_1_5_1","first-page":"156","volume-title":"10th ACM-SIAM symposium on Discrete algorithms (SODA)","author":"Capalbo M.","year":"1999","unstructured":"M. Capalbo . A small universal graph for bounded-degree planar graphs . In 10th ACM-SIAM symposium on Discrete algorithms (SODA) , pages 156 -- 160 , 1999 . M. Capalbo. A small universal graph for bounded-degree planar graphs. In 10th ACM-SIAM symposium on Discrete algorithms (SODA), pages 156--160, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/11841036_20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/543613.543648"},{"key":"e_1_3_2_1_8_1","volume-title":"Compact Ancestry Labeling Schemes for Trees of Small Depth. Submitted","author":"Fraigniaud P.","year":"2009","unstructured":"P. Fraigniaud and A. Korman . Compact Ancestry Labeling Schemes for Trees of Small Depth. Submitted , 2009 . (see http:\/\/arxiv.org\/pdf\/0902.3081). P. Fraigniaud and A. Korman. Compact Ancestry Labeling Schemes for Trees of Small Depth. Submitted, 2009. (see http:\/\/arxiv.org\/pdf\/0902.3081)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1137\/0405049"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.5555\/645933.673351"},{"key":"e_1_3_2_1_11_1","first-page":"954","volume-title":"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 19th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 954 -- 963 , 2002 . H. Kaplan, T. Milo and R. Shabo. A Comparison of Labeling Schemes for Ancestor Queries. In 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 954--963, 2002."},{"unstructured":"A. Korman D. Peleg and Y. Rodeh. Constructing Labeling Schemes Through Universal Matrices. Algorithmica to appear.  A. Korman D. Peleg and Y. Rodeh. Constructing Labeling Schemes Through Universal Matrices. Algorithmica to appear.","key":"e_1_3_2_1_12_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/211390"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1016\/j.tcs.2005.03.015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.4064\/aa-9-4-331-340"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/378580.378581"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"acronym":"SPAA 09","name":"SPAA 09: 21st ACM Symposium on Parallelism in Algorithms and Architectures","location":"Calgary AB Canada"},"container-title":["Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1584031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1583991.1584031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:55Z","timestamp":1750278175000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1584031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,11]]},"references-count":16,"alternative-id":["10.1145\/1583991.1584031","10.1145\/1583991"],"URL":"https:\/\/doi.org\/10.1145\/1583991.1584031","relation":{},"subject":[],"published":{"date-parts":[[2009,8,11]]},"assertion":[{"value":"2009-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}