Shashank Srivastava
I am a joint postdoc at DIMACS, Rutgers and IAS, Princeton, where I work in Theoretical Computer Science. My current research is centered around Coding Theory, Pseudorandomness and Sum-of-Squares algorithms.
I obtained my PhD from TTI Chicago where I was fortunate to be advised by Prof Madhur Tulsiani. Before that, I did a B.Tech. in Computer Science from IIT Kharagpur, India. Here's my CV.
Publications:
Improved List Size for Folded Reed-Solomon Codes, SODA 2025
(with Tushant Mittal and Madhur Tulsiani)
List Decodable Quantum LDPC Codes, Manuscript.(with Fernando Granha Jeronimo and Madhur Tulsiani)
List Decoding of Tanner and Expander Amplified Codes from Distance Certificates, FOCS 2023
[Paper] [Slides] [Talk](with Fernando Granha Jeronimo and Madhur Tulsiani)
Near-linear Time Decoding of Ta-Shma's Codes via Splittable Regularity, STOC 2021
[Paper](with Fernando Granha Jeronimo, Dylan Quintana and Madhur Tulsiani)
Unique Decoding of Explicit Epsilon-Balanced Codes Near the Gilbert-Varshamov Bound, FOCS 2020 (invited to special issue)
[Paper](with Vedat Levi Alev, Fernando Granha Jeronimo, Dylan Quintana and Madhur Tulsiani)
List Decoding of Direct Sum Codes, SODA 2020
[Paper]
PhD Thesis: Continuous Optimization for Decoding Errors
[ArXiv]
Teaching (as a TA):
Mathematical Toolkit, 2019
Algorithms, 2021
Mathematical Toolkit, 2021
Information and Coding Theory, 2022
Mathematical Toolkit, 2023
Service:
I subreviewed for the conferences SODA 2025, STOC 2024, RANDOM 2023, STOC 2023, CCC 2022 and STACS 2022. I also reviewed for the journal Combinatorica.