%0 Journal Article %1 journals/ijcm/ReidenbachS13 %A Reidenbach, Daniel %A Schmid, Markus L. %D 2013 %J Int. J. Comput. Math. %K dblp %N 6 %P 1292-1309 %T Finding shuffle words that represent optimal scheduling of shared memory access. %U http://dblp.uni-trier.de/db/journals/ijcm/ijcm90.html#ReidenbachS13 %V 90

@article{journals/ijcm/ReidenbachS13, added-at = {2013-06-27T00:00:00.000+0200}, author = {Reidenbach, Daniel and Schmid, Markus L.}, biburl = {https://www.bibsonomy.org/bibtex/24f2b3ce2d46a3d22c2345dc3f97329b8/dblp}, ee = {http://dx.doi.org/10.1080/00207160.2012.698007}, interhash = {d2cab9e0cb143dcb70343dbe789f3955}, intrahash = {4f2b3ce2d46a3d22c2345dc3f97329b8}, journal = {Int. J. Comput. Math.}, keywords = {dblp}, number = 6, pages = {1292-1309}, timestamp = {2013-08-13T14:34:30.000+0200}, title = {Finding shuffle words that represent optimal scheduling of shared memory access.}, url = {http://dblp.uni-trier.de/db/journals/ijcm/ijcm90.html#ReidenbachS13}, volume = 90, year = 2013 }