|
1 |
Randomized algorithms to generate hypergraphs with given degree sequences
Ascolese, Michela. - Hamburg : Technische Universität Hamburg. Universitätsbibliothek, 2025
|
|
|
|
2 |
Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private
Tětek, Jakub. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
3 |
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding
Doron-Arad, Ilan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
4 |
An Optimal Randomized Algorithm for Finding the Saddlepoint
Dallant, Justin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
5 |
Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov Complexity
Goldberg, Halley. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
6 |
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional
Abrahamsen, Mikkel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
7 |
Qubit-efficient randomized quantum algorithms for linear algebra
Wang, Samson. - Aachen : Universitätsbibliothek der RWTH Aachen, 2024
|
|
|
8 |
Convergence in distribution of randomized algorithms: the case of partially separable optimization
Enthalten in Mathematical programming 27.7.2024: 1-36
|
|
|
|
9 |
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle
Enthalten in Algorithmica 12.6.2024: 1-20
|
|
|
|
10 |
Fair Grading Algorithms for Randomized Exams
Chen, Jiale. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
Administration
