{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:32:11Z","timestamp":1725517931524},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853626"},{"type":"electronic","value":"9783540853633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85363-3_29","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T19:29:28Z","timestamp":1219865368000},"page":"357-370","source":"Crossref","is-referenced-by-count":6,"title":["Tight Bounds for Hashing Block Sources"],"prefix":"10.1007","author":[{"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[]},{"given":"Salil","family":"Vadhan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-39799-X_37","volume-title":"Advances in Cryptology\u2014CRYPTO\u00a0\u201985","author":"C.H. Bennett","year":"1986","unstructured":"Bennett, C.H., Brassard, G., Robert, J.-M.: How to reduce your enemy\u2019s information (extended abstract). In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 468\u2013476. Springer, Heidelberg (1986)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Mitzenmacher, M.: Survey: Network applications of bloom filters: A survey. Internet Mathematics\u00a01(4) (2003)","DOI":"10.1080\/15427951.2004.10129096"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput.\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM J. Comput."},{"key":"29_CR4","unstructured":"Chung, K.-M., Vadhan, S.: Tight bounds for hashing block sources (2008), http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:0806.1948"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.2307\/1403865","volume":"70","author":"A.L. Gibbs","year":"2002","unstructured":"Gibbs, A.L., Su, F.E.: On choosing and bounding probability metrics. International Statistical Review\u00a070, 419 (2002)","journal-title":"International Statistical Review"},{"key":"29_CR6","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington, May 15\u201317, 1989, pp. 12\u201324 (1989)"},{"key":"29_CR7","series-title":"Sorting and Searching","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The art of computer programming. Sorting and Searching, vol.\u00a03. Addison-Wesley Longman Publishing Co., Inc, Boston (1998)"},{"key":"29_CR8","unstructured":"Mitzenmacher, M., Vadhan, S.: Why simple hash functions work: Exploiting the entropy in a data stream. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), January 20\u201322, 2008, pp. 746\u2013755 (2008)"},{"key":"29_CR9","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. In: SODA, p. 413 (2003)"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1006\/jcss.1997.1546","volume":"58","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ta-Shma, A.: Extracting randomness: A survey and new constructions. J. Comput. Syst. Sci.\u00a058(1), 148\u2013173 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences\u00a052(1), 43\u201352 (1996)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics\u00a013(1), 2\u201324 (2000) (electronic)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"29_CR13","unstructured":"Reyzin, L.: A note on the statistical difference of small direct products. Technical Report BUCS-TR-2004-032, Boston University Computer Science Department (2004)"},{"key":"29_CR14","series-title":"Algorithms and Complexity","volume-title":"Current Trends in Theoretical Computer Science","author":"R. Shaltiel","year":"2004","unstructured":"Shaltiel, R.: Recent developments in extractors. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science. Algorithms and Complexity, vol.\u00a01. World Scientific, Singapore (2004)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Vadhan, S.: The unified theory of pseudorandomness. SIGACT News\u00a038(3) (September 2007)","DOI":"10.1145\/1324215.1324225"},{"issue":"4\/5","key":"29_CR16","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01940870","volume":"16","author":"D. Zuckerman","year":"1996","unstructured":"Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica\u00a016(4\/5), 367\u2013391 (1996)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85363-3_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:24:18Z","timestamp":1606184658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85363-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540853626","9783540853633"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85363-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}