{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:01:29Z","timestamp":1774368089766,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T00:00:00Z","timestamp":1340582400000},"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":[[2012,6,25]]},"DOI":"10.1145\/2312005.2312045","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"205-213","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design"],"prefix":"10.1145","author":[{"given":"Guy E.","family":"Blelloch","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanat","family":"Tangwongsan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796341"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792224474"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875536"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_3_2_1_6_1","first-page":"48","volume-title":"ALENEX","author":"Guy","year":"2011","unstructured":"Guy E. Blelloch and Julian Shun. A simple parallel cartesian tree algorithm and its application to suffix tree construction . In ALENEX , pages 48 -- 58 , 2011 . Guy E. Blelloch and Julian Shun. A simple parallel cartesian tree algorithm and its application to suffix tree construction. In ALENEX, pages 48--58, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810535"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222017"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"e_1_3_2_1_10_1","volume-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1 Joseph","year":"1992","unstructured":"Joseph J\u00e1J\u00e1 . An Introduction to Parallel Algorithms . Addison-Wesley , 1992 . Joseph J\u00e1J\u00e1. An Introduction to Parallel Algorithms. Addison-Wesley, 1992."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033114.18632.e0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217044"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218041"},{"key":"e_1_3_2_1_14_1","series-title":"Algorithms and Combinatorics","first-page":"37","volume-title":"Trends in Discrete and Computational Geometry","author":"Seidel Raimund","year":"1992","unstructured":"Raimund Seidel . Backwards analysis of randomized geometric algorithms . In Trends in Discrete and Computational Geometry , volume 10 of Algorithms and Combinatorics , pages 37 -- 68 . Springer-Verlag , 1992 . Raimund Seidel. Backwards analysis of randomized geometric algorithms. In Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 37--68. Springer-Verlag, 1992."},{"key":"e_1_3_2_1_15_1","first-page":"27","article-title":"A Mathematical Theory of Communication","author":"Shannon C. E.","year":"1948","unstructured":"C. E. Shannon . A Mathematical Theory of Communication . Bell System Technical Journal , 27 , 1948 . C. E. Shannon. A Mathematical Theory of Communication. Bell System Technical Journal, 27, 1948.","journal-title":"Bell System Technical Journal"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217079"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00021-1"}],"event":{"name":"SPAA '12: 24th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Pittsburgh Pennsylvania USA","acronym":"SPAA '12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312045","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2312005.2312045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:48Z","timestamp":1750236528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":17,"alternative-id":["10.1145\/2312005.2312045","10.1145\/2312005"],"URL":"https:\/\/doi.org\/10.1145\/2312005.2312045","relation":{},"subject":[],"published":{"date-parts":[[2012,6,25]]},"assertion":[{"value":"2012-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}