default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSumegha Garg
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Sumegha Garg, Christopher Jung, Omer Reingold, Aaron Roth:
Oracle Efficient Online Multicalibration and Omniprediction. SODA 2024: 2725-2792- [c13]Mark Braverman
, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, Jiapeng Zhang:
A New Information Complexity Measure for Multi-pass Streaming with Applications. STOC 2024: 1781-1792 - [i17]Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, Jiapeng Zhang:
A New Information Complexity Measure for Multi-pass Streaming with Applications. CoRR abs/2403.20283 (2024) - [i16]Sumegha Garg, Madhu Sudan, Gabriel Wu:
Testing Tensor Products of Algebraic Codes. CoRR abs/2410.22606 (2024) - 2023
- [i15]Sumegha Garg, Christopher Jung, Omer Reingold, Aaron Roth:
Oracle Efficient Online Multicalibration and Omniprediction. CoRR abs/2307.08999 (2023) - 2021
- [c12]Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz:
Memory-Sample Lower Bounds for Learning Parity with Noise. APPROX-RANDOM 2021: 60:1-60:19 - [c11]Mark Braverman, Sumegha Garg, Or Zamir:
Tight Space Complexity of the Coin Problem. FOCS 2021: 1068-1079 - [i14]Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz:
Memory-Sample Lower Bounds for Learning Parity with Noise. CoRR abs/2107.02320 (2021) - [i13]Mark Braverman, Sumegha Garg, Or Zamir:
Tight Space Complexity of the Coin Problem. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [b1]Sumegha Garg:
Implications of Space-Bounded Computation. Princeton University, USA, 2020 - [j1]Mark Braverman, Gil Cohen, Sumegha Garg:
Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs. SIAM J. Comput. 49(5) (2020) - [c10]Sumegha Garg, Pravesh K. Kothari, Ran Raz:
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. APPROX-RANDOM 2020: 21:1-21:18 - [c9]Mark Braverman, Sumegha Garg, David P. Woodruff:
The Coin Problem with Applications to Data Streams. FOCS 2020: 318-329 - [c8]Mark Braverman, Sumegha Garg:
The Role of Randomness and Noise in Strategic Classification. FORC 2020: 9:1-9:20 - [i12]Sumegha Garg, Pravesh K. Kothari, Ran Raz:
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. CoRR abs/2002.07235 (2020) - [i11]Mark Braverman, Sumegha Garg:
The Role of Randomness and Noise in Strategic Classification. CoRR abs/2005.08377 (2020) - [i10]Mark Braverman, Sumegha Garg, David P. Woodruff:
The Coin Problem with Applications to Data Streams. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c7]Sumegha Garg, Ran Raz, Avishay Tal:
Time-Space Lower Bounds for Two-Pass Learning. CCC 2019: 22:1-22:39 - [c6]Sumegha Garg, Michael P. Kim, Omer Reingold:
Tracking and Improving Information in the Service of Fairness. EC 2019: 809-824 - [c5]Sumegha Garg, Jon Schneider:
The Space Complexity of Mirror Games. ITCS 2019: 36:1-36:14 - [i9]Sumegha Garg, Michael P. Kim, Omer Reingold:
Tracking and Improving Information in the Service of Fairness. CoRR abs/1904.09942 (2019) - [i8]Sumegha Garg, Ran Raz, Avishay Tal:
Time-Space Lower Bounds for Two-Pass Learning. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c4]Mark Braverman, Gil Cohen, Sumegha Garg:
Hitting sets with near-optimal error for read-once branching programs. STOC 2018: 353-362 - [c3]Sumegha Garg, Ran Raz, Avishay Tal:
Extractor-based time-space lower bounds for learning. STOC 2018: 990-1002 - 2017
- [c2]Sumegha Garg, Henry Yuen, Mark Zhandry:
New Security Notions and Feasibility Results for Authentication of Quantum Data. CRYPTO (2) 2017: 342-371 - [c1]Mark Braverman, Sumegha Garg, Ariel Schvartzman:
Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All. ITCS 2017: 18:1-18:18 - [i7]Sumegha Garg, Ran Raz, Avishay Tal:
Extractor-Based Time-Space Lower Bounds for Learning. CoRR abs/1708.02639 (2017) - [i6]Sumegha Garg, Jon Schneider:
The space complexity of mirror games. CoRR abs/1710.02898 (2017) - [i5]Mark Braverman, Gil Cohen, Sumegha Garg:
Hitting Sets with Near-Optimal Error for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR17 (2017) - [i4]Sumegha Garg, Ran Raz, Avishay Tal:
Extractor-Based Time-Space Lower Bounds for Learning. Electron. Colloquium Comput. Complex. TR17 (2017) - [i3]Sumegha Garg, Henry Yuen, Mark Zhandry:
New security notions and feasibility results for authentication of quantum data. IACR Cryptol. ePrint Arch. 2017: 538 (2017) - 2016
- [i2]Sumegha Garg, Henry Yuen, Mark Zhandry:
New security notions and feasibility results for authentication of quantum data. CoRR abs/1607.07759 (2016) - [i1]Mark Braverman, Sumegha Garg, Ariel Schvartzman:
Network coding in undirected graphs is either very helpful or not helpful at all. CoRR abs/1608.06545 (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-12-01 00:18 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:
