"Finding shuffle words that represent optimal scheduling of shared memory ..."

Daniel Reidenbach, Markus L. Schmid (2013)

> Home

Details and statistics

DOI: 10.1080/00207160.2012.698007

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcm/ReidenbachS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcm/ReidenbachS13
Daniel Reidenbach, Markus L. Schmid:
Finding shuffle words that represent optimal scheduling of shared memory access. Int. J. Comput. Math. 90(6): 1292-1309 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.