{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:41:47Z","timestamp":1648989707915},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1007\/bf02074879","type":"journal-article","created":{"date-parts":[[2005,8,13]],"date-time":"2005-08-13T21:58:03Z","timestamp":1123970283000},"page":"430-440","source":"Crossref","is-referenced-by-count":2,"title":["The effect of table expansion on the program complexity of perfect hash functions"],"prefix":"10.1007","volume":"32","author":[{"given":"Harry G.","family":"Mairson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02074879_CR1","unstructured":"Berman, Francine, Mary Ellen Bock, Eric Dittert, Michael J. O'Donnell and Darrell Plank.Collections of Functions for Perfect Hashing. Preprint, Purdue University, July 1982."},{"key":"BF02074879_CR2","doi-asserted-by":"crossref","unstructured":"Fredman, Michael L., J\u00e1nos Koml\u00f3s and Endre Szemer\u00e9di.Storing a sparse table with O(1)worst case access time. 23rd IEEE Symposium on Foundations of Computer Science, November 1982, pp. 165\u2013169.","DOI":"10.1109\/SFCS.1982.39"},{"key":"BF02074879_CR3","doi-asserted-by":"crossref","unstructured":"Mairson, Harry G.The program complexity of searching a table. 24th IEEE Symposium on Foundations of Computer Science, November 1983, pp. 40\u201348.","DOI":"10.21236\/ADA135299"},{"key":"BF02074879_CR4","doi-asserted-by":"crossref","unstructured":"Mairson, Harry G.The program complexity of searching a table. (Ph.D. thesis) Technical Report STAN-CS-83-988, Department of Computer Science, Stanford University, January 1984.","DOI":"10.21236\/ADA135299"},{"key":"BF02074879_CR5","volume-title":"Inequalities: Theory of Majorization and its Applications","author":"Albert W. Marshall","year":"1979","unstructured":"Marshall, Albert W. and Ingram Olkin.Inequalities: Theory of Majorization and its Applications. New York: Academic Press, 1979."},{"key":"BF02074879_CR6","doi-asserted-by":"crossref","unstructured":"Mehlhorn, Kurt.On the program size of perfect and universal hashfunctions. 23rd IEEE Symposium on Foundations of Computer Science, November 1982, pp. 170\u2013175.","DOI":"10.1109\/SFCS.1982.80"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02074879.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02074879\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02074879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T00:23:52Z","timestamp":1586391832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02074879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["BF02074879"],"URL":"https:\/\/doi.org\/10.1007\/bf02074879","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}