{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:31:39Z","timestamp":1649079099885},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1007\/bf01192048","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T21:40:03Z","timestamp":1108676403000},"page":"409-428","source":"Crossref","is-referenced-by-count":0,"title":["Minimean optimal key arrangements in hash tables"],"prefix":"10.1007","volume":"14","author":[{"given":"A. C. -C.","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/361952.361964","volume":"16","author":"R. P. Brent","year":"1973","unstructured":"R. P. Brent, Reducing the retrieval time of scatter storage techniques,Comm. ACM,16, 1973, 105?109.","journal-title":"Comm. ACM"},{"key":"CR2","first-page":"159","volume-title":"Proceedings of the Conference on Theoretical Computer Science","author":"G. H. Gonnet","year":"1977","unstructured":"G. H. Gonnet, Average lower bounds for open-addressing hash coding,Proceedings of the Conference on Theoretical Computer Science, University of Waterloo, Waterloo, Ontario, August 1977, pp. 159?162."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1137\/0208038","volume":"8","author":"G. H. Gonnet","year":"1979","unstructured":"G. H. Gonnet and J. I. Munro, Efficient ordering of hash tables,SIAM J. Comput.,8, 1979, 463?478.","journal-title":"SIAM J. Comput."},{"key":"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":"L. J. Guibas and E. Szemer\u00e9di, The analysis of double hashing,J. Comput. and System Sei.,16, 1978, 226?274.","journal-title":"J. Comput. and System Sei."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"P. Hall, On representations of subsets,J. London Math. Soc,10, 1935, 26?30.","journal-title":"J. London Math. Soc"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","volume":"8","author":"R. M. Karp","year":"1979","unstructured":"R. M. Karp, A patching algorithm for the nonsymmetric traveling-salesman problem,SI AM J. Comput.,8, 1979, 561?573.","journal-title":"SI AM J. Comput."},{"key":"CR7","first-page":"1","volume-title":"Discrete Algorithms and Complexity","author":"R. M. Karp","year":"1987","unstructured":"R. M. Karp, An upper bound on the expected cost of an optimal assignment, inDiscrete Algorithms and Complexity, edited by D. S. Johnson, T. Nishizeki, A. Nozaki, and H. S. Wilf, Academic Press, New York, 1987, pp. 1?4."},{"key":"CR8","volume-title":"The Art of Computer Programming, Vol. 3","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973."},{"key":"CR9","unstructured":"A. Lazarus, The Assignment Problem with Uniform (0,1) Cost Matrix, B.A. Thesis, Department of Mathematics, Princeton University, 1979."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/322063.322065","volume":"25","author":"R. L. Rivest","year":"1978","unstructured":"R. L. Rivest, Optimal arrangement of keys in a hash table,J. Assoc. Comput. Mach.,25, 1978, 200?209.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0208036","volume":"8","author":"D. W. Walkup","year":"1979","unstructured":"D. W. Walkup, On the expected value of a random assignment problem,SIAM J. Comput.,8, 1979, 440?442.","journal-title":"SIAM J. Comput."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0196-6774(85)90042-2","volume":"6","author":"A. C. Yao","year":"1985","unstructured":"A. C. Yao, On optimal arrangements of keys with double hashing,J. Algorithms,6, 1985, 253?264.","journal-title":"J. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01192048.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01192048\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01192048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:08:49Z","timestamp":1556629729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01192048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["BF01192048"],"URL":"https:\/\/doi.org\/10.1007\/bf01192048","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}