{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T17:17:58Z","timestamp":1769966278877,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Israel Science Foundation","award":["794\/13"],"award-info":[{"award-number":["794\/13"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087804","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"185-194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Distance Labeling Schemes for Trees"],"prefix":"10.1145","author":[{"given":"Ofer","family":"Freedman","sequence":"first","affiliation":[{"name":"University of Haifa, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"additional","affiliation":[{"name":"University of Haifa, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick K.","family":"Nicholson","sequence":"additional","affiliation":[{"name":"Bell Labs, Dublin, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[{"name":"University of Haifa, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"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","first-page":"159","volume-title":"17th ALENEX","author":"Ajwani Deepak","year":"2015","unstructured":"Deepak Ajwani , Ulrich Meyer , and David Veith . An I\/O-efficient distance oracle for evolving real-world graphs . In 17th ALENEX , pages 159 -- 172 , 2015 . Deepak Ajwani, Ulrich Meyer, and David Veith. An I\/O-efficient distance oracle for evolving real-world graphs. In 17th ALENEX, pages 159--172, 2015."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247614"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103433409"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.84"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch25"},{"key":"e_1_3_2_1_8_1","first-page":"1","volume-title":"43rd ICALP","author":"Alstrup Stephen","year":"2016","unstructured":"Stephen Alstrup , Inge Li G\u00f8rtz , Esben Bistrup Halvorsen , and Ely Porat . Distance labeling schemes for trees . In 43rd ICALP , pages 132: 1 -- 132 :16, 2016 . Stephen Alstrup, Inge Li G\u00f8rtz, Esben Bistrup Halvorsen, and Ely Porat. Distance labeling schemes for trees. In 43rd ICALP, pages 132:1--132:16, 2016."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.72"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746545"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181882"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2007.01.022"},{"key":"e_1_3_2_1_13_1","first-page":"265","volume-title":"The Theory and Applications of Graphs","author":"Chung FRK","year":"1981","unstructured":"FRK Chung , RL Graham , and D Coppersmith . On trees containing all small trees . The Theory and Applications of Graphs , pages 265 -- 272 , 1981 . FRK Chung, RL Graham, and D Coppersmith. On trees containing all small trees. The Theory and Applications of Graphs, pages 265--272, 1981."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_67"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.38"},{"key":"e_1_3_2_1_17_1","volume-title":"Optimal distance labeling schemes for trees. Arxiv 1608.00212","author":"Freedman O.","year":"2017","unstructured":"O. Freedman , P. Gawrychowski , P.K. Nicholson , and O. Weimann . Optimal distance labeling schemes for trees. Arxiv 1608.00212 , 2017 . O. Freedman, P. Gawrychowski, P.K. Nicholson, and O. Weimann. Optimal distance labeling schemes for trees. Arxiv 1608.00212, 2017."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44676-1_40"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77120-3_63"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01116454"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405049"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44634-6_23"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(200003)33:3%3C167::AID-JGT7%3E3.0.CO;2-5"},{"key":"e_1_3_2_1_25_1","first-page":"1","volume-title":"43rd ICALP","author":"Petersen Casper","year":"2016","unstructured":"Casper Petersen , Noy Rotbart , Jakob Grue Simonsen , and Christian Wulff-Nilsen . Near-optimal adjacency labeling scheme for power-law graphs . In 43rd ICALP , pages 133: 1 -- 133 :15, 2016 . Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, and Christian Wulff-Nilsen. Near-optimal adjacency labeling scheme for power-law graphs. In 43rd ICALP, pages 133:1--133:15, 2016."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"}],"event":{"name":"PODC '17: ACM Symposium on Principles of Distributed Computing","location":"Washington DC USA","acronym":"PODC '17","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":27,"alternative-id":["10.1145\/3087801.3087804","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087804","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}