{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:04:20Z","timestamp":1775282660183,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12526,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1979,4]]},"DOI":"10.1016\/0022-0000(79)90044-8","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T11:41:56Z","timestamp":1070624516000},"page":"143-154","source":"Crossref","is-referenced-by-count":1528,"title":["Universal classes of hash functions"],"prefix":"10.1016","volume":"18","author":[{"given":"J.Lawrence","family":"Carter","sequence":"first","affiliation":[]},{"given":"Mark N.","family":"Wegman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90044-8_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(79)90044-8_BIB2","unstructured":"R. FAGIN, J. NIEVERGELT, N. PIPPENGER, AND H. R. STRONG, \u201cExtendible Hashing: A Fast Access Method for Dynamic Files,\u201d IBM Research Report RJ 2305."},{"key":"10.1016\/0022-0000(79)90044-8_BIB3","series-title":"Proceedings of the Sixth ACM Symposium on the Theory of Computing","first-page":"91","article-title":"Computational complexity of probabilistic Turing machines","author":"Gill","year":"1974"},{"key":"10.1016\/0022-0000(79)90044-8_BIB4","doi-asserted-by":"crossref","unstructured":"E. Goto, Y. Kanada, Hashing lemmas on time complexities with applications to formula manipulation, in \u201cProceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation,\u201d Yorktown Heights, N. Y., pp. 149\u2013153.","DOI":"10.1145\/800205.806334"},{"key":"10.1016\/0022-0000(79)90044-8_BIB5","doi-asserted-by":"crossref","unstructured":"F. GUSTAVSON AND D. Y. Y. YUN, Arithmetic complexity of unordered or sparse polynomials, in \u201cProceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation,\u201d Yorktown Heights, N. Y., pp. 154\u2013159.","DOI":"10.1145\/800205.806333"},{"key":"10.1016\/0022-0000(79)90044-8_BIB6","series-title":"Sorting and Searching","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(79)90044-8_BIB7","doi-asserted-by":"crossref","unstructured":"G. MARKOWSKY, J. L. CARTER, AND M. N. WEGMAN, Analysis of a universal class of hash functions, in \u201cProceedings of the Seventh Mathematical Foundations of Computer Science Conference\u201d, Lecture Notes in Computer Science, Vol. 64, Springer-Verlag, Berlin.","DOI":"10.1007\/3-540-08921-7_82"},{"key":"10.1016\/0022-0000(79)90044-8_BIB8","series-title":"Proceedings of Symposium on New Directions and Recent Results in Algorithms and Complexity","first-page":"21","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/0022-0000(79)90044-8_BIB9","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1147\/rd.194.0398","article-title":"Multifont OCR postprocessing system","volume":"19","author":"Rosenbaum","year":"1975","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0022-0000(79)90044-8_BIB10","unstructured":"D. H. A. SMITH, private communication."},{"key":"10.1016\/0022-0000(79)90044-8_BIB11","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A. fast Monte-Carlo test for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900448?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900448?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:20:35Z","timestamp":1550319635000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["0022000079900448"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90044-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}