• 489 Citations
  • 14 h-Index
20092020
If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Dive into the research topics where Shubhangi Saraf is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 3 Similar Profiles
Arithmetic Circuits Mathematics
Polynomials Engineering & Materials Science
Lower bound Mathematics
Decoding Engineering & Materials Science
Testing Mathematics
Polynomial Identities Mathematics
Networks (circuits) Engineering & Materials Science
Galois field Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2009 2020

  • 489 Citations
  • 14 h-Index
  • 29 Conference contribution
  • 20 Article

Deep-FRI: Sampling outside the box improves soundness

Saraf, S., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 5. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 151).

Rutgers, The State University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sampling
Network protocols
Reed-Solomon codes
Decoding
Hamming distance

On list recovery of high-rate tensor codes

Kopparty, S. & Saraf, S., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 68. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

Rutgers, The State University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tensors
Decoding
Recovery
Line
Theorem
Subspace
Three-dimensional
Configuration

Black-Box Identity Testing of Depth-4 Multilinear Circuits

Saraf, S., Oct 1 2018, In : Combinatorica. 38, 5, p. 1205-1238 34 p.

Rutgers, The State University

Research output: Contribution to journalArticle

Black-box testing
Black Box
Polynomials
Testing
Networks (circuits)

Deterministic factorization of sparse polynomials with bounded individual degree

Saraf, S., Nov 30 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 485-496 12 p. 8555131. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

Rutgers, The State University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Factorization
Polynomials
Geometry