{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:03Z","timestamp":1725663183850},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_99","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:01:16Z","timestamp":1330189276000},"page":"569-581","source":"Crossref","is-referenced-by-count":2,"title":["An improved program for constructing open hash tables"],"prefix":"10.1007","author":[{"given":"Jeanette","family":"Schmidt","sequence":"first","affiliation":[]},{"given":"Eli","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"issue":"3","key":"46_CR1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1137\/0208038","volume":"8","author":"G. Gonnet","year":"1979","unstructured":"Gonnet, G., and Munro, I. Efficient ordering of hash tables. SIAM S. Comput. 8, 3, 1979, pp. 463\u2013478.","journal-title":"SIAM S. Comput."},{"issue":"2","key":"46_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/361952.361964","volume":"16","author":"R. P. Brent","year":"1973","unstructured":"Brent, R.P. Reducing the retrieval time of scatter storage technique. Comm. ACM 16, 2, 1973, pp. 105\u2013109.","journal-title":"Comm. ACM"},{"issue":"2","key":"46_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/322063.322065","volume":"25","author":"R. L. Rivest","year":"1978","unstructured":"Rivest, R.L. Optimal arrangement of keys in a hash table. JACM 25, 2, 1978, pp. 200\u2013209.","journal-title":"JACM"},{"key":"46_CR4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0022-0000(78)90046-6","volume":"16","author":"L. J. Guibas","year":"1978","unstructured":"Guibas, L.J., and Szemeredi, E. The analysis of double hashing. J. Comput. System Sci. 16, 1978, pp. 226\u2013274.","journal-title":"J. Comput. System Sci."},{"key":"46_CR5","volume-title":"Mariage stable","author":"D. E. Knuth","year":"1976","unstructured":"Knuth, D.E. Mariage stable. Les presses de l'Universite de Montreal, Quebec, Canada, 1976."},{"key":"46_CR6","volume-title":"Random Allocations","author":"V. F. Kolchin","year":"1978","unstructured":"Kolchin, V.F., Sevast'yanov, B.A., and Chistyakov, V.P. Random Allocations, V.H. Winston & Sons, Washington, D.C., 1978."},{"key":"46_CR7","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/0020-0190(78)90014-5","volume":"7","author":"M. Ajtai","year":"1978","unstructured":"Ajtai, M., Komlos, J., and Szemeredi, E. There is no fast single hashing algorithm. Information Processing Letters 7, 6, 1978.","journal-title":"Information Processing Letters"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Donath, W.E. Algorithm and average-value bounds for assignment problems. IBM J. Res. Develo., 1969, pp. 380\u2013386.","DOI":"10.1147\/rd.134.0380"},{"issue":"11","key":"46_CR9","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/359168.359175","volume":"22","author":"R. E. Tarjan","year":"1979","unstructured":"Tarjan, R.E. and Yau, A.C.C. Storing a sparse table. Comm. ACM 22, 11, 1979, pp. 606\u2013611.","journal-title":"Comm. ACM"},{"issue":"3","key":"46_CR10","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0208036","volume":"8","author":"D. Walkup","year":"1979","unstructured":"Walkup, D. On the expected value of a random assignment problem. SIAM J. Comput. 8, 3, 1979, pp. 440\u2013442.","journal-title":"SIAM J. Comput."},{"key":"46_CR11","volume-title":"An Introduction to Probability Theory and its Application. Vol. 1","author":"W. Feller","year":"1951","unstructured":"Feller, W. An Introduction to Probability Theory and its Application. Vol. 1, 2nd Ed., Wiley, New York, 1951.","edition":"2nd Ed."},{"key":"46_CR12","volume-title":"The Art of Computer Programming, Vol. III, Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D.E. The Art of Computer Programming, Vol. III, Sorting and Searching. Addison-Wesley, Don Mills, 1973."},{"key":"46_CR13","unstructured":"Gonnet, G.H. Interpolation and Interpolation Hash Searching. University of Waterloo, Computer Science Dept. Research Report 77-02."},{"key":"46_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/00029890.1974.11993556","volume":"8","author":"D. E. Knuth","year":"1974","unstructured":"Knuth, D.E. Computer science and its relation to mathematics. Am. Math. Monthly 8, 1974, pp. 323\u2013343.","journal-title":"Am. Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_99.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:26Z","timestamp":1605643346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_99","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}