Shubhangi Saraf

Publications

565

Citations

H-Index

2008

Active since

Affiliations

Rutgers, The State University of New Jersey(Current)

Princeton University

Institute for Advanced Study

Massachusetts Institute of Technology

University of Haifa

Shubhangi Saraf is an author at Rutgers, The State University of New Jersey specializing in engineering, computational complexity, and computer science.

ORCID

Top concepts

EngineeringComputational ComplexityComputer ScienceDiscrete MathematicsCoding TheoryCombinatorial OptimizationFormal MethodsCircuit ComplexityFormal VerificationTheory Of Computing

Publications per year

2008–2023

Publications

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers

Zeev Dvir, Swastik Kopparty, Shubhangi Saraf et al. · 2009 · 90 citations

Mathematical Programming, Combinatorics On Word, Randomness Extraction +12

Blackbox Polynomial Identity Testing for Depth 3 Circuits

Neeraj Kayal, Shubhangi Saraf · 2009 · 73 citations

Circuit Complexity, Engineering, Verification +17

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers

Zeev Dvir, Swastik Kopparty, Shubhangi Saraf et al. · SIAM Journal on Computing · 2013 · 65 citations

Mathematical Programming, Engineering, Combinatorial Design +16

Improved lower bound on the size of Kakeya sets over finite fields

Shubhangi Saraf, Madhu Sudan · Analysis & PDE · 2008 · 44 citations · Full text

Maximally Recoverable Codes for Grid-like Topologies

Parikshit Gopalan, Guang‐Da Hu, Swastik Kopparty et al. · 2017 · 40 citations · Full text

Rows per page

1–5 of 19