{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:44Z","timestamp":1725663464262},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540518150"},{"type":"electronic","value":"9783540468158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51815-0_55","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:16:53Z","timestamp":1330204613000},"page":"214-225","source":"Crossref","is-referenced-by-count":1,"title":["Optimal parallel conflict-free access to extended binary trees"],"prefix":"10.1007","author":[{"given":"Reiner","family":"Creutzburg","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Andrews","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"20_CR1","unstructured":"Andrews, L.: On parallel isotropic conflict-free access to tree-like data structures. Diploma work, Humboldt-University Berlin, Dept. Mathematics, June 1989"},{"key":"20_CR2","volume-title":"Anatomy of LISP","author":"J. R. Allen","year":"1978","unstructured":"Allen, J. R.: Anatomy of LISP. McGraw-Hill: New York 1978"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1109\/TC.1968.229158","volume":"C-17","author":"G. H. Barnes","year":"1968","unstructured":"Barnes, G. H. et. al.: The ILLIAC IV computer. IEEE Trans. Comput. C-17 (1968), pp. 746\u2013757","journal-title":"IEEE Trans. Comput."},{"key":"20_CR4","first-page":"405","volume":"43","author":"K. E. Batcher","year":"1974","unstructured":"Batcher, K. E.: STARAN parallel processor system hardware. Proc. Fall Joint Computer Conf. AFIPS Conf., AFIPS Press, 43, 1974, pp. 405\u2013410","journal-title":"Proc. Fall Joint Computer Conf. AFIPS Conf., AFIPS Press"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"1566","DOI":"10.1109\/T-C.1971.223171","volume":"C-20","author":"P. Budnik","year":"1971","unstructured":"Budnik, P., and D. J. Kuck: The organization and use of parallel memories. IEEE Trans. Comput. C-20 (1971), pp. 1566\u20131569","journal-title":"IEEE Trans. Comput."},{"key":"20_CR6","first-page":"203","volume-title":"Parallel optimal subtree access with recursively linear memory function","author":"R. Creutzburg","year":"1987","unstructured":"Creutzburg, R.: Parallel optimal subtree access with recursively linear memory function. Proc. PARCELLA '86 Berlin, (Eds.: T. Legendi, D. Parkinson, R. Vollmar, G. Wolf) North-Holland: Amsterdam 1987, pp. 203\u2013209"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-18099-0_33","volume-title":"Parallel linear conflict-free subtree access","author":"R. Creutzburg","year":"1987","unstructured":"Creutzburg, R.: Parallel linear conflict-free subtree access. Proc. Internat. Workshop Parallel Algorithms Architectures (Suhl 1987), (Eds.: A. Albrecht, H. Jung, K. Mehlhorn) Lecture Notes in Computer Science 269 Springer: Berlin 1987, pp. 89\u201396"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Creutzburg, R.: Parallel conflict-free access to extended binary trees. Preprint, Berlin 1988","DOI":"10.1007\/3-540-51815-0_55"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-50647-0_115","volume-title":"Parallel conflict-free optimal access to complete extended q-ary trees","author":"R. Creutzburg","year":"1989","unstructured":"Creutzburg, R.: Parallel conflict-free optimal access to complete extended q-ary trees. Proc. PARCELLA '88 (Eds. G. Wolf, T. Legendi, U. Schendel), Lecture Notes in Computer Science 342, Springer: Berlin 1989, pp.248\u2013255."},{"key":"20_CR10","first-page":"515","volume-title":"Parallel memory with recursive address computation","author":"M. G\u0151ssel","year":"1984","unstructured":"G\u0151ssel, M., and B. Rebel: Parallel memory with recursive address computation. Proc. Int. Conf. Parallel Computing '83 Berlin, (Ed.: M. Feilmeier) Elsevier: Amsterdam 1984, pp. 515\u2013520"},{"key":"20_CR11","first-page":"49","volume-title":"Data structures and parallel memories","author":"M. G\u0151ssel","year":"1987","unstructured":"G\u0151ssel, M., and B. Rebel: Data structures and parallel memories. Proc. PARCELLA '86 Berlin, (Eds.: T. Legendi, D. Parkinson, R. Vollmar, G. Wolf) North-Holland: Amsterdam 1987, pp. 49\u201360"},{"key":"20_CR12","series-title":"Lect. Notes Comp. Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-18099-0_37","volume-title":"Memories for parallel subtree access","author":"M. G\u0151ssel","year":"1987","unstructured":"G\u0151ssel, M., and B. Rebel: Memories for parallel subtree access. Proc. Intern. Worksh. Parall. Algorithms Architect. (Suhl 1987), (Eds.: A. Albrecht, H. Jung, K. Mehlhorn) Lect. Notes Comp. Science 269, Springer: Berlin 1987, pp. 122\u2013130"},{"key":"20_CR13","volume-title":"Memory Architecture and Parallel Access","author":"M. G\u0151ssel","year":"1989","unstructured":"G\u0151ssel, M., B. Rebel, and R. Creutzburg: Memory Architecture and Parallel Access (in German). Akademie-Verlag: Berlin 1989 (English translation in preparation)"},{"key":"20_CR14","volume-title":"Parallel Computers","author":"R. W. Hockney","year":"1981","unstructured":"Hockney, R. W., and C. R. Jesshope: Parallel Computers. Hilger: Bristol 1981"},{"key":"20_CR15","volume-title":"Fundamentals of Data Structures","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., and S. Sahni: Fundamentals of Data Structures. Computer Science Press. Woodland Hills (Ca.) 1976"},{"key":"20_CR16","volume-title":"The Art of Computer Programming, Fundamental Algorithms","author":"D. E. Knuth","year":"1968","unstructured":"Knuth, D. E.: The Art of Computer Programming, Fundamental Algorithms. Addison-Wesley: Reading (MA) 1968"},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TC.1982.1676014","volume":"C-31","author":"D. J. Kuck","year":"1982","unstructured":"Kuck, D. J., and R. A. Stokes: The Burroughs scientific processor. IEEE Trans. Comput. C-31 (1982), pp. 363\u2013376","journal-title":"IEEE Trans. Comput."},{"key":"20_CR18","doi-asserted-by":"crossref","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 in an array processor. IEEE Trans. Comput. C-24 (1975), pp. 1145\u20131155","journal-title":"IEEE Trans. Comput."},{"key":"20_CR19","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/TC.1982.1676020","volume":"C-31","author":"D. H. Lawrie","year":"1982","unstructured":"Lawrie, D. H., and Ch. R. Vora: The prime memory system for array access. IEEE Trans. Comput. C-31 (1982), pp. 435\u2013442","journal-title":"IEEE Trans. Comput."},{"key":"20_CR20","unstructured":"Rebel, B., and M. G\u0151ssel: Ein paralleler Speicher. Report ZKI der AdW, Berlin, Nov. 1982"},{"key":"20_CR21","unstructured":"Shapiro, H. D.: Theoretical limitations on the use of parallel memories. Univ. Illinois, Dept. Comp. Sci., Rep. No. 75\u2013776 Dec. 1975"},{"key":"20_CR22","unstructured":"Shirakawa, H.: On a parallel memory to access trees. Memoirs of Research Institute of Science and Engineering of Ritsumeikan University Kyoto, Japan, No. 46 (1987), pp. 57\u201362 (same as unpublished report of 1984)"},{"key":"20_CR23","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TC.1985.5009402","volume":"C-34","author":"H. A. G. Wijshoff","year":"1985","unstructured":"Wijshoff, H. A. G., and J. van Leeuwen: The structure of periodic storage schemes for parallel memories. IEEE Trans. Comput. C-34 (1985), pp. 501\u2013505","journal-title":"IEEE Trans. Comput."},{"key":"20_CR24","first-page":"253","volume-title":"Storing trees into parallel memories","author":"H. A. G. Wijshoff","year":"1986","unstructured":"Wijshoff, H. A. G.: Storing trees into parallel memories. Proc. 1985 Int. Conf. Parallel Computing, (Eds.: M. Feilmeier, J. Joubert, U. Schendel) Elsevier: Amsterdam 1986, pp. 253\u2013261"},{"key":"20_CR25","volume-title":"Data organization in parallel computers","author":"H. A. G. Wijshoff","year":"1987","unstructured":"Wijshoff, H. A. G.: Data organization in parallel computers. Ph.D. Diss. (Rijksuniv. Utrecht, Netherlands) 1987"}],"container-title":["Lecture Notes in Computer Science","Recent Issues in Pattern Analysis and Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51815-0_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:22:58Z","timestamp":1605648178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51815-0_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540518150","9783540468158"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-51815-0_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}