|
411 |
Bounds on Worst-Case Responsiveness for Agreement Algorithms
Attiya, Hagit. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
412 |
Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms
Balev, Stefan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
413 |
Buffered Streaming Edge Partitioning
Chhabra, Adil. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
414 |
Capacity-Achieving Gray Codes
Guruswami, Venkatesan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
415 |
Card-Based Cryptography Meets Differential Privacy
Eriguchi, Reo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
416 |
Coboundary and Cosystolic Expansion Without Dependence on Dimension or Degree
Dikstein, Yotam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
417 |
Comparing artificial intelligence algorithms to 157 German dermatologists: the melanoma classification benchmark
Brinker, Titus Josef. - Würzburg : Universität Würzburg, 2024
|
|
|
|
418 |
Comparing linear discriminant analysis and supervised learning algorithms for binary classification - a method comparison study
Graf, Ricarda. - Augsburg : Universität Augsburg, 2024
|
|
|
|
419 |
Comparing machine learning algorithms by union-free generic depth
Blocher, Hannah. - Ludwig-Maximilians-Universität München, 2024
|
|
|
|
420 |
Competitive Capacitated Online Recoloring
Rajaraman, Rajmohan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
