乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:21:54Z","timestamp":1740097314825,"version":"3.37.3"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T00:00:00Z","timestamp":1499731200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1533858"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935765","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"443-454","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Parallel Shortest Paths Using Radius Stepping"],"prefix":"10.1145","author":[{"given":"Guy E.","family":"Blelloch","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Yan","family":"Gu","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Yihan","family":"Sun","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Kanat","family":"Tangwongsan","sequence":"additional","affiliation":[{"name":"Mahidol University International College, Nakhonpathom, Thailand"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935768"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277660"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1425"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0048"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0813"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331610"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/50087.50096"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_11_1","volume-title":"A parallel algorithm for all pairs shortest paths in a random graph","author":"Frieze M.","year":"1984","unstructured":". M. Frieze and L. Rudolph . A parallel algorithm for all pairs shortest paths in a random graph . Management Sciences Research Group, Graduate School of Industrial Administration, Carnegie-Mellon University , 1984 . . M. Frieze and L. Rudolph. A parallel algorithm for all pairs shortest paths in a random graph. Management Sciences Research Group, Graduate School of Industrial Administration, Carnegie-Mellon University, 1984."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755597"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/140901.141913"},{"volume-title":"Introduction to Parallel Algorithms","year":"1992","key":"e_1_3_2_1_14_1","unstructured":". Jaja. Introduction to Parallel Algorithms . Addison-Wesley Professional , 1992 . . Jaja. Introduction to Parallel Algorithms. Addison-Wesley Professional, 1992."},{"key":"e_1_3_2_1_15_1","volume-title":"Parallel algorithms for shared-memory machines. Handbook of theoretical computer science (vol. a): algorithms and complexity","author":"Karp M.","year":"1991","unstructured":". M. Karp and V. Ramachandran . Parallel algorithms for shared-memory machines. Handbook of theoretical computer science (vol. a): algorithms and complexity , 1991 . . M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. Handbook of theoretical computer science (vol. a): algorithms and complexity, 1991."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366861"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0888"},{"key":"e_1_3_2_1_18_1","volume-title":"SNAP Datasets: Stanford large network dataset collection","author":"Krevl A.","year":"2014","unstructured":". Leskovec and A. Krevl . SNAP Datasets: Stanford large network dataset collection . 2014 . . Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. 2014."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755574"},{"key":"e_1_3_2_1_21_1","first-page":"14","volume-title":"International Conference on Parallel Processing (ICPP)","author":"Paige C.","year":"1985","unstructured":". C. Paige and C. P. Kruskal . Parallel algorithms for shortest path problems . In International Conference on Parallel Processing (ICPP) , pages 14 -- 20 , 1985 . . C. Paige and C. P. Kruskal. Parallel algorithms for shortest path problems. In International Conference on Parallel Processing (ICPP), pages 14--20, 1985."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00287-5"},{"key":"e_1_3_2_1_23_1","volume-title":"Informatique th\u00e9orique, 17(4):397--404","author":"Vishkin U.","year":"1983","unstructured":". Paul, U. Vishkin , and H. Wagener . Parallel computation on 2--3-trees. RAIRO , Informatique th\u00e9orique, 17(4):397--404 , 1983 . . Paul, U. Vishkin, and H. Wagener. Parallel computation on 2--3-trees. RAIRO, Informatique th\u00e9orique, 17(4):397--404, 1983."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646237.683018"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0968"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/265910.265923"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316548"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1646"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220006"}],"event":{"name":"SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pacific Grove California USA","acronym":"SPAA '16"},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935765","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T16:08:39Z","timestamp":1673453319000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":29,"alternative-id":["10.1145\/2935764.2935765","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935765","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}