{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:09:54Z","timestamp":1742400594488},"reference-count":15,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1006\/jpdc.2002.1860","type":"journal-article","created":{"date-parts":[[2002,9,16]],"date-time":"2002-09-16T18:27:09Z","timestamp":1032200829000},"page":"1314-1333","source":"Crossref","is-referenced-by-count":18,"title":["Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees"],"prefix":"10.1006","volume":"62","author":[{"given":"Alan A.","family":"Bertossi","sequence":"first","affiliation":[]},{"given":"Cristina M.","family":"Pinotti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jpdc.2002.1860_RF1","first-page":"447","article-title":"Toward a universal mapping algorithm for accessing trees in parallel memory systems","author":"Auletta","year":"1998","journal-title":"Proceedings of IEEE International Parallel Processing Symposium"},{"key":"10.1006\/jpdc.2002.1860_RF2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1006\/jpdc.1998.1426","article-title":"Multiple template access of trees in parallel memory systems","volume":"49","author":"Auletta","year":"1998","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1006\/jpdc.2002.1860_RF3","first-page":"103","article-title":"On array storage for conflict-free memory access for parallel processors","volume":"1","author":"Balakrishnan","year":"1988","journal-title":"Proceedings of the International Conference on Parallel Processing"},{"key":"10.1006\/jpdc.2002.1860_RF4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/A:1019146910724","article-title":"Assigning codes in wireless networks: bounds and scaling properties","volume":"5","author":"Battiti","year":"1999","journal-title":"Wireless Networks"},{"key":"10.1006\/jpdc.2002.1860_RF5","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1109\/71.615440","article-title":"Accounting for memory bank contention and delay in high-bandwidth multiprocessors","volume":"8","author":"Blelloch","year":"1997","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1006\/jpdc.2002.1860_RF6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"22","author":"Br\u00e9laz","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1006\/jpdc.2002.1860_RF7","doi-asserted-by":"crossref","first-page":"1566","DOI":"10.1109\/T-C.1971.223171","article-title":"The organization and use of parallel memories","volume":"20","author":"Budnik","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.2002.1860_RF8","doi-asserted-by":"crossref","unstructured":"S. K. Das and M. C. Pinotti, Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access, inProceedings of the 5th International Workshop on Algorithms and Data Structures (WADS\u201997), Lecture Notes in Computer Science, Vol. 1272, Dehne, Rau-Chaplin, Sack, and Tamassia, Eds., Halifax, NS, pp. 272\u2013281, August 1997.","DOI":"10.1007\/3-540-63307-3_66"},{"key":"10.1006\/jpdc.2002.1860_RF9","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/71.506694","article-title":"Parallel priority queues in distributed memory hypercubes","volume":"7","author":"Das","year":"1996","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1006\/jpdc.2002.1860_RF10","first-page":"377","article-title":"Conflict-free data access of arrays and trees in parallel memory systems","author":"Das","year":"1994","journal-title":"Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing"},{"key":"10.1006\/jpdc.2002.1860_RF11","series-title":"Latin Squares and Their Applications","author":"Denes","year":"1974"},{"key":"10.1006\/jpdc.2002.1860_RF12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/71.219753","article-title":"Latin squares for parallel array access","volume":"4","author":"Kim","year":"1993","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1006\/jpdc.2002.1860_RF13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02592052","article-title":"Optimal approximation of sparse hessians and its equivalence to a graph coloring problem","volume":"26","author":"McCormick","year":"1983","journal-title":"Math. Programming"},{"key":"10.1006\/jpdc.2002.1860_RF14","first-page":"7","article-title":"Conflict-free template access in k-ary and binomial trees","author":"Pinotti","year":"1997","journal-title":"Proceedings of ACM-International Conference on Supercomputing"},{"key":"10.1006\/jpdc.2002.1860_RF15","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/TC.1978.1675122","article-title":"Theoretical limitations on the efficient use of parallel memories","volume":"27","author":"Shapiro","year":"1978","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731502918605?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731502918605?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T17:56:53Z","timestamp":1554832613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731502918605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0743731502918605"],"URL":"https:\/\/doi.org\/10.1006\/jpdc.2002.1860","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}