{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:03:39Z","timestamp":1773324219658,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T00:00:00Z","timestamp":1129075200000},"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":[[2005,10,12]]},"DOI":"10.1145\/1094811.1094844","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T12:34:39Z","timestamp":1131366879000},"page":"423-437","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Lifting sequential graph algorithms for distributed-memory parallel computation"],"prefix":"10.1145","author":[{"given":"Douglas","family":"Gregor","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN"}]},{"given":"Andrew","family":"Lumsdaine","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN"}]}],"member":"320","published-online":{"date-parts":[[2005,10,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Int. Wkshp on Adv. Compiler Technology for High Perf. and Embedded Processors, page","author":"An P.","year":"2001","unstructured":"P. An , A. Jula , S. Rus , S. Saunders , T. Smith , G. Tanase , N. Thomas , N. Amato , and L. Rauchwerger . STAPL: A standard template adaptive parallel C++ library . In Int. Wkshp on Adv. Compiler Technology for High Perf. and Embedded Processors, page 10, July 2001 .]] P. An, A. Jula, S. Rus, S. Saunders, T. Smith, G. Tanase, N. Thomas, N. Amato, and L. Rauchwerger. STAPL: A standard template adaptive parallel C++ library. In Int. Wkshp on Adv. Compiler Technology for High Perf. and Embedded Processors, page 10, July 2001.]]"},{"key":"e_1_3_2_1_3_1","unstructured":"Erik G. Boman Doruk Bozdag Umit Catalyurek Assefaw H. Gebremedhin and Fredrik Manne. A scalable parallel graph coloring algorithm for distributed memory computers. Preprint.]]  Erik G. Boman Doruk Bozdag Umit Catalyurek Assefaw H. Gebremedhin and Fredrik Manne. A scalable parallel graph coloring algorithm for distributed memory computers. Preprint.]]"},{"key":"e_1_3_2_1_4_1","unstructured":"Boost. Boost C++ Libraries. http:\/\/www.boost.org\/.]]  Boost. Boost C++ Libraries. http:\/\/www.boost.org\/.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0723039"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.842947"},{"key":"e_1_3_2_1_7_1","first-page":"117","volume-title":"PVM\/MPI","author":"Chan Albert","year":"2003","unstructured":"Albert Chan and Frank Dehne . CGMgraph\/CGMlib : Implementing and testing CGM graph algorithms on PC clusters . In PVM\/MPI , pages 117 -- 125 , 2003 .]] Albert Chan and Frank Dehne. CGMgraph\/CGMlib: Implementing and testing CGM graph algorithms on PC clusters. In PVM\/MPI, pages 117--125, 2003.]]"},{"key":"e_1_3_2_1_8_1","unstructured":"Albert Chan and Frank Dehne. cgmLIB: A library for coarse-grained parallel computing. http:\/\/lib.cgmlab.org\/ 2004 December.]]  Albert Chan and Frank Dehne. cgmLIB: A library for coarse-grained parallel computing. http:\/\/lib.cgmlab.org\/ 2004 December.]]"},{"key":"e_1_3_2_1_9_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1007\/BFb0055823","volume-title":"Mathematical Foundations of Computer Science (MFCS)","author":"Crauser Andreas","year":"1998","unstructured":"Andreas Crauser , Kurt Mehlhorn , Ulrich Meyer , and Peter Sanders . A parallelization of dijkstra's shortest path algorithm . In Lubos Brim, Jozef Gruska, and Jir\u00ed Zlatuska, editors, Mathematical Foundations of Computer Science (MFCS) , volume 1450 of Lecture Notes in Computer Science , pages 722 -- 731 . Springer , 1998 .]] Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders. A parallelization of dijkstra's shortest path algorithm. In Lubos Brim, Jozef Gruska, and Jir\u00ed Zlatuska, editors, Mathematical Foundations of Computer Science (MFCS), volume 1450 of Lecture Notes in Computer Science, pages 722--731. Springer, 1998.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161154"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/829523.830957"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5712.001.0001"},{"key":"e_1_3_2_1_13_1","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1090\/dimacs\/030\/03","volume-title":"Parallel Algorithms","author":"Goddard Steve","year":"1997","unstructured":"Steve Goddard , Subodh Kumar , and Jan F. Prins . Connected components algorithms for mesh connected parallel computers . In Sandeep N. Bhatt, editor, Parallel Algorithms , volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science , pages 43 -- 58 . American Mathematical Society , 1997 .]] Steve Goddard, Subodh Kumar, and Jan F. Prins. Connected components algorithms for mesh connected parallel computers. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 43--58. American Mathematical Society, 1997.]]"},{"key":"e_1_3_2_1_14_1","volume-title":"Introduction to Parallel Computing","author":"Grama Ananth","year":"2003","unstructured":"Ananth Grama , Anshul Gupta , George Karypis , and Vipin Kumar . Introduction to Parallel Computing , Second Edition. Addison-Wesley , 2003 .]] Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar. Introduction to Parallel Computing, Second Edition. Addison-Wesley, 2003.]]"},{"key":"e_1_3_2_1_15_1","volume-title":"Argonne National Laboratory","author":"Gropp W. D.","year":"1994","unstructured":"W. D. Gropp and B. Smith . PETSc: Portable extensible tools for scientific computation. Technical report , Argonne National Laboratory , Argonne, IL , 1994 .]] W. D. Gropp and B. Smith. PETSc: Portable extensible tools for scientific computation. Technical report, Argonne National Laboratory, Argonne, IL, 1994.]]"},{"key":"e_1_3_2_1_16_1","volume-title":"http:\/\/pargraph.sourceforge.net\/","author":"Hielscher Florian","year":"2004","unstructured":"Florian Hielscher and Peter Gottschling . ParGraph. http:\/\/pargraph.sourceforge.net\/ , 2004 .]] Florian Hielscher and Peter Gottschling. ParGraph. http:\/\/pargraph.sourceforge.net\/, 2004.]]"},{"key":"e_1_3_2_1_17_1","volume-title":"Journal of Object Oriented Programming","author":"J\u00e9z\u00e9quel J.-M.","year":"1993","unstructured":"J.-M. J\u00e9z\u00e9quel . EPEE : an Eiffel environment to program distributed memory parallel computers . Journal of Object Oriented Programming , 1993 .]] J.-M. J\u00e9z\u00e9quel. EPEE: an Eiffel environment to program distributed memory parallel computers. Journal of Object Oriented Programming, 1993.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"J.-M.\n      J\u00e9z\u00e9quel\n    .\n  Transparent parallelisation through reuse: Between a compiler and a library approach\n  . In O. M. Nierstrasz editor ECOOP'93 proceedings number 707 in \n  Lecture Notes in Computer Science pages \n  384\n  --\n  405\n  . \n  Springer Verlag July \n  1993\n  .]]   J.-M. J\u00e9z\u00e9quel. Transparent parallelisation through reuse: Between a compiler and a library approach. In O. M. Nierstrasz editor ECOOP'93 proceedings number 707 in Lecture Notes in Computer Science pages 384--405. Springer Verlag July 1993.]]","DOI":"10.1007\/3-540-47910-4_20"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/140901.141917"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/263580.263614"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2172\/826910"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/583810.583823"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320428"},{"key":"e_1_3_2_1_24_1","first-page":"96","volume-title":"Languages and Compilers for Parallel Computing","author":"Lin Calvin","year":"1993","unstructured":"Calvin Lin and Lawrence Snyder . ZPL : An array sublanguage. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors , Languages and Compilers for Parallel Computing , pages 96 -- 114 , 1993 . ftp:\/\/ftp.cs.washington.edu\/pub\/orca\/papers\/lcpc93.ps.]] Calvin Lin and Lawrence Snyder. ZPL: An array sublanguage. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing, pages 96--114, 1993. ftp:\/\/ftp.cs.washington.edu\/pub\/orca\/papers\/lcpc93.ps.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/169627.169855"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/647908.740136"},{"key":"e_1_3_2_1_27_1","series-title":"Lecture Notes in Computer Science","first-page":"13","volume-title":"P. (Patrizia) Gianni","author":"Musser David R.","year":"1988","unstructured":"David R. Musser and Alexander A. Stepanov . Generic programming . In P. (Patrizia) Gianni , editor, Symbolic and algebraic computation: ISSAC '88, Rome, Italy, July 4--8, 1988 : Proceedings, volume 358 of Lecture Notes in Computer Science , pages 13 -- 25 , Berlin, 1989. Springer Verlag .]] David R. Musser and Alexander A. Stepanov. Generic programming. In P. (Patrizia) Gianni, editor, Symbolic and algebraic computation: ISSAC '88, Rome, Italy, July 4--8, 1988: Proceedings, volume 358 of Lecture Notes in Computer Science, pages 13--25, Berlin, 1989. Springer Verlag.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626402000963"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2000.892042"},{"key":"e_1_3_2_1_30_1","volume-title":"The Boost Graph Library: User Guide and Reference Manual","author":"Siek Jeremy","year":"2002","unstructured":"Jeremy Siek , Lie-Quan Lee , and Andrew Lumsdaine . The Boost Graph Library: User Guide and Reference Manual . Addison-Wesley , 2002 .]] Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, 2002.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/646894.709706"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing (OO'98)","author":"Siek Jeremy","year":"1998","unstructured":"Jeremy Siek , Andrew Lumsdaine , and Lie-Quan Lee . Generic programming for high performance numerical linear algebra . In Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing (OO'98) . SIAM Press , 1998 .]] Jeremy Siek, Andrew Lumsdaine, and Lie-Quan Lee. Generic programming for high performance numerical linear algebra. In Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing (OO'98). SIAM Press, 1998.]]"},{"key":"e_1_3_2_1_33_1","volume-title":"Boost","author":"Siek Jeremy","year":"2001","unstructured":"Jeremy Siek , Andrew Lumsdaine , and Lie-Quan Lee . Boost Graph Library . Boost , 2001 . http:\/\/www.boost.org\/libs\/graph\/doc\/index.html.]] Jeremy Siek, Andrew Lumsdaine, and Lie-Quan Lee. Boost Graph Library. Boost, 2001. http:\/\/www.boost.org\/libs\/graph\/doc\/index.html.]]"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00273-3"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"}],"event":{"name":"OOPSLA05: ACM SIGPLAN Object Oriented Programming Systems and Applications Conference","location":"San Diego CA USA","acronym":"OOPSLA05","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1094811.1094844","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1094811.1094844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:09Z","timestamp":1750248489000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1094811.1094844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,12]]},"references-count":34,"alternative-id":["10.1145\/1094811.1094844","10.1145\/1094811"],"URL":"https:\/\/doi.org\/10.1145\/1094811.1094844","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1103845.1094844","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2005,10,12]]},"assertion":[{"value":"2005-10-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}