{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T22:36:49Z","timestamp":1790375809905,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,17]],"date-time":"2013-11-17T00:00:00Z","timestamp":1384646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1150013"],"award-info":[{"award-number":["CCF-1150013"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0010295"],"award-info":[{"award-number":["DE-SC0010295"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,11,17]]},"DOI":"10.1145\/2503210.2503223","type":"proceedings-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T08:55:22Z","timestamp":1383123322000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["General transformations for GPU execution of tree traversals"],"prefix":"10.1145","author":[{"given":"Michael","family":"Goldfarb","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youngjoon","family":"Jo","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milind","family":"Kulkarni","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A hierarchical o(n log n) force-calculation algorithm. nature, 324:4","author":"Barnes J.","year":"1986","unstructured":"J. Barnes and P. Hut . A hierarchical o(n log n) force-calculation algorithm. nature, 324:4 , 1986 . J. Barnes and P. Hut. A hierarchical o(n log n) force-calculation algorithm. nature, 324:4, 1986."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-384988-5.00006-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071866.1071869"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/RT.2007.4342598"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461217.2461219"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.161"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2479870"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2523721.2523770"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048104"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384643"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2009.4919639"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.36"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1669112.1669121"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(90)90231-O"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/RT.2007.4342594"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145831"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1805964.1805972"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/10849171_5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01064.x"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542311"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1077"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572769.1572796"},{"key":"e_1_3_2_1_25_1","first-page":"1","volume-title":"Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium on","author":"Wei Z.","year":"2010","unstructured":"Z. Wei and J. JaJa . Optimization of linked list prefix computations on multithreaded gpus using cuda . In Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium on , pages 1 -- 8 . IEEE, 2010 . Z. Wei and J. JaJa. Optimization of linked list prefix computations on multithreaded gpus using cuda. In Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium on, pages 1--8. IEEE, 2010."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442523"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313789"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950408"}],"event":{"name":"SC13: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Denver Colorado","acronym":"SC13","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"]},"container-title":["Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503210.2503223","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2503210.2503223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:55Z","timestamp":1750220335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503210.2503223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,17]]},"references-count":27,"alternative-id":["10.1145\/2503210.2503223","10.1145\/2503210"],"URL":"https:\/\/doi.org\/10.1145\/2503210.2503223","relation":{},"subject":[],"published":{"date-parts":[[2013,11,17]]},"assertion":[{"value":"2013-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}