Kakeya sets, new mergers and old extractors

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 625-633

  Dvir, Zeev ^a   Wigderson, Avi ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL SETTINGS; CONSTANT FACTORS; FINITE FIELDS; OPTIMAL EXTRACTORS;

CLUSTER ANALYSIS; COMPUTERS; ENTROPY; FIBER OPTIC CHEMICAL SENSORS; INFORMATION THEORY; LUTETIUM; MERGING; MODULAR CONSTRUCTION; RANDOM PROCESSES; RANDOM VARIABLES; TANTALUM;

MERGERS AND ACQUISITIONS;

EID: 57949092809     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.23     Document Type: Conference Paper

References (23)

1. B. Barak, R. Shaltiel, and A. Wigderson. Computational analogues of entropy. In 11th International Conference on Random Structures and Algorithms, pages 200-215, 2003.
2. A. Besicovitch. On Kakeya's problem and a similar one. Mathematische Zeitschrift, (27):312-320, 1928.
3. J. Bourgain. On the dimension of Kakeya sets and related maximal inequalities. Geom. Funct. Anal., (9):256-282, 1999.
4. J. Bourgain. Harmonic analysis and combinatorics: How much may they contribute to each other? IMU/Amer. Math. Soc., pages 13-32, 2000.
5. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2): 230-261, Apr. 1988. Special issue on cryptography.
6. Z. Dvir. On the size of Kakeya sets in finite fields. J. AMS (to appear), 2008.
7. Z. Dvir and A. Shpilka. An improved analysis of linear mergers. Comput. Complex., 16(1):34-59, 2007. (Extended abstract appeared in RANDOM 2005).
8. C. Fefferman. The multiplier problem for the ball. Annals of Mathematics, (94):330-336, 1971.
9. O. Goldreich and A. Wigderson. Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Structures & Algorithms, 11(4):315-343, 1997.
10. V. Guruswami, C. Umans, and S. Vadhan. Unbalanced expanders and randomness extractors from parvaresh-vardy codes. In CCC '07: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity, pages 96-108, Washington, DC, USA, 2007. IEEE Computer Society.
11. J. HAstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
12. R. Impagliazzo, L. Levin, and M. Luby. Pseudorandom generation from one-way functions. In Proceedings of the 21st ACM Symposium on Theory of Computing, 1989.
13. N. Katz and T. Tao. Recent progress on the Kakeya conjecture. In Publicacions Matematiques, Proceedings of the 6th International Conference on Harmonic Analysis and Partial Differential Equations, pages 161-180, U. Barcelona, 2002.
14. C.-J. Lu, O. Reingold, S. Vadhan, and A. Wigderson. Extractors: Optimal up to constant factors. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing ", 2003.
15. G. Mockenhaupt and T. Tao. Restriction and Kakeya phenomena for finite fields. Duke Math. J., 121:35-74, 2004.
16. F. Parvaresh and A. Vardy. Correcting errors beyond the guruswami-sudan radius in polynomial time. In FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 285-294, Washington, DC, USA, 2005. IEEE Computer Society.
17. O. Reingold, R. Shaltiel, and A. Wigderson. Extracting randomness via repeated condensing. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000.
18. K. Rogers. The finite field Kakeya problem. Amer. Math Monthly 108, (8):756-759, 2001.
19. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the EATCS, 77:67-95, 2002.
20. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudorandom generator. J. ACM, 52(2): 172-216, 2005.
21. A. Ta-Shma. Refining Randomness. PhD thesis, The Hebrew Univerity, Jerusalem, Israel, 1996.
22. T. Tao. From rotating needles to stability of waves: emerging connections between combinatorics, analysis, and pde. Notices Amer. Math. Soc., 48(3):294-303, 2001.
23. T. Wolff. Recent work connected with the Kakeya problem, pages 129-162, 1999.