|
491 |
Tools and Algorithms for the Construction and Analysis of Systems
Cham : Springer Nature Switzerland, Imprint: Springer, 2025, 1st ed. 2025
|
|
|
|
492 |
Towards fair decentralized benchmarking of healthcare AI algorithms with the Federated Tumor Segmentation (FeTS) challenge
Zenk, Maximilian. - Frankfurt am Main : Universitätsbibliothek Johann Christian Senckenberg, 2025
|
|
|
|
493 |
Towards scalable and transparent ML algorithms
Blücher, Stefan. - Berlin : Technische Universität Berlin, 2025
|
|
|
|
494 |
Triangles Improve 0.878 Approximation for Maxcut
George, Fredie. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
495 |
U-Index: A Universal Indexing Framework for Matching Long Patterns
Ayad, Lorraine A. K.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
496 |
Unintuitive Facts About Distances on Planar Graphs (Invited Talk)
Chang, Hsien-Chih. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
497 |
Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
Ashvinkumar, Vikrant. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
498 |
We Are What We Index; a Primer for the Wheeler Graph Era (Invited Talk)
Langmead, Ben. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
499 |
Weight Reduction in Distributed Protocols: New Algorithms and Analysis
Zinovyev, Anatoliy. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
500 |
Weighted Matching in a Poly-Streaming Model
Ullah, Ahammed. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
