Kakeya sets and the method of multiplicities
暂无分享,去创建一个
[1] Avi Wigderson,et al. Kakeya Sets, New Mergers and Old Extractors , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[2] Madhu Sudan,et al. Improved lower bound on the size of Kakeya sets over finite fields , 2008, 0808.2499.
[3] Zeev Dvir,et al. On the size of Kakeya sets in finite fields , 2008, 0803.2336.
[4] Venkatesan Guruswami,et al. Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes , 2007, JACM.
[5] Zeev Dvir,et al. An Improved Analysis of Linear Mergers , 2007, computational complexity.
[6] Thomas Wolff,et al. Recent work connected with the Kakeya problem , 2007 .
[7] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[8] Venkatesan Guruswami,et al. Explicit capacity-achieving list-decodable codes , 2005, STOC.
[9] Alexander Vardy,et al. Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[10] Avi Wigderson,et al. Extractors: optimal up to constant factors , 2003, STOC '03.
[11] Ronen Shaltiel,et al. Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.
[12] Avi Wigderson,et al. Extracting randomness via repeated condensing , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[13] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[14] Avi Wigderson,et al. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1993, Comb..
[15] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[16] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[17] Amnon Ta-Shma,et al. On Extracting Randomness From Weak Random Sources , 1995, Electron. Colloquium Comput. Complex..