Sumegha Garg

I am a PhD student in the Department of Computer Science at Princeton University. I am extremely fortunate to be advised by Mark Braverman. Before coming here, I finished my undergraduate studies in the Department of Computer Science and Engineering at Indian Institute of Technology, Delhi.

I am interested in Theoretical Computer Science, particularly in information theory, complexity theory and quantum computing.

Sumegha Garg,
Department of Computer Science,
Princeton University,
35 Olden Street,
Princeton, NJ - 08540



sumeghag AT cs dot princeton dot edu
sumegha dot garg AT gmail dot com
Research Papers

Hitting Sets with Near-Optimal Error for Read-Once Branching Programs

- with Mark Braverman and Gil Cohen. STOC 2018. [ECCC]

Extractor-Based Time-Space Lower Bounds for Learning

- with Ran Raz and Avishay Tal. STOC 2018. [ECCC]

The space complexity of mirror games

- with Jon Schneider. Manuscript 2017. [arXiv]

Network coding in undirected graphs is either very helpful or not helpful at all

- with Mark Braverman and Ariel Schvartzman. ITCS 2017. Invited paper [arXiv]

New security notions and feasibility results for authentication of quantum data

- with Henry Yuen and Mark Zhandry. QCrypt 2016. Crypto 2017. [arXiv]

Princeton University

IIT Delhi