{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:52Z","timestamp":1725663832793},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540567318"},{"type":"electronic","value":"9783540476375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56731-3_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:28:29Z","timestamp":1330255709000},"page":"20-29","source":"Crossref","is-referenced-by-count":9,"title":["Hashing strategies for simulating shared memory on distributed memory machines"],"prefix":"10.1007","author":[{"given":"Friedhelm","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. of the 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 50\u201361, 1991.","DOI":"10.1145\/113379.113384"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sci., 18:143\u2013154, 1979.","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide. How to distribute a dictionary in a complete network. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 117\u2013127, 1990.","DOI":"10.1145\/100216.100229"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In M. S. Paterson, editor, Proceedings of 17th ICALP, pages 6\u201319. Springer, 1990. Lecture Notes in Computer Science 443.","DOI":"10.1007\/BFb0032018"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"A. Karlin and E. Upfal. Parallel hashing \u2014 an efficient implementation of shared memory. In Proc. of the 18th Ann. ACM Symp. on Theory of Computing, pages 160\u2013168, 1986.","DOI":"10.1145\/12130.12146"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"71","author":"C. P. Kruskal","year":"1990","unstructured":"C. P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoret. Comput. Sci., 71:95\u2013132, 1990.","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Y. Matias and U. Vishkin. Converting high probability into nearly-constant time \u2014 with applications to parallel hashing. In Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, pages 307\u2013316, 1991.","DOI":"10.1145\/103418.103453"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00264615","volume":"21","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339\u2013374, 1984.","journal-title":"Acta Informatica"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"A. G. Ranade. How to emulate shared memory. In Proc. of the 28th IEEE Ann. Symp. on Foundations of Computer Science, pages 185\u2013194, 1987.","DOI":"10.1109\/SFCS.1987.32"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"A. Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In Proc. of the 30th IEEE Ann. Symp. on Foundations of Computer Science, pages 20\u201325, 1989. Revised Version.","DOI":"10.1109\/SFCS.1989.63450"},{"issue":"3","key":"3_CR11","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/828.1892","volume":"31","author":"E. Upfal","year":"1984","unstructured":"E. Upfal. Efficient schemes for parallel communication. J. Assoc. Comput. Mach., 31(3):507\u2013517, 1984.","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR12","first-page":"943","volume-title":"Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity","author":"L. G. Valiant","year":"1990","unstructured":"L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, chapter 18, pages 943\u2013971. Elsevier, Amsterdam, 1990."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"T. Hagerup. The log-star revolution, proceedings. STACS 92, LNCS 577, pages 259\u2013280, 1992.","DOI":"10.1007\/3-540-55210-3_189"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"A. Karlin, E. Upfal. Parallel Hashing, an efficient implementation of shared memory. Proc. 18th ACM STOC, pages 160\u2013168, 1986.","DOI":"10.1145\/12130.12146"},{"key":"3_CR15","volume-title":"Introduction to parallel algorithms and architectures: arrays, trees, hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton. Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann Publishers, San Mateo, 1992."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"F. T. Leighton. Methods for packet routing in parallel machines. Proc. 24th ACM STOC, pages 77\u201396, 1992.","DOI":"10.1145\/129712.129721"},{"issue":"8","key":"3_CR17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. Valiant","year":"1990","unstructured":"L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8), pages 103\u2013111, 1990.","journal-title":"Communications of the ACM"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R. E. Tarjan. Dynamic perfect hashing, upper and lower bounds. Proc. 29th IEEE FOCS, pages 524\u2013531, 1988, extended version appears in SIAM J. Comp.","DOI":"10.1109\/SFCS.1988.21968"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"R. Karp, M. Luby, F. Meyer auf der Heide. Efficient PRAM simulation on distributed memory machine. Proc. 24th ACM STOC, pages 318\u2013326, 1992.","DOI":"10.1145\/129712.129743"},{"issue":"4","key":"3_CR20","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole. Parallel merge sort. SIAM J. Comp. 17(4), pages 770\u2013785, 1988.","journal-title":"SIAM J. Comp."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"J. Reif. An optimal parallel algorithm for integer sorting. Proc. 26th IEEE-FOCS, pages 496\u2013504, 1985.","DOI":"10.1109\/SFCS.1985.9"},{"key":"3_CR22","unstructured":"R. A. Wagner, Y. Han. Parallel algorithms for bucket sorting and the data dependent prefix problem. Proc. Int. Conf. on Parallel Processing, Illinois, pages 924\u2013930, 1986."},{"key":"3_CR23","volume-title":"Tech. Rep. CRI 88-14","author":"R. J. Anderson","year":"1988","unstructured":"R. J. Anderson, G. L. Miller. Optical communication for pointer based algorithms. Tech. Rep. CRI 88-14, Comp. Sci. Dpt, Univ. of Southern California, Los Angeles, 1988."},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/7531.7926","volume":"34","author":"E. Upfal","year":"1987","unstructured":"E. Upfal, A. Wigderson. How to share memory in a distributed system. J. ACM 34, pages 116\u2013127, 1987.","journal-title":"J. ACM"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, F. Meyer auf der Heide. Simple, efficient shared memory simulations, preprint 1992.","DOI":"10.1145\/165231.165246"}],"container-title":["Lecture Notes in Computer Science","Parallel Architectures and Their Efficient Use"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56731-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:29Z","timestamp":1605647129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56731-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540567318","9783540476375"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-56731-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}