Tight bounds for hashing block sources

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5171 LNCS, Issue , 2008, Pages 357-370

  Chung, Kai Min ^a   Vadhan, Salil ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OP-TIMIZATION PROBLEM; TIGHT BOUNDS; UNIVERSAL HASH FUNCTIONS;

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; FUNCTIONS; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 51849092641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85363-3_29     Document Type: Conference Paper

References (16)

1. Bennett, C.H., Brassard, G., Robert, J.-M.: How to reduce your enemy's information (extended abstract). In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 468-476. Springer, Heidelberg (1986)
2. Broder, A.Z., Mitzenmacher, M.: Survey: Network applications of bloom filters: A survey. Internet Mathematics 1(4) (2003)
3. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230-261 (1988)
4. Chung, K.-M., Vadhan, S.: Tight bounds for hashing block sources (2008), http://www.citebase.org/abstract?id=oai:arXiv.org:0806.1948
5. Gibbs, A.L., Su, F.E.: On choosing and bounding probability metrics. International Statistical Review 70, 419 (2002)
6. Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from oneway functions (extended abstracts). In: Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington, May 15-17, 1989, pp. 12-24 (1989)
7. Knuth, D.E.: The art of computer programming. Sorting and Searching, vol. 3. Addison-Wesley Longman Publishing Co., Inc, Boston (1998)
8. 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-22, 2008, pp. 746-755 (2008)
9. Muthukrishnan, S.: Data streams: algorithms and applications. In: SODA, p. 413 (2003)
10. Nisan, N., Ta-Shma, A.: Extracting randomness: A survey and new constructions. J. Comput. Syst. Sci. 58(1), 148-173 (1999)
11. Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences 52(1), 43-52 (1996)
12. Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics 13(1), 2-24 (2000) (electronic)
13. Reyzin, L.: A note on the statistical difference of small direct products. Technical Report BUCS-TR-2004-032, Boston University Computer Science Department (2004)
14. Shaltiel, R.: Recent developments in extractors. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science. Algorithms and Complexity, vol. 1. World Scientific, Singapore (2004)
15. Vadhan, S.: The unified theory of pseudorandomness. SIGACT News 38(3) (September 2007)
16. Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica 16(4/5), 367-391 (1996)