|
411 |
Card-Based Cryptography Meets Differential Privacy
Eriguchi, Reo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
412 |
Coboundary and Cosystolic Expansion Without Dependence on Dimension or Degree
Dikstein, Yotam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
413 |
Comparing artificial intelligence algorithms to 157 German dermatologists: the melanoma classification benchmark
Brinker, Titus Josef. - Würzburg : Universität Würzburg, 2024
|
|
|
|
414 |
Comparing linear discriminant analysis and supervised learning algorithms for binary classification - a method comparison study
Graf, Ricarda. - Augsburg : Universität Augsburg, 2024
|
|
|
|
415 |
Comparing machine learning algorithms by union-free generic depth
Blocher, Hannah. - Ludwig-Maximilians-Universität München, 2024
|
|
|
|
416 |
Competitive Capacitated Online Recoloring
Rajaraman, Rajmohan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
417 |
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
Bampis, Evripidis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
418 |
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs
Lozin, Vadim. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
419 |
Complexity of Local Search for Euclidean Clustering Problems
Manthey, Bodo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
420 |
Composition Orderings for Linear Functions and Matrix Multiplication Orderings
Kubo, Susumu. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
