{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:18Z","timestamp":1750306998907,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"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.2312042","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"190-192","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief announcement"],"prefix":"10.1145","author":[{"given":"James Alexander","family":"Edwards","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1109\/SFCS.1989.63515"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1989493.1989511"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. HotPar","author":"Caragea G. C.","year":"2010","unstructured":"G. C. Caragea , F. Keceli , A. Tzannes , and U. Vishkin . General-purpose vs. GPU: Comparison of many-cores on irregular workloads . In Proc. HotPar , 2010 . G. C. Caragea, F. Keceli, A. Tzannes, and U. Vishkin. General-purpose vs. GPU: Comparison of many-cores on irregular workloads. In Proc. HotPar, 2010."},{"key":"e_1_3_2_1_4_1","volume-title":"The open graph drawing framework","author":"Chimani M.","year":"2010","unstructured":"M. Chimani , C. Gutwenger , M. J\\\"{u}nger, K. Klein , P. Mutzel , and M. Schulz . The open graph drawing framework . Technische Universitat Dortmund and University of Cologne . http:\/\/ogdf.net\/, 2010 . M. Chimani, C. Gutwenger, M. J\\\"{u}nger, K. Klein, P. Mutzel, and M. Schulz. The open graph drawing framework. Technische Universitat Dortmund and University of Cologne. http:\/\/ogdf.net\/, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2141702.2141714"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1137\/0222040"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"Gutwenger C.","year":"2001","unstructured":"C. Gutwenger and P. Mutzel . A linear time implementation of SPQR-trees . In J. Marks, editor, Graph Drawing , volume 1984 of Lecture Notes in Computer Science , pages 77 -- 90 . Springer Berlin \/ Heidelberg , 2001 . C. Gutwenger and P. Mutzel. A linear time implementation of SPQR-trees. In J. Marks, editor, Graph Drawing, volume 1984 of Lecture Notes in Computer Science, pages 77--90. Springer Berlin \/ Heidelberg, 2001."},{"key":"e_1_3_2_1_8_1","volume-title":"Computer Architecture: A Quantitative Approach","author":"Hennessy J. L.","year":"1990","unstructured":"J. L. Hennessy and D. A. Patterson . Computer Architecture: A Quantitative Approach . Fifth edition, 1990 --2012. J. L. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach. Fifth edition, 1990--2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/362248.362272"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1137\/0202012"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/ICPADS.2011.101"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/IPDPS.2011.270"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/41287.41291"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/BF01191205"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/648246.753807"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1016\/0196-6774(82)90008-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1866739.1866757"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/1366230.1366240"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"acronym":"SPAA '12","name":"SPAA '12: 24th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Pittsburgh Pennsylvania USA"},"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.2312042","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2312005.2312042","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.2312042"}},"subtitle":["speedups for parallel graph triconnectivity"],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":18,"alternative-id":["10.1145\/2312005.2312042","10.1145\/2312005"],"URL":"https:\/\/doi.org\/10.1145\/2312005.2312042","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"}}]}}