{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T05:14:39Z","timestamp":1771046079362,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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 Processing Letters"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0020-0190(94)00108-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"283-288","source":"Crossref","is-referenced-by-count":3,"title":["Finding succinct ordered minimal perfect hash functions"],"prefix":"10.1016","volume":"51","author":[{"given":"Steven S.","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel S.","family":"Hirschberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(94)00108-1_BIB1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1080\/02533839.1985.9676832","article-title":"On the design of letter oriented minimal perfect hashing functions","volume":"8","author":"Chang","year":"1985","journal-title":"J. Chinese Institute of Engineers"},{"issue":"3","key":"10.1016\/0020-0190(94)00108-1_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1093\/comjnl\/29.3.277","article-title":"A letter oriented minimal perfect hashing scheme","volume":"29","author":"Chang","year":"1986","journal-title":"Comput. J."},{"issue":"5","key":"10.1016\/0020-0190(94)00108-1_BIB3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0020-0190(92)90220-P","article-title":"An optimal algorithm for generating minimal perfect hash functions","volume":"43","author":"Czech","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00108-1_BIB4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/96749.98233","article-title":"Order preserving minimal perfect hash functions and information retrieval","author":"Fox","year":"1989","journal-title":"Proc. 13th Ann. ACM Conf. on Research and Development of Information Retrieval"},{"issue":"3","key":"10.1016\/0020-0190(94)00108-1_BIB5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/125187.125200","article-title":"Order preserving minimal perfect hash functions and information retrieval","volume":"9","author":"Fox","year":"1991","journal-title":"ACM Trans. Inform. Systems"},{"key":"10.1016\/0020-0190(94)00108-1_BIB6","first-page":"114","article-title":"A more cost effective algorithm for finding minimal perfect hashing functions","author":"Fox","year":"1989","journal-title":"Computing Trends in the 90's: 17th ACM Computer Science Conf."},{"issue":"1","key":"10.1016\/0020-0190(94)00108-1_BIB7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/129617.129623","article-title":"Practical minimal perfect hash functions for large databases","volume":"35","author":"Fox","year":"1992","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0020-0190(94)00108-1_BIB8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01932700","article-title":"An algebraic approach to Cichelli's perfect hashing","volume":"29","author":"Gori","year":"1989","journal-title":"BIT"},{"key":"10.1016\/0020-0190(94)00108-1_BIB9","series-title":"Tech. Rept. 92-16","article-title":"A family of generators of minimal perfect hashing functions","author":"Majewski","year":"1992"},{"issue":"5","key":"10.1016\/0020-0190(94)00108-1_BIB10","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":"Comm. ACM"},{"key":"10.1016\/0020-0190(94)00108-1_BIB11","first-page":"145","article-title":"Data Structure Techniques","author":"Standish","year":"1980"},{"issue":"1","key":"10.1016\/0020-0190(94)00108-1_BIB12","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","article-title":"Solving sparse linear equations over finite fields","volume":"32","author":"Wiedemann","year":"1986","journal-title":"IEEE Trans. Inform. Theory."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001081?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001081?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T15:11:00Z","timestamp":1681830660000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0020019094001081"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00108-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}