|
11 |
Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling
Enthalten in Journal of optimization theory and applications 8.1.2021: 1-23
|
|
|
12 |
Streaming Complexity of SVMs
Andoni, Alexandr. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
13 |
When Is Amplification Necessary for Composition in Randomized Query Complexity?
Ben-David, Shalev. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
14 |
The Complexity of Partial Function Extension for Coverage Functions
Bhaskar, Umang. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
15 |
The Query Complexity of Mastermind with l_p Distances
Fernández V, Manuel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
16 |
Approximate Degree and the Complexity of Depth Three Circuits
Bun, Mark. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
17 |
Communication Complexity of Correlated Equilibrium with Small Support
Ganor, Anat. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
18 |
Lower Bounds for Approximating Graph Parameters via Communication Complexity
Eden, Talya. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
19 |
Round Complexity Versus Randomness Complexity in Interactive Proofs
Leshkowitz, Maya. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
20 |
Communication Complexity of Statistical Distance
Watson, Thomas. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
Administration
