|
1 |
A Randomized Rounding Approach for DAG Edge Deletion Kalantarzadeh, Sina. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
2 |
B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load Safavi, Roodabeh. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
3 |
Lifting to Randomized Parity Decision Trees Byramji, Farzan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
4 |
Randomized algorithms to generate hypergraphs with given degree sequences Ascolese, Michela. - Hamburg : Technische Universität Hamburg. Universitätsbibliothek, 2025
|
|
|
5 |
Searching for Falsified Clause in Random (logn})-CNFs Is Hard for Randomized Communication Riazanov, Artur. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
6 |
Combining randomized and deterministic iterative algorithms for high accuracy solution of large linear systems and boundary integral equations Enthalten in Monte Carlo methods and applications Bd. 31, 2025, Nr. 2: 145-162. 18 S.
|
|
|
7 |
Randomized Algorithms for Computing the Generalized Tensor SVD Based on the Tensor Product Enthalten in Communications on applied mathematics and computation 23.1.2025: 1-17
|
|
|
8 |
Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private Tětek, Jakub. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
9 |
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding Doron-Arad, Ilan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
10 |
An Optimal Randomized Algorithm for Finding the Saddlepoint Dallant, Justin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|