PUBLICATIONS

Constant Query Local Decoding Against Deletions Is Impossible πŸ”—
Meghal Gupta (2023)

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)

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 and Mark Sellke (2023)
FOCS 2023

Binary Error Correcting Codes with Minimal Noiseless Feedback πŸ”—
Meghal Gupta, Venkatesan Guruswami, and 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, and 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.