Sumegha Garg - Professional Activities

Rutgers/DIMACS Theory of Computing Seminar, September 2023 - present

TCS+ (an online seminar series in theoretical computer science), 2020 - present

Harvard Theory Seminar, 2021-22

Princeton TCS Seminar, 2017-18

New Information Complexity Measure for Multi-pass Streaming Algorithms

Theory Lunch @ Princeton, December 2023

Online Omniprediction

Computer Science/Discrete Mathematics Seminar(I) at IAS, December 2023

Rutgers/DIMACS Theory of Computing Seminar, November 2023

Workshop on Multigroup Fairness and Statistical Validity at Simons Institute, Berkeley, April 2023

Tight Space Complexity of the Coin Problem

Workshop on Structural Results at Simons Institute, Berkeley, July 2023

Women in Theory Forum at Stanford, November 2022

Rutgers/DIMACS Theory of Computing Seminar (Online), December 2021

The Coin Problem with Applications to Data Streams

Workshop on Algorithms for Large Data (Online), August 2021

TCS+ Talk, November 2020

Algorithms Seminar at Duke University, October 2020

Theory Seminar Series at UT Austin, October 2020

Extractor-based Approach to Proving Memory-Sample Lower Bounds for Learning

Workshop on Information-Computation Trade-offs at Simons Institute, Berkeley, September 2021

Computer Science/Discrete Mathematics Seminar(I) at IAS, December 2020

ARC Colloquium Series at Georgia Tech, October 2020

Junior Theorists Workshop at Northwestern University, November 2019

Oxford Complexity Day at University of Oxford, July 2018

Pseudorandom Pseudo-Distributions with Near-Optimal Error for ROBPs

STOC 2020 Workshop: Derandomizing Space-Bounded Computation, June 2020

Theory Seminar at Cornell University, December 2019

Rutgers/DIMACS Theory of Computing Seminar, March 2018

Network Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All

Workshop on Interactive Complexity at Simons Institute, Berkeley, October 2018