default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeghal Gupta
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Avrim Blum, Meghal Gupta, Gene Li, Naren Sarayu Manoj
, Aadirupa Saha, Yuanyuan Yang:
Dueling Optimization with a Monotone Adversary. ALT 2024: 221-243- [c9]Eden Fargion, Ran Gelles, Meghal Gupta:
Interactive Coding with Unbounded Noise. APPROX/RANDOM 2024: 43:1-43:16 - [c8]Meghal Gupta:
Constant Query Local Decoding against Deletions Is Impossible. STOC 2024: 752-763 - [i25]Meghal Gupta, Mihir Singhal, Hongxun Wu:
Optimal quantile estimation: beyond the comparison model. CoRR abs/2404.03847 (2024) - [i24]Meghal Gupta, Venkatesan Guruswami, Mihir Singhal:
Tight bounds for stream decodable error-correcting codes. CoRR abs/2407.06446 (2024) - [i23]Eden Fargion, Ran Gelles, Meghal Gupta:
Interactive Coding with Unbounded Noise. CoRR abs/2407.09463 (2024) - [i22]Meghal Gupta, Rachel Yun Zhang:
List Decoding Bounds for Binary Codes with Noiseless Feedback. CoRR abs/2410.01951 (2024) - [i21]Meghal Gupta, Mihir Singhal, Hongxun Wu:
Optimal quantile estimation: beyond the comparison model. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c7]Meghal Gupta, Rachel Yun Zhang:
Interactive Error Correcting Codes: New Constructions and Impossibility Bounds. APPROX/RANDOM 2023: 32:1-32:14 - [c6]Ofer Grossman, Meghal Gupta, Mark Sellke:
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. FOCS 2023: 1496-1504 - [c5]Meghal Gupta, Naren Sarayu Manoj:
An Optimal Algorithm for Certifying Monotone Functions. SOSA 2023: 207-212 - [c4]Meghal Gupta, Rachel Yun Zhang:
Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary Channel. STOC 2023: 1449-1462 - [c3]Meghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang:
Binary Error-Correcting Codes with Minimal Noiseless Feedback. STOC 2023: 1475-1487 - [i20]Ofer Grossman, Meghal Gupta, Mark Sellke:
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. CoRR abs/2304.01438 (2023) - [i19]Meghal Gupta, Rachel Yun Zhang:
A New Upper Bound on the Maximal Error Resilience of Interactive Error-Correcting Codes. CoRR abs/2305.04376 (2023) - [i18]Meghal Gupta, Rachel Yun Zhang:
A Noise Resilient Transformation for Streaming Algorithms. CoRR abs/2307.07087 (2023) - [i17]Meghal Gupta, Rachel Yun Zhang:
On Interactive Coding Schemes with Adaptive Termination. CoRR abs/2309.04586 (2023) - [i16]Meghal Gupta:
Constant Query Local Decoding Against Deletions Is Impossible. CoRR abs/2311.08399 (2023) - [i15]Avrim Blum, Meghal Gupta, Gene Li, Naren Sarayu Manoj, Aadirupa Saha, Yuanyuan Yang:
Dueling Optimization with a Monotone Adversary. CoRR abs/2311.11185 (2023) - [i14]Meghal Gupta:
Constant Query Local Decoding Against Deletions Is Impossible. Electron. Colloquium Comput. Complex. TR23 (2023) - [i13]Meghal Gupta, Rachel Yun Zhang:
A Noise Resilient Transformation for Streaming Algorithms. Electron. Colloquium Comput. Complex. TR23 (2023) - [i12]Meghal Gupta, Rachel Yun Zhang:
On Interactive Coding Schemes with Adaptive Termination. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c2]Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang:
Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption. STOC 2022: 609-622 - [c1]Meghal Gupta, Rachel Yun Zhang:
The optimal error resilience of interactive communication over binary channels. STOC 2022: 948-961 - [i11]Meghal Gupta, Rachel Yun Zhang:
Positive Rate Binary Interactive Error Correcting Codes Resilient to >1/2 Adversarial Erasures. CoRR abs/2201.11929 (2022) - [i10]Meghal Gupta, Naren Sarayu Manoj:
An Optimal Algorithm for Certifying Monotone Functions. CoRR abs/2204.01224 (2022) - [i9]Meghal Gupta, Rachel Yun Zhang:
Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel. CoRR abs/2207.01144 (2022) - [i8]Meghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang:
Binary Error-Correcting Codes with Minimal Noiseless Feedback. CoRR abs/2212.05673 (2022) - [i7]Meghal Gupta, Naren Manoj:
An Optimal Algorithm for Certifying Monotone Functions. Electron. Colloquium Comput. Complex. TR22 (2022) - [i6]Meghal Gupta, Rachel Yun Zhang:
Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i5]Meghal Gupta, Rachel Yun Zhang:
The Optimal Error Resilience of Interactive Communication Over Binary Channels. CoRR abs/2110.15395 (2021) - [i4]Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang:
Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac12$ Adversarial Corruption. CoRR abs/2111.04181 (2021) - [i3]Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang:
Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac12$ Adversarial Corruption. IACR Cryptol. ePrint Arch. 2021: 1481 (2021) - [i2]Meghal Gupta, Rachel Yun Zhang:
The Optimal Error Resilience of Interactive Communication Over Binary Channels. IACR Cryptol. ePrint Arch. 2021: 1482 (2021)
2010 – 2019
- 2016
- [i1]Jesse Geneson, Meghal Gupta:
Bounding extremal functions of forbidden 0-1 matrices using (r, s)-formations. CoRR abs/1603.06124 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
