{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:02Z","timestamp":1750307402658,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"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":[[2010,6,13]]},"DOI":"10.1145\/1810479.1810496","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"79-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Brief announcement"],"prefix":"10.1145","author":[{"given":"Laura","family":"Grigori","sequence":"first","affiliation":[{"name":"INRIA Saclay-Ile de France, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Yves","family":"David","sequence":"additional","affiliation":[{"name":"INRIA Saclay-Ile de France, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James W.","family":"Demmel","sequence":"additional","affiliation":[{"name":"Departments of Mathematics and CS, University of California Berkeley, Berkeley, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Peyronnet","sequence":"additional","affiliation":[{"name":"LRI, Universit\u00e9 Paris-Sud 11, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"368","volume-title":"Euro-Par, 2000","author":"Ahmed N.","year":"2000","unstructured":"N. Ahmed and K. Pingali . Automatic generation of block-recursive codes. In Springer-Verlag, editor , Euro-Par, 2000 , page. 368 -- 378 , 2000 . N. Ahmed and K. Pingali. Automatic generation of block-recursive codes. In Springer-Verlag, editor, Euro-Par, 2000, page. 368--378, 2000."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584054"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-141050-6.50010-6"},{"key":"e_1_3_2_1_6_1","series-title":"SIAM Journal on Numerical Analysis}, 10:345--363","volume-title":"Nested dissection of a regular finite element mesh","author":"George A.","year":"1973","unstructured":"A. George . Nested dissection of a regular finite element mesh . SIAM Journal on Numerical Analysis}, 10:345--363 , 1973 .. A. George. Nested dissection of a regular finite element mesh. SIAM Journal on Numerical Analysis}, 10:345--363, 1973.."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(89)90101-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413400"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.598277"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0716027"}],"event":{"name":"SPAA 10: 22nd 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":"Thira Santorini Greece","acronym":"SPAA 10"},"container-title":["Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810479.1810496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:24Z","timestamp":1750246764000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810496"}},"subtitle":["Lower bounds on communication for sparse Cholesky factorization of a model problem"],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":10,"alternative-id":["10.1145\/1810479.1810496","10.1145\/1810479"],"URL":"https:\/\/doi.org\/10.1145\/1810479.1810496","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}