Meghal Gupta

Orcid: 0000-0001-7657-2847

According to our database1, Meghal Gupta authored at least 20 papers between 2016 and 2025.

Collaborative distances:

Timeline

2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
7
8
2
4
3
2
1
2
2
3
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
List Decoding Bounds for Binary Codes with Noiseless Feedback.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Error Correction for Message Streams.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024
Optimal quantile estimation: beyond the comparison model.
Electron. Colloquium Comput. Complex., 2024

Tight bounds for stream decodable error-correcting codes.
CoRR, 2024

Interactive Coding with Unbounded Noise.
Proceedings of the Approximation, 2024

Dueling Optimization with a Monotone Adversary.
Proceedings of the International Conference on Algorithmic Learning Theory, 2024

2023
On Interactive Coding Schemes with Adaptive Termination.
Electron. Colloquium Comput. Complex., 2023

A Noise Resilient Transformation for Streaming Algorithms.
Electron. Colloquium Comput. Complex., 2023

Constant Query Local Decoding Against Deletions Is Impossible.
Electron. Colloquium Comput. Complex., 2023

A New Upper Bound on the Maximal Error Resilience of Interactive Error-Correcting Codes.
CoRR, 2023

Binary Error-Correcting Codes with Minimal Noiseless Feedback.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Interactive Error Correcting Codes: New Constructions and Impossibility Bounds.
Proceedings of the Approximation, 2023

2022
Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel.
Electron. Colloquium Comput. Complex., 2022

An Optimal Algorithm for Certifying Monotone Functions.
Electron. Colloquium Comput. Complex., 2022

Positive Rate Binary Interactive Error Correcting Codes Resilient to >1/2 Adversarial Erasures.
CoRR, 2022

Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
The Optimal Error Resilience of Interactive Communication Over Binary Channels.
IACR Cryptol. ePrint Arch., 2021

Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac12$ Adversarial Corruption.
IACR Cryptol. ePrint Arch., 2021

2016
Bounding extremal functions of forbidden 0-1 matrices using (r, s)-formations.
CoRR, 2016


  Loading...