Sparse Matrix Code Dependence Analysis Simplification at Compile Time. Mohammadi, M. S., Cheshmi, K., Gopalakrishnan, G., Hall, M. W., Dehnavi, M. M., Venkat, A., Yuki, T., & Strout, M. M. CoRR, 2018. Paper bibtex @article{DBLP:journals/corr/abs-1807-10852,
author = {Mahdi Soltan Mohammadi and
Kazem Cheshmi and
Ganesh Gopalakrishnan and
Mary W. Hall and
Maryam Mehri Dehnavi and
Anand Venkat and
Tomofumi Yuki and
Michelle Mills Strout},
title = {Sparse Matrix Code Dependence Analysis Simplification at Compile Time},
journal = {CoRR},
volume = {abs/1807.10852},
year = {2018},
url = {http://arxiv.org/abs/1807.10852},
eprinttype = {arXiv},
eprint = {1807.10852},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-10852.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"sQE2LiuaA9RGHaYh8","bibbaseid":"mohammadi-cheshmi-gopalakrishnan-hall-dehnavi-venkat-yuki-strout-sparsematrixcodedependenceanalysissimplificationatcompiletime-2018","author_short":["Mohammadi, M. S.","Cheshmi, K.","Gopalakrishnan, G.","Hall, M. W.","Dehnavi, M. M.","Venkat, A.","Yuki, T.","Strout, M. M."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Mahdi","Soltan"],"propositions":[],"lastnames":["Mohammadi"],"suffixes":[]},{"firstnames":["Kazem"],"propositions":[],"lastnames":["Cheshmi"],"suffixes":[]},{"firstnames":["Ganesh"],"propositions":[],"lastnames":["Gopalakrishnan"],"suffixes":[]},{"firstnames":["Mary","W."],"propositions":[],"lastnames":["Hall"],"suffixes":[]},{"firstnames":["Maryam","Mehri"],"propositions":[],"lastnames":["Dehnavi"],"suffixes":[]},{"firstnames":["Anand"],"propositions":[],"lastnames":["Venkat"],"suffixes":[]},{"firstnames":["Tomofumi"],"propositions":[],"lastnames":["Yuki"],"suffixes":[]},{"firstnames":["Michelle","Mills"],"propositions":[],"lastnames":["Strout"],"suffixes":[]}],"title":"Sparse Matrix Code Dependence Analysis Simplification at Compile Time","journal":"CoRR","volume":"abs/1807.10852","year":"2018","url":"http://arxiv.org/abs/1807.10852","eprinttype":"arXiv","eprint":"1807.10852","timestamp":"Mon, 13 Aug 2018 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/corr/abs-1807-10852.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/abs-1807-10852,\n author = {Mahdi Soltan Mohammadi and\n Kazem Cheshmi and\n Ganesh Gopalakrishnan and\n Mary W. Hall and\n Maryam Mehri Dehnavi and\n Anand Venkat and\n Tomofumi Yuki and\n Michelle Mills Strout},\n title = {Sparse Matrix Code Dependence Analysis Simplification at Compile Time},\n journal = {CoRR},\n volume = {abs/1807.10852},\n year = {2018},\n url = {http://arxiv.org/abs/1807.10852},\n eprinttype = {arXiv},\n eprint = {1807.10852},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1807-10852.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n","author_short":["Mohammadi, M. S.","Cheshmi, K.","Gopalakrishnan, G.","Hall, M. W.","Dehnavi, M. M.","Venkat, A.","Yuki, T.","Strout, M. M."],"key":"DBLP:journals/corr/abs-1807-10852","id":"DBLP:journals/corr/abs-1807-10852","bibbaseid":"mohammadi-cheshmi-gopalakrishnan-hall-dehnavi-venkat-yuki-strout-sparsematrixcodedependenceanalysissimplificationatcompiletime-2018","role":"author","urls":{"Paper":"http://arxiv.org/abs/1807.10852"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pers/hb1/d/Dehnavi:Maryam_Mehri.bib","dataSources":["o9NQnSjJdq5w765mL","zK49W9hMQ7z5fbpcq"],"keywords":[],"search_terms":["sparse","matrix","code","dependence","analysis","simplification","compile","time","mohammadi","cheshmi","gopalakrishnan","hall","dehnavi","venkat","yuki","strout"],"title":"Sparse Matrix Code Dependence Analysis Simplification at Compile Time","year":2018}