{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:21:43Z","timestamp":1748406103560,"version":"3.41.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1980,3,1]],"date-time":"1980-03-01T00:00:00Z","timestamp":320716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1980,3,1]],"date-time":"1980-03-01T00:00:00Z","timestamp":320716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1980,3]]},"DOI":"10.1007\/bf01933582","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T22:43:35Z","timestamp":1122763415000},"page":"25-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Analysis of repeated hashing"],"prefix":"10.1007","volume":"20","author":[{"given":"Per-\u00c5ke","family":"Larson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1980,3,1]]},"reference":[{"key":"BF01933582_CR1","volume-title":"Dynamic Programming","author":"Richard Bellman","year":"1957","unstructured":"Richard Bellman,Dynamic Programming, Princeton University Press, Princeton, N.J., 1957."},{"key":"BF01933582_CR2","first-page":"431","volume-title":"Information Processing 74","author":"L. H. Groner","year":"1974","unstructured":"L. H. Groner, and A. L. Goel,Concurrency in hashed file access, in J. L. Rosenfeld (ed.),Information Processing 74, North-Holland, Amsterdam, 1974, pp. 431\u2013435."},{"key":"BF01933582_CR3","unstructured":"G\u00e9rard Guiho,Organisation des m\u00e9moires. Influence d'une structure et \u00e9tude d'optimisation, (diss). Universit\u00e9 Paris VI, Institut de programmation, No I.P. 73.16, 1973."},{"key":"BF01933582_CR4","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:Sorting and Searching. Addison-Wesley, Mass., 1973."},{"key":"BF01933582_CR5","unstructured":"P.-\u00c5. Larson,Analysis of uniform hashing, Reports on computer science and mathematics, Ser. A, no. 1, \u00c5bo Akademi, \u00c5bo, 1978 (to appear in Acta Informatica)."},{"key":"BF01933582_CR6","doi-asserted-by":"crossref","unstructured":"C. A. Olson,Random access file organisation for indirectly addressed records, Proceedings of the 24th National Conference of ACM, ACM, 1969, pp. 539\u2013549.","DOI":"10.1145\/800195.805959"},{"issue":"1","key":"BF01933582_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1147\/rd.171.0027","volume":"17","author":"J. A. van der Pool","year":"1973","unstructured":"J. A. van der Pool,Optimum storage allocation for a file in steady state, IBM Journal of Research and Development, vol. 17, no. 1, 1973, pp. 27\u201338.","journal-title":"IBM Journal of Research and Development"}],"container-title":["BIT Numerical Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01933582.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF01933582\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01933582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01933582.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:53:51Z","timestamp":1748386431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF01933582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,3]]}},"alternative-id":["BF01933582"],"URL":"https:\/\/doi.org\/10.1007\/bf01933582","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"type":"print","value":"0006-3835"},{"type":"electronic","value":"1572-9125"}],"subject":[],"published":{"date-parts":[[1980,3]]},"assertion":[{"value":"12 February 1979","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 1979","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 1980","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}