{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:47:37Z","timestamp":1777459657441,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T00:00:00Z","timestamp":1154217600000},"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":[[2006,7,30]]},"DOI":"10.1145\/1148109.1148143","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"207-216","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["On space-stretch trade-offs"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[{"name":"University of Bordeaux, Bordeaux, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem and Microsoft Research, Silicon Valley Center"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132557"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003730200002"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796308485"},{"key":"e_1_3_2_1_4_1","first-page":"29","volume-title":"Publ","author":"Erd\u00f6s Paul","year":"1964","unstructured":"Paul Erd\u00f6s . Extremal problems in graph theory . In Publ . House Cszechoslovak Acad . Sci., Prague, pages 29 -- 36 , 1964 .]] Paul Erd\u00f6s. Extremal problems in graph theory. In Publ. House Cszechoslovak Acad. Sci., Prague, pages 29--36, 1964.]]"},{"key":"e_1_3_2_1_5_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"28th International Colloquium on Automata, Languages and Programming (ICALP)","author":"Fraigniaud Pierre","year":"2001","unstructured":"Pierre Fraigniaud and Cyril Gavoille . Routing in trees . In 28th International Colloquium on Automata, Languages and Programming (ICALP) , volume 2076 of Lecture Notes in Computer Science , pages 757 -- 772 . Springer , July 2001 .]] Pierre Fraigniaud and Cyril Gavoille. Routing in trees. In 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 757--772. Springer, July 2001.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696161"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248075"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646511.695171"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011841"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074005"},{"key":"e_1_3_2_1_11_1","volume-title":"January","author":"Lazebnik Felix","year":"1995","unstructured":"Felix Lazebnik , Vasiliy A. Ustimenko , and Andrew J. Woldar . A new series of dense graphs of high girth. Bulletin of the American Mathematical Society (New Series), 32(1):73--79 , January 1995 .]] Felix Lazebnik, Vasiliy A. Ustimenko, and Andrew J. Woldar. A new series of dense graphs of high girth. Bulletin of the American Mathematical Society (New Series), 32(1):73--79, January 1995.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/261084"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65953"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"}],"event":{"name":"SPAA06: 18th ACM Symposium on Parallelism in Algorithms and Architectures 2006","location":"Cambridge Massachusetts USA","acronym":"SPAA06","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148109.1148143","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1148109.1148143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:53Z","timestamp":1750290233000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148109.1148143"}},"subtitle":["lower bounds"],"short-title":[],"issued":{"date-parts":[[2006,7,30]]},"references-count":14,"alternative-id":["10.1145\/1148109.1148143","10.1145\/1148109"],"URL":"https:\/\/doi.org\/10.1145\/1148109.1148143","relation":{},"subject":[],"published":{"date-parts":[[2006,7,30]]},"assertion":[{"value":"2006-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}