All papers represent equal contribution, and authors are listed in alphabetical order.
A Classical Quadratic Speedup for Planted kXOR 🔗
Meghal Gupta, William He, Ryan O'Donnell, Noah Singer (2025)
SODA 2026
Few Single Qubit Measurements Suffice to Certify Any Quantum State 🔗
Meghal Gupta, William He, Ryan O'Donnell (2025)
QIP 2026 Short Plenary and Best Student Paper
List Decoding Bounds for Binary Codes with Noiseless Feedback 🔗
Meghal Gupta and Rachel Yun Zhang (2024)
ITCS 2025
Tight Bounds for Stream Decodable Error-Correcting Codes 🔗
Meghal Gupta, Venkatesan Guruswami, Mihir Singhal (2024)
CCC 2025
Interactive Coding with Unbounded Noise 🔗
Eden Fargion, Ran Gelles, Meghal Gupta (2024)
RANDOM 2024
Optimal Quantile Estimation: Beyond the Comparison Model 🔗
Meghal Gupta, Mihir Singhal, Hongxun Wu (2024)
FOCS 2024 Best Student Paper
Invited to SICOMP Special Issue for FOCS 2024
Dueling Optimization with a Monotone Adversary 🔗
Avrim Blum, Meghal Gupta, Gene Li, Naren Sarayu Manoj, Aadirupa Saha, Yuanyuan Yang (2023)
ALT 2024 Outstanding Paper Award
Constant Query Local Decoding Against Deletions Is Impossible 🔗
Meghal Gupta (2023)
STOC 2024
On Interactive Coding Schemes with Adaptive Termination 🔗
Meghal Gupta and Rachel Yun Zhang (2023)
A Noise Resilient Transformation for Streaming Algorithms 🔗
Meghal Gupta and Rachel Yun Zhang (2023)
ITCS 2025 Best Student Paper
A New Upper Bound on the Maximal Error Resilience of Interactive Error-Correcting Codes 🔗
Meghal Gupta and Rachel Yun Zhang (2023)
RANDOM 2023*
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting 🔗
Ofer Grossman, Meghal Gupta, Mark Sellke (2023)
FOCS 2023
Binary Error Correcting Codes with Minimal Noiseless Feedback 🔗
Meghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang (2022)
STOC 2023
Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel 🔗
Meghal Gupta and Rachel Yun Zhang (2022)
STOC 2023
An Optimal Algorithm for Certifying Monotone Functions 🔗
Meghal Gupta and Naren Sarayu Manoj (2022)
SOSA 2023
Positive Rate Binary Interactive Error Correcting Codes Resilient to >1/2 Adversarial Erasures 🔗
Meghal Gupta and Rachel Yun Zhang (2022)
RANDOM 2023*
The Optimal Error Resilience of Interactive Communication Over Binary Channels 🔗
Meghal Gupta and Rachel Yun Zhang (2021)
STOC 2022 Best Student Paper
Invited to SICOMP Special Issue for STOC 2022
Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to >1/2 Adversarial Corruption 🔗
Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang (2021)
STOC 2022
A formula for F-Polynomials in terms of C-Vectors and Stabilization of F-Polynomials 🔗
Meghal Gupta (2018)
Research conducted at Twin Cities REU
* These papers are combined in the RANDOM 2023 proceedings.
gamechanger