|
1 |
Doubly Sub-Linear Interactive Proofs of Proximity
Amir, Noga. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
2 |
Testing Distributions of Huge Objects
Enthalten in TheoretiCS Bd. 2, 2023
|
|
|
|
3 |
Randomness Extraction from Somewhat Dependent Sources
Ball, Marshall. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
4 |
Testing Distributions of Huge Objects
Goldreich, Oded. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
5 |
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
Enthalten in TheoretiCS Bd. 1, 2022
|
|
|
|
6 |
Communication Complexity with Defective Randomness
Ball, Marshall. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
7 |
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
Goldreich, Oded. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
8 |
The Subgraph Testing Model
Goldreich, Oded. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
9 |
On Randomness Extraction in AC0
Goldreich, Oded. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
|
|
|
|
10 |
On interactive proofs with a laconic prover
Enthalten in Computational complexity Bd. 11, Nr. 1-2, date:6.2002: 1-53
|
|
Administration
