Shubhangi Saraf - Concepedia

Author

Shubhangi Saraf

Rutgers, The State University of New Jersey ORCID

Also Known As

Amir Shpilka, Noga Ron-Zewi, SHUBHANGI SARAF, Saraf, Shubhangi, Shubhangi Saraf, Sudan, Madhu

100

Publications

786

Citations

H-Index

Concepts

All Affiliations

Rutgers, The State University of New Jersey Princeton University Institute for Advanced Study Massachusetts Institute of Technology University of Haifa

About

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

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	13	13	425
2	Computer Science	7	7	190
3	Coding Theory	5	5	133
4	Computer Engineering	3	3	112
5	Natural Sciences	1	1	23

Shubhangi Saraf

Publications

565

Citations

H-Index

Page 1

	Year	Citations
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Mathematical ProgrammingCombinatorics On WordRandomness ExtractionEngineeringKakeya Set	2009	90
Blackbox Polynomial Identity Testing for Depth 3 Circuits Neeraj Kayal, Shubhangi Saraf Circuit ComplexityEngineeringVerificationDepth 3Computational Complexity	2009	73
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, SIAM Journal on Computing Mathematical ProgrammingEngineeringCombinatorial DesignCombinatorics On WordRandomness Extraction	2013	65
Improved lower bound on the size of Kakeya sets over finite fields Shubhangi Saraf, Madhu Sudan Analysis & PDE	2008	44
Maximally Recoverable Codes for Grid-like Topologies Parikshit Gopalan, Guang‐Da Hu, Swastik Kopparty,	2017	40
IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM Zeev Dvir, Shubhangi Saraf, Avi Wigderson Forum of Mathematics Sigma Total UnimodularityComplex Sparse MatricesEngineeringMatrix AnalysisDesign Matrices	2014	28
Acute and nonobtuse triangulations of polyhedral surfaces Shubhangi Saraf European Journal of Combinatorics Geometric ModelingPolyhedral SurfacesGeometryNatural SciencesDelaunay Triangulation	2008	23
The limits of depth reduction for arithmetic formulas Mrinal Kumar, Shubhangi Saraf Circuit ComplexityDepth ReductionEngineeringComputational Complexity TheoryProof Complexity	2014	22
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity Swastik Kopparty, Or Meir, Noga Ron‐Zewi, Theory Of ComputingEngineeringQuery ComplexityCoding TheorySub-polynomial Query Complexity	2016	22
On the Power of Homogeneous Depth 4 Arithmetic Circuits Mrinal Kumar, Shubhangi Saraf Circuit ComplexityTheory Of ComputingComputational Complexity TheoryEngineeringHomogeneous Circuit	2014	20

Page 1