Sumegha Garg

Orcid: 0000-0002-8069-6655

According to our database1, Sumegha Garg authored at least 18 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Testing Tensor Products of Algebraic Codes.
CoRR, 2024

A New Information Complexity Measure for Multi-pass Streaming with Applications.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Oracle Efficient Online Multicalibration and Omniprediction.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2021
Tight Space Complexity of the Coin Problem.
Electron. Colloquium Comput. Complex., 2021

Memory-Sample Lower Bounds for Learning Parity with Noise.
Proceedings of the Approximation, 2021

2020
Implications of Space-Bounded Computation
PhD thesis, 2020

Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs.
SIAM J. Comput., 2020

The Coin Problem with Applications to Data Streams.
Electron. Colloquium Comput. Complex., 2020

The Role of Randomness and Noise in Strategic Classification.
Proceedings of the 1st Symposium on Foundations of Responsible Computing, 2020

Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG.
Proceedings of the Approximation, 2020

2019
Time-Space Lower Bounds for Two-Pass Learning.
Electron. Colloquium Comput. Complex., 2019

The Space Complexity of Mirror Games.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Tracking and Improving Information in the Service of Fairness.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2017
New security notions and feasibility results for authentication of quantum data.
IACR Cryptol. ePrint Arch., 2017

Extractor-Based Time-Space Lower Bounds for Learning.
Electron. Colloquium Comput. Complex., 2017

Hitting Sets with Near-Optimal Error for Read-Once Branching Programs.
Electron. Colloquium Comput. Complex., 2017

Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Network coding in undirected graphs is either very helpful or not helpful at all.
CoRR, 2016


  Loading...