Some Talks by Oded Goldreich
last updated: July 2024
This webpage records very old slides and more recent PPT presentations
for various talks. The organization and annotation is quite tentative.
- General opinions
- Surveys
- Specific works: Cryptography and Complexity
- Specific works: Property Testing
- On Proximity Oblivius Testers (2008):
1,
2,
and 3
- On testing computability by small width OBDDs
(2010)
- Proximity Oblivious Testers and the Role of Invariances
(2011)
- Testing Graph Blow-ups (2011)
- Finding cycles and trees in sublinear time
(2013)
- A double feature (on property testing):
combining the two forgoing talks (2011).
- On Multiple-Instance Problems in Property Testing
2014
- A double feature (on property testing):
combining the above talk with a presetation on lower bounds
based on communication complexity (2013).
- On Testing Dynamic Environments:
notes (2016)
- Every Set in P is Strongly Testable Under a Suitable Encoding
(2019)
- Vertex-Distribution-Free Testing of Graphs
(2019)
- On testing subgraphs (2019).
- Adaptivity vs Non-adaptivity in the context of Testing
Graphs in the Dense Model (2021).
- Testing Distributions of Huge Objects (2022).
- Recent developments in testing
bounded degree graphs, Aug 2024.
- On the importance of scale:
Reflections on some of Ronitt Rubinfeld's works, Aug 2024.
- Personal angles
Back to Oded Goldreich's homepage.