|
11 |
On the Composition of Randomized Query Complexity and Approximate Degree
Chakraborty, Sourav. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
12 |
Formalization of Randomized Approximation Algorithms for Frequency Moments
Karayel, Emin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
13 |
Field Geometry and the Spatial and Temporal Generalization of Crop Classification Algorithms - A randomized Approach to compare Pixel based and Convolution based Methods
Gilcher, Mario. - Trier : Universität Trier, 2021
|
|
|
|
14 |
The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential
Ayyadevara, Nikhil. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
15 |
Correction to: Verification of randomized consensus algorithms under round-rigid adversaries
Enthalten in International journal on software tools for technology transfer 30.5.2021: 1
|
|
|
|
16 |
When Is Amplification Necessary for Composition in Randomized Query Complexity?
Ben-David, Shalev. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
17 |
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum
Jin, Ce. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
18 |
Geometric Crossing-Minimization - A Scalable Randomized Approach
Radermacher, Marcel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
19 |
Randomized Algorithms for High-Dimensional Integration and Approximation
Marcin, Wnuk. - Kiel : Universitätsbibliothek Kiel, 2019
|
|
|
|
20 |
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets
Boissonnat, Jean-Daniel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
Administration
