@article{https://doi.org/10.48550/arxiv.0710.4807,<br/><span class="tab"></span>
  doi = {10.48550/ARXIV.0710.4807},<br/><span class="tab"></span>
  url = {https://arxiv.org/abs/0710.4807},<br/><span class="tab"></span>
  author = {Chen,<br/><span class="tab"></span> G. and Kandemir,<br/><span class="tab"></span> M. and Karakoy,<br/><span class="tab"></span> M.},<br/><span class="tab"></span>
  keywords = {Programming Languages (cs.PL),<br/><span class="tab"></span> FOS: Computer and information sciences,<br/><span class="tab"></span> FOS: Computer and information sciences},<br/><span class="tab"></span>
  title = {A Constraint Network Based Approach to Memory Layout Optimization},<br/><span class="tab"></span>
  publisher = {arXiv},<br/><span class="tab"></span>
  year = {2007},<br/><span class="tab"></span>
  copyright = {Assumed arXiv.org perpetual,<br/><span class="tab"></span> non-exclusive license to distribute this article for submissions made before January 2004}
}