Network coding in undirected graphs is either very helpful or not helpful at all. - Mark Braverman; Sumegha Garg; Ariel Schvartzman (CoRR, 2016)

Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All. - Mark Braverman; Sumegha Garg; Ariel Schvartzman (ITCS, 2017)

Hitting Sets with Near-Optimal Error for Read-Once Branching Programs. - Mark Braverman; Gil Cohen; Sumegha Garg (Electron. Colloquium Comput. Complex., 2017)

Extractor-Based Time-Space Lower Bounds for Learning. - Sumegha Garg; Ran Raz; Avishay Tal (Electron. Colloquium Comput. Complex., 2017)

New security notions and feasibility results for authentication of quantum data. - Sumegha Garg; Henry Yuen; Mark Zhandry (IACR Cryptol. ePrint Arch., 2017)

Tracking and Improving Information in the Service of Fairness. - Sumegha Garg; Michael P. Kim; Omer Reingold (EC, 2019)

The Space Complexity of Mirror Games. - Sumegha Garg; Jon Schneider (ITCS, 2019)

Time-Space Lower Bounds for Two-Pass Learning. - Sumegha Garg; Ran Raz; Avishay Tal (Electron. Colloquium Comput. Complex., 2019)

Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. - Sumegha Garg; Pravesh K. Kothari; Ran Raz (APPROX-RANDOM, 2020)

The Role of Randomness and Noise in Strategic Classification. - Mark Braverman; Sumegha Garg (FORC, 2020)

The Coin Problem with Applications to Data Streams. - Mark Braverman; Sumegha Garg; David P. Woodruff (Electron. Colloquium Comput. Complex., 2020)

Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs. - Mark Braverman; Gil Cohen; Sumegha Garg (SIAM J. Comput., 2020)

Implications of Space-Bounded Computation - Sumegha Garg (2020)

Memory-Sample Lower Bounds for Learning Parity with Noise. - Sumegha Garg; Pravesh K. Kothari; Pengda Liu; Ran Raz (APPROX-RANDOM, 2021)

Tight Space Complexity of the Coin Problem. - Mark Braverman; Sumegha Garg; Or Zamir (Electron. Colloquium Comput. Complex., 2021)

Oracle Efficient Online Multicalibration and Omniprediction. - Sumegha Garg; Christopher Jung 001; Omer Reingold; Aaron Roth 001 (SODA, 2024)

A New Information Complexity Measure for Multi-pass Streaming with Applications. - Mark Braverman; Sumegha Garg; Qian Li 012; Shuo Wang; David P. Woodruff; Jiapeng Zhang (STOC, 2024)

Testing Tensor Products of Algebraic Codes. - Sumegha Garg; Madhu Sudan; Gabriel Wu (CoRR, 2024)

The Space Complexity of Learning-Unlearning Algorithms. - Yeshwanth Cherapanamjeri; Sumegha Garg; Nived Rajaraman; Ayush Sekhari; Abhishek Shetty (CoRR, 2025)