Sumegha Garg
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Tight Space Complexity of the Coin Problem | Structural Results 2023 | 2023-07-20 |
Proves a sharp threshold at c=1/3: read-once branching programs with effective width 1 and recursive AND–OR/majority gadgets achieve O(log n) width to detect… | ||
| Extractor-Based Approach To Memory-Sample Tradeoffs | Rigorous Evidence for Information-Computation Trade-offs | 2021-09-13 |
The paper proves concrete memory–sample lower bounds by modeling learners as branching programs and using an extractor-based matrix condition (every large… | ||
| Network Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All | Interactive Complexity 2018 | 2018-10-15 |
Main claim: either undirected networks never benefit from coding, or there exist undirected graphs where coding beats flow by a gap that grows to roughly a… | ||
| nothing matches | ||