{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T13:37:40Z","timestamp":1770903460935,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0306-4379(90)90001-6","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"281-290","source":"Crossref","is-referenced-by-count":13,"title":["Perfect hashing using sparse matrix packing"],"prefix":"10.1016","volume":"15","author":[{"given":"Marshall D","family":"Brain","sequence":"first","affiliation":[]},{"given":"Alan L","family":"Tharp","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(90)90001-6_BIB1","series-title":"Proc. 1989 ACM CSC Conf.","first-page":"114","article-title":"A more cost effective algorithm for finding minimal perfect hash functions","author":"Fox","year":"1989"},{"issue":"11","key":"10.1016\/0306-4379(90)90001-6_BIB2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/359863.359887","article-title":"Perfect hashing functions: a single probe retrieving method for static sets","volume":"20","author":"Sprugnoli","year":"1977","journal-title":"CACM"},{"issue":"4","key":"10.1016\/0306-4379(90)90001-6_BIB3","first-page":"384","article-title":"Reciprocal hashing: a method for generating minimal perfect hashing functions","volume":"24","author":"Jaeschke","year":"1984","journal-title":"CACM"},{"issue":"1","key":"10.1016\/0306-4379(90)90001-6_BIB4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/358808.358813","article-title":"Minimal perfect hashing made simple","volume":"23","author":"Cichelli","year":"1980","journal-title":"CACM"},{"key":"10.1016\/0306-4379(90)90001-6_BIB5","series-title":"Proc. Seventeenth ACM SIGCSE Symp.","first-page":"191","article-title":"Finding minimal perfect hash functions","author":"Karplus","year":"1986"},{"key":"10.1016\/0306-4379(90)90001-6_BIB6","article-title":"Finding minimal perfect hash functions","author":"Karplus","year":"1984"},{"issue":"4","key":"10.1016\/0306-4379(90)90001-6_BIB7","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1145\/358027.358051","article-title":"The study of an ordered minimal perfect hashing scheme","volume":"27","author":"Chang","year":"1984","journal-title":"CACM"},{"issue":"5","key":"10.1016\/0306-4379(90)90001-6_BIB8","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1145\/3532.3538","article-title":"A polynomial time generator for minimal perfect hash functions","volume":"28","author":"Sager","year":"1985","journal-title":"CACM"},{"key":"10.1016\/0306-4379(90)90001-6_BIB9","series-title":"File Organization and Processing","author":"Tharp","year":"1988"},{"key":"10.1016\/0306-4379(90)90001-6_BIB10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/2.7056","article-title":"Hashing for dynamic and static internal tables","author":"Lewis","year":"1988","journal-title":"Computer"},{"issue":"10","key":"10.1016\/0306-4379(90)90001-6_BIB11","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1002\/spe.4380191005","article-title":"Near-perfect hashing of large word sets","volume":"19","author":"Brain","year":"1989","journal-title":"Software Practice Experience"},{"issue":"11","key":"10.1016\/0306-4379(90)90001-6_BIB12","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/359168.359175","article-title":"Storing a sparse table","volume":"22","author":"Tarjan","year":"1979","journal-title":"CACM"},{"issue":"3","key":"10.1016\/0306-4379(90)90001-6_BIB13","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","article-title":"Storing a sparse table with O(1) worst case access time","volume":"1","author":"Fredman","year":"1984","journal-title":"JACM"},{"key":"10.1016\/0306-4379(90)90001-6_BIB14","doi-asserted-by":"crossref","unstructured":"T. Cook. Private Communication (1988).","DOI":"10.1111\/j.1467-7679.1988.tb00346.x"},{"key":"10.1016\/0306-4379(90)90001-6_BIB15","first-page":"506","volume":"Vol. 3","author":"Knuth","year":"1973"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437990900016?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437990900016?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:54:35Z","timestamp":1552611275000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437990900016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0306437990900016"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(90)90001-6","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}