Oded Goldreich
where else to find them
what they talk about
where they keep going back
- ITCS2 editions2022–2023
on a stage with
- Dana Rononce
- Guy N. Rothblumonce
- Marshall Ballonce
all 5 in the filters
who talks about the same things
- Yuval Filmus9 talks
- Guy N. Rothblum10 talks
- Dor Minzer8 talks
- Rotem Oshman4 talks
- Omer Reingold5 talks
- Yuval Ishai8 talks
| title | conference | date |
|---|---|---|
| Recent Developments in Testing Bounded-Degree Graphs | Workshop on Local Algorithms (WoLA) 2024 | 2024-08-05 |
Bounded-degree graphs are tested via the incident-function oracle with constant degree d; the talk gives three concrete developments: a two-graph isomorphism… | ||
| On Interactive Proofs of Proximity with Proof-Oblivious Queries | ITCS 2023 | 2023-01-10 |
Authors Oded Goldreich, Guy N. Rothblum and Tal Skverer show a concrete exponential separation between property testing and interactive proofs of proximity… | ||
| Testing Distributions of Huge Objects | ITCS 2022 | 2022-01-31 |
Defines the DOHO model—sampling distributions over length-n strings with queries to sampled bits and distance measured by the earthmover's distance under… | ||
| Randomness Extraction from Somewhat Dependent Sources | ITCS 2022 | 2022-01-31 |
Defines three dependence models and gives sharp positive and negative results: T-coordinated sources admit deterministic extraction — any two‑source extractor… | ||
| nothing matches | ||