{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T17:09:36Z","timestamp":1742404176745,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407881"},{"type":"electronic","value":"9783540452096"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45209-6_125","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T21:03:29Z","timestamp":1294434209000},"page":"911-916","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Negro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vittorio","family":"Scarano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnold L.","family":"Rosenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,6,1]]},"reference":[{"key":"125_CR1","doi-asserted-by":"crossref","unstructured":"Auletta, V., Das, S., De Vivo, A., Pinotti, M.C., Scarano, V.: Optimal tree access by elementary and composite templates in parallel memory systems. IEEE Trans. Parallel and Distr. Systs.\u00a013 (2002)","DOI":"10.1109\/71.995820"},{"key":"125_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jpdc.1998.1426","volume":"49","author":"V. Auletta","year":"1998","unstructured":"Auletta, V., De Vivo, A., Scarano, V.: Multiple Template Access of Trees in Parallel Memory Systems. J. Parallel and Distributed Computing\u00a049, 22\u201339 (1998)","journal-title":"J. Parallel and Distributed Computing"},{"key":"125_CR3","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1109\/T-C.1971.223171","volume":"C-20","author":"P. Budnik","year":"1971","unstructured":"Budnik, P., Kuck, D.J.: The organization and use of parallel memories. IEEE Trans Comput.\u00a0C-20, 1566\u20131569 (1971)","journal-title":"IEEE Trans Comput."},{"key":"125_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0743-7315(92)90116-5","volume":"14","author":"C.J. Colbourn","year":"1992","unstructured":"Colbourn, C.J., Heinrich, K.: Conflict-free access to parallel memories. J. Parallel and Distributed Computing\u00a014, 193\u2013200 (1992)","journal-title":"J. Parallel and Distributed Computing"},{"key":"125_CR5","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1137\/0604055","volume":"4","author":"F.R.K. Chung","year":"1983","unstructured":"Chung, F.R.K., Rosenberg, A.L., Snyder, L.: Perfect storage representations for families of data structures. SIAM J. Algebr. Discr. Meth.\u00a04, 548\u2013565 (1983)","journal-title":"SIAM J. Algebr. Discr. Meth."},{"key":"125_CR6","unstructured":"Creutzburg, R., Andrews, L.: Recent results on the parallel access to tree-like data structures \u2013 the isotropic approach. In: Proc. Intl. Conf. on Parallel Processing, vol.\u00a01, pp. 369\u2013372 (1991)"},{"key":"125_CR7","doi-asserted-by":"crossref","unstructured":"Das, S.K., Sarkar, F.: Conflict-free data access of arrays and trees in parallel memory systems. In: Proc. 6th IEEE Symp. on Parallel and Distributed Processing, pp. 377\u2013383 (1994)","DOI":"10.1109\/SPDP.1994.346145"},{"key":"125_CR8","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1109\/T-C.1975.224157","volume":"C-24","author":"D.H. Lawrie","year":"1975","unstructured":"Lawrie, D.H.: Access and alignment of data in an array processor. IEEE Trans. on Computers\u00a0C-24, 1145\u20131155 (1975)","journal-title":"IEEE Trans. on Computers"},{"key":"125_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/322169.322177","volume":"27","author":"R.J. Lipton","year":"1980","unstructured":"Lipton, R.J., Rosenberg, A.L., Yao, A.C.: External hashing schemes for collections of data structures. J. ACM\u00a027, 81\u201395 (1980)","journal-title":"J. ACM"},{"key":"125_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/71.219753","volume":"4","author":"K. Kim","year":"1993","unstructured":"Kim, K., Prasanna, V.K.: Latin Squares for parallel array access. IEEE Trans. Parallel and Distributed Systems\u00a04, 361\u2013370 (1993)","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"125_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/322003.322006","volume":"24","author":"A.L. Rosenberg","year":"1977","unstructured":"Rosenberg, A.L., Stockmeyer, L.J.: Hashing schemes for extendible arrays. J. ACM\u00a024, 199\u2013221 (1977)","journal-title":"J. ACM"},{"key":"125_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01683272","volume":"10","author":"A.L. Rosenberg","year":"1976","unstructured":"Rosenberg, A.L.: On storing ragged arrays by hashing. Math. Syst. Th.\u00a010, 193\u2013210 (1976\/1977)","journal-title":"Math. Syst. Th."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2003 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45209-6_125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:40:49Z","timestamp":1740840049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45209-6_125"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407881","9783540452096"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45209-6_125","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"1 June 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}