Shubhangi Saraf

1. Improved rank bounds for design matrices and a new proof of Kelly's theorem
   2012/11/01 by Zeev Dvir, Dvir, Zeev, Shubhangi Saraf +3 · 2 citations
   Computer Science · Decision Sciences · Engineering · Mathematics · #05B20 #52C35 #Advanced Optimization Algorithms Research #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Digital Image Processing Techniques #F.2.1 #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #Multi-Criteria Decision Making #Sparse and Compressive Sensing Techniques #graph theory and CDMA systems
2. Maximally Recoverable Codes for Grid-like Topologies
   2016/05/18 by Parikshit Gopalan, Guang‐Da Hu, Gopalan, Parikshit +9 · 2 citations
   Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Distributed systems and fault tolerance #FOS: Computer and information sciences #Information Theory (cs.IT)
3. Kakeya-type sets in finite vector spaces
   2010/03/19 by Swastik Kopparty, Kopparty, Swastik, Vsevolod F. Lev +5 · 1 citation
   Computer Science · Mathematics · #05B25 #51E20 #52C17. #Advanced Topology and Set Theory #Coding theory and cryptography #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT)
4. The Limits of Depth Reduction for Arithmetic Formulas: It's all about\n the top fan-in
   2013/11/26 by Mrinal Kumar, Shubhangi Saraf, Kumar, Mrinal +1 · 1 citation
   Computer Science · Mathematics · #Commutative Algebra and Its Applications #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Machine Learning and Algorithms #Polynomial and algebraic computation #Quantum Computing Algorithms and Architecture
5. High rate locally-correctable and locally-testable codes with\n sub-polynomial query complexity
   2015/04/22 by Swastik Kopparty, Kopparty, Swastik, Or Meir +5 · 1 citation
   Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Data Storage Technologies #Computational Complexity (cs.CC) #Cryptography and Data Security #DNA and Biological Computing #FOS: Computer and information sciences
6. On the CGGRT Criterion for Detecting Bipartite Perfect Matchings in NC
   2026/07/17 by Swastik Kopparty, Shubhangi Saraf
   #cs.CC #cs.DS #math.CO