Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 33 matches
- 2024
- Avrim Blum, Meghal Gupta, Gene Li, Naren Sarayu Manoj, Aadirupa Saha, Yuanyuan Yang:
Dueling Optimization with a Monotone Adversary. ALT 2024: 221-243 - Meghal Gupta:
Constant Query Local Decoding against Deletions Is Impossible. STOC 2024: 752-763 - Meghal Gupta, Mihir Singhal, Hongxun Wu:
Optimal quantile estimation: beyond the comparison model. CoRR abs/2404.03847 (2024) - Meghal Gupta, Venkatesan Guruswami, Mihir Singhal:
Tight bounds for stream decodable error-correcting codes. CoRR abs/2407.06446 (2024) - Eden Fargion, Ran Gelles, Meghal Gupta:
Interactive Coding with Unbounded Noise. CoRR abs/2407.09463 (2024) - Meghal Gupta, Mihir Singhal, Hongxun Wu:
Optimal quantile estimation: beyond the comparison model. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- Meghal Gupta, Rachel Yun Zhang:
Interactive Error Correcting Codes: New Constructions and Impossibility Bounds. APPROX/RANDOM 2023: 32:1-32:14 - Ofer Grossman, Meghal Gupta, Mark Sellke:
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. FOCS 2023: 1496-1504 - Meghal Gupta, Naren Sarayu Manoj:
An Optimal Algorithm for Certifying Monotone Functions. SOSA 2023: 207-212 - Meghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang:
Binary Error-Correcting Codes with Minimal Noiseless Feedback. STOC 2023: 1475-1487 - Meghal Gupta, Rachel Yun Zhang:
Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary Channel. STOC 2023: 1449-1462 - Ofer Grossman, Meghal Gupta, Mark Sellke:
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. CoRR abs/2304.01438 (2023) - Meghal Gupta, Rachel Yun Zhang:
A New Upper Bound on the Maximal Error Resilience of Interactive Error-Correcting Codes. CoRR abs/2305.04376 (2023) - Meghal Gupta, Rachel Yun Zhang:
A Noise Resilient Transformation for Streaming Algorithms. CoRR abs/2307.07087 (2023) - Meghal Gupta, Rachel Yun Zhang:
On Interactive Coding Schemes with Adaptive Termination. CoRR abs/2309.04586 (2023) - Meghal Gupta:
Constant Query Local Decoding Against Deletions Is Impossible. CoRR abs/2311.08399 (2023) - Avrim Blum, Meghal Gupta, Gene Li, Naren Sarayu Manoj, Aadirupa Saha, Yuanyuan Yang:
Dueling Optimization with a Monotone Adversary. CoRR abs/2311.11185 (2023) - Meghal Gupta:
Constant Query Local Decoding Against Deletions Is Impossible. Electron. Colloquium Comput. Complex. TR23 (2023) - Meghal Gupta, Rachel Yun Zhang:
A Noise Resilient Transformation for Streaming Algorithms. Electron. Colloquium Comput. Complex. TR23 (2023) - Meghal Gupta, Rachel Yun Zhang:
On Interactive Coding Schemes with Adaptive Termination. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang:
Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption. STOC 2022: 609-622 - Meghal Gupta, Rachel Yun Zhang:
The optimal error resilience of interactive communication over binary channels. STOC 2022: 948-961 - Meghal Gupta, Rachel Yun Zhang:
Positive Rate Binary Interactive Error Correcting Codes Resilient to >1/2 Adversarial Erasures. CoRR abs/2201.11929 (2022) - Meghal Gupta, Naren Sarayu Manoj:
An Optimal Algorithm for Certifying Monotone Functions. CoRR abs/2204.01224 (2022) - Meghal Gupta, Rachel Yun Zhang:
Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel. CoRR abs/2207.01144 (2022) - Meghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang:
Binary Error-Correcting Codes with Minimal Noiseless Feedback. CoRR abs/2212.05673 (2022) - Meghal Gupta, Naren Manoj:
An Optimal Algorithm for Certifying Monotone Functions. Electron. Colloquium Comput. Complex. TR22 (2022) - Meghal Gupta, Rachel Yun Zhang:
Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Meghal Gupta, Rachel Yun Zhang:
The Optimal Error Resilience of Interactive Communication Over Binary Channels. CoRR abs/2110.15395 (2021) - 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)
skipping 3 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-08 16:04 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint