David Zuckerman
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Eshan Chattopadhyayonce
- Jesse Goodmanonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| The Space Complexity of Sampling | ITCS 2022 | 2022-01-31 |
Shows explicit lower bounds: any read-once branching program of width 2^{0.01N} outputs a distribution exponentially far from the uniform distribution over a… | ||
| Explicit Two-Source Extractors and Resilient Functions | Connections Between Algorithm Design and Complexity Theory | 2015-09-28 |
Constructs an explicit two-source extractor that works for polylogarithmic min-entropy by combining a seeded non-malleable extractor (cycle over seeds to get… | ||
| Non-malleable Codes Against Constant Split-state Tampering | Coding: From Practice to Theory | 2015-02-19 |
Constructs the first explicit constant-rate for c=10 non-malleable code in the c split-state model, with exponentially small error and an efficient encoder… | ||
| nothing matches | ||