{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T10:10:11Z","timestamp":1734257411568,"version":"3.30.2"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2001,6,18]]},"DOI":"10.1145\/379539.379559","type":"proceedings-article","created":{"date-parts":[[2004,2,3]],"date-time":"2004-02-03T17:50:25Z","timestamp":1075830625000},"page":"24-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Language support for Morton-order matrices"],"prefix":"10.1145","author":[{"given":"David S.","family":"Wise","sequence":"first","affiliation":[{"name":"Computer Science Dept., Indiana University, Bloomington, IN"}]},{"given":"Jeremy D.","family":"Frens","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Calvin College, Grand Rapids, MI and Indiana University"}]},{"given":"Yuhong","family":"Gu","sequence":"additional","affiliation":[{"name":"Oracle Corporation, One Oracle Drive, Nashua, NH and Indiana University"}]},{"given":"Gregory A.","family":"Alexander","sequence":"additional","affiliation":[{"name":"Computer Science Dept., Indiana University, Bloomington, IN"}]}],"member":"320","published-online":{"date-parts":[[2001,6,18]]},"reference":[{"key":"e_1_3_2_1_1_2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-44520-X_48","volume-title":"A. Bode, T. Ludwig, W. Karl, and R. Wism. uller","author":"Ahmed N.","year":"2000","unstructured":"N. Ahmed and K. Pingali . Automatic generation of block-recursive codes . In A. Bode, T. Ludwig, W. Karl, and R. Wism. uller , editors, EURO-PAR 2000 Parallel Processing, volume 1900 of Lecture Notes in Computer Science , pages 368 - 378 , Heidelberg, 2000. Springer . http:\/\/link.springer.de\/link\/service\/series\/0558\/bibs\/1900\/19000368.htm]] N. Ahmed and K. Pingali. Automatic generation of block-recursive codes. In A. Bode, T. Ludwig, W. Karl, and R. Wism. uller, editors, EURO-PAR 2000 Parallel Processing, volume 1900 of Lecture Notes in Computer Science, pages 368-378, Heidelberg, 2000. Springer. http:\/\/link.springer.de\/link\/service\/series\/0558\/bibs\/1900\/19000368.htm]]"},{"key":"e_1_3_2_1_2_2","first-page":"79","volume-title":"Program Flow Analysis: Theory and Applications","author":"Allen F. E.","year":"1981","unstructured":"F. E. Allen , J. Cocke , and K. Kennedy . Reduction of operator strength . In S. W. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications , chapter 3.2, pages 79 - 101 . Prentice-Hall , Englewood Cliffs, NJ , 1981 .]] F. E. Allen, J. Cocke, and K. Kennedy. Reduction of operator strength. In S. W. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 3.2, pages 79-101. Prentice-Hall, Englewood Cliffs, NJ, 1981.]]"},{"key":"e_1_3_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/960118.808380"},{"key":"e_1_3_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/263580.263662"},{"key":"e_1_3_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321996"},{"key":"e_1_3_2_1_6_2","first-page":"170","article-title":"Real-time raster-to-quadtree and quadtree-to-raster conversion algorithms with modest storage requirements","volume":"4","author":"Burton F. W.","year":"1986","unstructured":"F. W. Burton , V. J. Kollias , and J. G. Kollias . Real-time raster-to-quadtree and quadtree-to-raster conversion algorithms with modest storage requirements . Angew. Informatik , 4 : 170 - 174 , 1986 .]] F. W. Burton, V. J. Kollias, and J. G. Kollias. Real-time raster-to-quadtree and quadtree-to-raster conversion algorithms with modest storage requirements. Angew. Informatik, 4:170-174, 1986.]]","journal-title":"Angew. Informatik"},{"key":"e_1_3_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/305138.305231"},{"key":"e_1_3_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/305619.305645"},{"issue":"4","key":"e_1_3_2_1_9_2","first-page":"3","article-title":"A historical note on binary tree","volume":"18","author":"Cragon H. G.","year":"1990","unstructured":"H. G. Cragon . A historical note on binary tree . SIGARCH Comput. Archit. News , 18 ( 4 ): 3 , Dec. 1990 .]] H. G. Cragon. A historical note on binary tree. SIGARCH Comput. Archit. News, 18(4):3, Dec. 1990.]]","journal-title":"SIGARCH Comput. Archit. News"},{"key":"e_1_3_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/240455.240477"},{"key":"e_1_3_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/846234.849354"},{"key":"e_1_3_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/42288.42291"},{"key":"e_1_3_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.444.0605"},{"key":"e_1_3_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/359131.359134"},{"key":"e_1_3_2_1_15_2","volume-title":"Benjamin\/Cummings","author":"Fraser C. W.","year":"1995","unstructured":"C. W. Fraser and D. R. Hanson . A Retargetable C Compiler : Design and Implementation . Benjamin\/Cummings , Redwood City, CA , 1995 .]] C. W. Fraser and D. R. Hanson. A Retargetable C Compiler : Design and Implementation. Benjamin\/Cummings, Redwood City, CA, 1995.]]"},{"key":"e_1_3_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/263764.263789"},{"key":"e_1_3_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/358728.358741"},{"key":"e_1_3_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380250902"},{"key":"e_1_3_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.416.0737"},{"key":"e_1_3_2_1_21_2","volume-title":"9th SIAM Conf. on Parallel Processing for Scientific Computing","volume":"98","author":"Im E.-J.","year":"1999","unstructured":"E.-J. Im and K. Yelick . Optimizing sparse matrix vector multimplication on SMPs . In 9th SIAM Conf. on Parallel Processing for Scientific Computing , volume 98 of Proc. in Applied Mathematics , Mar. 1999 . http:\/\/www.siam.org\/catalog\/mcc07\/pr98.htm]] E.-J. Im and K. Yelick. Optimizing sparse matrix vector multimplication on SMPs. In 9th SIAM Conf. on Parallel Processing for Scientific Computing, volume 98 of Proc. in Applied Mathematics, Mar. 1999. http:\/\/www.siam.org\/catalog\/mcc07\/pr98.htm]]"},{"key":"e_1_3_2_1_22_2","series-title":"The Art of Computer Programming","volume-title":"Fundamental Algorithms","author":"Knuth D. E.","year":"1997","unstructured":"D. E. Knuth . Fundamental Algorithms , volume 1 of The Art of Computer Programming . Addison-Wesley , Reading, MA , third edition, 1997 .]] D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, Reading, MA, third edition, 1997.]]"},{"key":"e_1_3_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/258915.258946"},{"key":"e_1_3_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379007"},{"key":"e_1_3_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/362875.362879"},{"key":"e_1_3_2_1_26_2","volume-title":"A computer oriented geodetic data base and a new technique in file sequencing. Technical report","author":"Morton G. M.","year":"1966","unstructured":"G. M. Morton . A computer oriented geodetic data base and a new technique in file sequencing. Technical report , IBM Ltd ., Ottawa, Ontario, Mar. 1, 1966 .]] G. M. Morton. A computer oriented geodetic data base and a new technique in file sequencing. Technical report, IBM Ltd., Ottawa, Ontario, Mar. 1, 1966.]]"},{"key":"e_1_3_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/213859.214804"},{"key":"e_1_3_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/588011.588037"},{"key":"e_1_3_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01199438"},{"key":"e_1_3_2_1_30_2","volume-title":"section 2.7","author":"Samet H.","year":"1990","unstructured":"H. Samet . The Design and Analysis of Spatial Data Structures , section 2.7 . Addison-Wesley , Reading, MA , 1990 .]] H. Samet. The Design and Analysis of Spatial Data Structures, section 2.7. Addison-Wesley, Reading, MA, 1990.]]"},{"key":"e_1_3_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/1049-9660(92)90022-U"},{"issue":"1","key":"e_1_3_2_1_32_2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1111\/j.2517-6161.1954.tb00146.x","article-title":"The application of automatic computers to sampling experiments","volume":"16","author":"Tocher K. D.","year":"1954","unstructured":"K. D. Tocher . The application of automatic computers to sampling experiments . J. Roy. Statist. Soc. Ser. B , 16 ( 1 ): 39 - 61 , 1954 . See pp. 53-55.]] K. D. Tocher. The application of automatic computers to sampling experiments. J. Roy. Statist. Soc. Ser. B, 16(1):39-61, 1954. See pp. 53-55.]]","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"e_1_3_2_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/169627.169640"},{"key":"e_1_3_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.5555\/509058.509096"},{"key":"e_1_3_2_1_35_2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1007\/3-540-44520-X_108","volume-title":"A. Bode, T. Ludwig, W. Karl, and R. Wism. uller","author":"Wise D. S.","year":"2000","unstructured":"D. S. Wise . Ahnentafel indexing into Morton-ordered arrays , or matrix locality for free . In A. Bode, T. Ludwig, W. Karl, and R. Wism. uller , editors, Euro-Par 2000 - Parallel Processing, volume 1900 of Lecture Notes in Computer Science , pages 774 - 883 , Heidelberg, 2000. Springer . http:\/\/link.springer.de\/link\/service\/series\/0558\/bibs\/1900\/19000774.htm]] D. S. Wise. Ahnentafel indexing into Morton-ordered arrays, or matrix locality for free. In A. Bode, T. Ludwig, W. Karl, and R. Wism. uller, editors, Euro-Par 2000 - Parallel Processing, volume 1900 of Lecture Notes in Computer Science, pages 774-883, Heidelberg, 2000. Springer. http:\/\/link.springer.de\/link\/service\/series\/0558\/bibs\/1900\/19000774.htm]]"},{"key":"e_1_3_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349323"}],"event":{"name":"PPoPP01: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Snowbird Utah USA","acronym":"PPoPP01"},"container-title":["Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/379539.379559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T03:07:24Z","timestamp":1734232044000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/379539.379559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6,18]]},"references-count":36,"alternative-id":["10.1145\/379539.379559","10.1145\/379539"],"URL":"https:\/\/doi.org\/10.1145\/379539.379559","relation":{},"subject":[],"published":{"date-parts":[[2001,6,18]]},"assertion":[{"value":"2001-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}