{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:16Z","timestamp":1742617156643,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/3-540-58201-0_72","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:33:20Z","timestamp":1330270400000},"page":"239-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simple fast parallel hashing"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Gil","sequence":"first","affiliation":[]},{"given":"Yossi","family":"Matias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"H. Bast and T. Hagerup. Fast and reliable parallel hashing. In 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 50\u201361, July 1991.","DOI":"10.1145\/113379.113384"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. J. Carter","year":"1979","unstructured":"L. J. 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":"20_CR3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0885-064X(89)90015-0","volume":"5","author":"B. Chor","year":"1989","unstructured":"B. Chor and O. Goldreich. On the power of two-point based sampling. Journal of Complexity, 5:96\u2013106, 1989.","journal-title":"Journal of Complexity"},{"key":"20_CR4","first-page":"235","volume":"623","author":"M. Dietzfelbinger","year":"1992","unstructured":"M. Dietzfelbinger, J. Gil, Y. Matias, and N. Pippenger. Polynomial hash functions are reliable. In Proc. of 19th International Colloquium on Automata Languages and Programming, Springer LNCS 623, pages 235\u2013246, July 1992.","journal-title":"Springer LNCS"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, A. R. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. In Proc. of the 29th IEEE Annual Symp. on Foundation of Computer Science, pages 524\u2013531, 1988. To appear in SIAM J. Comput.","DOI":"10.1109\/SFCS.1988.21968"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide. An optimal parallel dictionary. In 1st Annual ACM Symposium on Parallel Algorithms and Architectures, pages 360\u2013368, 1989.","DOI":"10.1145\/72935.72974"},{"key":"20_CR7","first-page":"6","volume":"443","author":"M. Dietzfelbinger","year":"1990","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Proc. of 17th International Colloquium on Automata Languages and Programming, Springer LNCS 443, pages 6\u201319, 1990.","journal-title":"Springer LNCS"},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","volume":"17","author":"F. E. Fich","year":"1988","unstructured":"F. E. Fich, P. L. Ragde, and A. Wigderson. Relations between concurrent-write models of parallel computation. SIAM J. Comput., 17:606\u2013627, June 1988.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"20_CR9","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"M. L. Fredman, J. Koml\u00f3s, and E. Szemer\u00e9di. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538\u2013544, July 1984.","journal-title":"J. ACM"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"P. B. Gibbons, Y. Matias, and V. L. Ramachandran. Efficient low-contention parallel algorithms. In 6th Annual ACM Symposium on Parallel Algorithms and Architectures, June 1994.","DOI":"10.1145\/181014.181382"},{"key":"20_CR11","unstructured":"J. Gil and Y. Matias. Fast hashing on a PRAM\u2014designing by expectation. In Proc. of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 271\u2013280, Jan. 1991."},{"key":"20_CR12","first-page":"204","volume":"583","author":"J. Gil","year":"1992","unstructured":"J. Gil and Y. Matias. Leaders election without a conflict resolution rule\u2014fast and efficient randomized simulations among CRCW PRAMs. In Proc. of the 1st Latin American Informatics Symposium, Springer LNCS 583, pages 204\u2013218, 1992. To appear in J. of Parallel and Distributed Computing.","journal-title":"Springer LNCS"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proc. of the 32nd IEEE Annual Symp. on Foundation of Computer Science, pages 698\u2013710, Oct. 1991.","DOI":"10.1109\/SFCS.1991.185438"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"J. Gil, F. Meyer auf der Heide, and A. Wigderson. Not all keys can be hashed in constant time. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 244\u2013253, 1990.","DOI":"10.1145\/100216.100247"},{"key":"20_CR15","volume-title":"A Foundation for Computer Science","author":"R. L. Graham","year":"1989","unstructured":"R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. A Foundation for Computer Science. Addison-Wesley Publishing Company, Inc., Reading, Massachusetts, May 1989."},{"key":"20_CR16","unstructured":"J. J\u00e1J\u00e1. Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, Inc., 1992."},{"key":"20_CR17","first-page":"729","volume":"443","author":"Y. Matias","year":"1990","unstructured":"Y. Matias and U. Vishkin. On parallel hashing and integer sorting. In Proc. of 17th International Colloquium on Automata Languages and Programming, Springer LNCS 443, pages 729\u2013743, 1990.","journal-title":"Springer LNCS"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Y. Matias and U. Vishkin. Converting high probability into nearly-constant time\u2014with applications to parallel hashing. In Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, pages 307\u2013316, May 1991.","DOI":"10.1145\/103418.103453"},{"issue":"4","key":"20_CR19","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0196-6774(91)90034-V","volume":"12","author":"Y. Matias","year":"1991","unstructured":"Y. Matias and U. Vishkin. On parallel hashing and integer sorting. Journal of Algorithms, 12(4):573\u2013606, 1991.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:23:22Z","timestamp":1742595802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_72"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}