{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T11:28:32Z","timestamp":1770550112003,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":7502,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1016\/0304-3975(93)90257-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"121-133","source":"Crossref","is-referenced-by-count":88,"title":["The computational complexity of universal hashing"],"prefix":"10.1016","volume":"107","author":[{"given":"Yishay","family":"Mansour","sequence":"first","affiliation":[]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[]},{"given":"Prasoon","family":"Tiwari","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90257-T_BIB1","series-title":"27th Ann. Symp. on Foundations of Computer Science","first-page":"402","article-title":"Time-space tradeoffs for branching programs constructed with those straight line programs","author":"Abrahamson","year":"1986"},{"key":"10.1016\/0304-3975(93)90257-T_BIB2","series-title":"Proc. 27th Ann. Symp. on Foundations of Computer Science","first-page":"337","article-title":"Complexity classes in communication complexity theory","author":"Babai","year":"1986"},{"key":"10.1016\/0304-3975(93)90257-T_BIB3","series-title":"Proc. 21st Ann. ACM Symp. on Theory of Computing","first-page":"197","article-title":"A general sequential time space tradeoff for finding unique elements","author":"Beame","year":"1989"},{"key":"10.1016\/0304-3975(93)90257-T_BIB4","unstructured":"P. Beame, M. Tompa and P. Yan, Communication-space tradeoffs in the boolean model (manuscript)."},{"key":"10.1016\/0304-3975(93)90257-T_BIB5","series-title":"Handbook of Theoretical Computer Science, Vol. A","first-page":"757","article-title":"The complexity of finite functions","author":"Boppana","year":"1990"},{"key":"10.1016\/0304-3975(93)90257-T_BIB6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0211022","article-title":"A time-space tradeoff for sorting on a general sequential model of computation","volume":"1","author":"Borodin","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90257-T_BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0019-9958(83)80060-6","article-title":"Parallel computation for well-endowed rings and space-bounded probabilistic machines","volume":"58","author":"Borodin","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90257-T_BIB8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0022-0000(81)90037-4","article-title":"A time-space tradeoff for sorting on non-oblivious machines","volume":"22","author":"Borodin","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90257-T_BIB9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(93)90257-T_BIB10","series-title":"Proc. IEEE 7th Ann. Symp. on Switching and Automata Theory","first-page":"78","article-title":"The recognition problem for the set of perfect squares, conference record","author":"Cobham","year":"1966"},{"key":"10.1016\/0304-3975(93)90257-T_BIB11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90257-T_BIB12","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0304-3975(93)90257-T_BIB13","series-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing","first-page":"59","article-title":"Private coins versus public coins in interactive proof systems","author":"Goldwasser","year":"1986"},{"key":"10.1016\/0304-3975(93)90257-T_BIB14","series-title":"Proc. 30th Ann. Symp. on Foundations of Computer Science","first-page":"248","article-title":"How to recycle random bits","author":"Impagliazzo","year":"1989"},{"issue":"1","key":"10.1016\/0304-3975(93)90257-T_BIB15","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/BF01747074","article-title":"A method of determining lower bounds for the complexity of \u03c0 schemes","volume":"10","author":"Krapchenko","year":"1971","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"10.1016\/0304-3975(93)90257-T_BIB16","series-title":"Proc. 21st Ann. ACM Symp. on Theory of Computing","first-page":"217","article-title":"Tradeoffs between communication and space","author":"Lam","year":"1989"},{"key":"10.1016\/0304-3975(93)90257-T_BIB17","series-title":"Proc. 30th Ann. Symp. on Foundations of Computer Science","first-page":"574","article-title":"Constant depth circuits, fourier transform and learnability","author":"Linial","year":"1989"},{"key":"10.1016\/0304-3975(93)90257-T_BIB18","series-title":"Proc. 22nd Ann. ACM Symp. on Theory of Computing","first-page":"204","article-title":"Pseudorandom generators for space-bounded computation","author":"Nisan","year":"1990"},{"key":"10.1016\/0304-3975(93)90257-T_BIB19","series-title":"Proc. 30th Ann. Symp. on Foundations of Computer Science","first-page":"20","article-title":"On universal classes of fast high performance hash functions, their time-space tradeoff, and their application","author":"Siegel","year":"1989"},{"key":"10.1016\/0304-3975(93)90257-T_BIB20","series-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0304-3975(93)90257-T_BIB21_1","series-title":"Tech. Report","article-title":"A complexity theory for VLSI","author":"Thompson","year":"1980"},{"key":"10.1016\/0304-3975(93)90257-T_BIB21_2","unstructured":"Ph.D. thesis, Department of Computer Science."},{"key":"10.1016\/0304-3975(93)90257-T_BIB22","series-title":"Ph.D. thesis","article-title":"The communication complexity of distributed computing and a parallel algorithm for polynomial roots","author":"Tiwari","year":"1986"},{"key":"10.1016\/0304-3975(93)90257-T_BIB23","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0022-0000(80)90056-2","article-title":"Time-space tradeoffs for computing functions, using connectivity properties of their circuits","volume":"20","author":"Tompa","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90257-T_BIB24","series-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing","first-page":"308","article-title":"The entropic limitations on VLSI computations","author":"Yao","year":"1981"},{"key":"10.1016\/0304-3975(93)90257-T_BIB25","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0022-0000(84)90029-1","article-title":"A time-space tradeoff for matrix multiplication and the discrete fourier transform on a general sequential random access computer","volume":"29","author":"Yesha","year":"1984","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390257T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390257T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:28:54Z","timestamp":1555154934000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390257T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["030439759390257T"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90257-t","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}