Author of the publication

Using Elimination Theory to construct Rigid Matrices.

, , , and . FSTTCS, volume 4 of LIPIcs, page 299-310. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

ε-MSR Codes: Contacting Fewer Code Blocks for Exact Repair., , and . CoRR, (2018)Weight enumerators and higher support weights of maximally recoverable codes., and . Allerton, page 835-842. IEEE, (2015)On the rigidity of Vandermonde matrices.. Theor. Comput. Sci., 237 (1-2): 477-483 (2000)Using Elimination Theory to Construct Rigid Matrices., , , and . Comput. Complex., 23 (4): 531-563 (2014)Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity.. FOCS, page 6-15. IEEE Computer Society, (1995)Simultaneous Messages vs. Communication., , and . STACS, volume 900 of Lecture Notes in Computer Science, page 361-372. Springer, (1995)An optimal lower bound for 2-query locally decodable linear codes., and . Inf. Process. Lett., 97 (6): 244-250 (2006)ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair., , and . IEEE Trans. Inf. Theory, 66 (11): 6749-6761 (2020)Efficient Reconstruction of Random Multilinear Formulas., , and . FOCS, page 778-787. IEEE Computer Society, (2011)Vulnerabilities in Anonymous Credential Systems., , , , , and . STM@ESORICS, volume 197 of Electronic Notes in Theoretical Computer Science, page 141-148. Elsevier, (2007)