|
481 |
The Tape Reconfiguration Problem and Its Consequences for Dominating Set Reconfiguration Bousquet, Nicolas. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
482 |
Theoretical Methods, Algorithms, and Applications of Quantum Systems in Chemistry, Physics, and Biology Cham : Springer Nature Switzerland, Imprint: Springer, 2025, 1st ed. 2025
|
|
|
483 |
Thresholds and algorithms in Bayesian inference Krieg, Lena. - Dortmund : Universitätsbibliothek Dortmund, 2025
|
|
|
484 |
Tight Bounds for Some Classical Problems Parameterized by Cutwidth Bojikian, Narek. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
485 |
Tight Bounds on the Number of Closest Pairs in Vertical Slabs Biniaz, Ahmad. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
486 |
Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique Kumar, Nikhil. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
487 |
Time and Frequency Domain Analysis of IMU-Based Orientation Estimation Algorithms with Comparison to Robotic Arm Orientation as Reference Sultan, Ruslan. - Osnabrück : Hochschule Osnabrück, 2025
|
|
|
488 |
Time Lower Bounds for the Metropolis Process and Simulated Annealing Chen, Zongchen. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
489 |
Tolerant Testers for Subgraph-Freeness Levi, Reut. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
490 |
Tools and Algorithms for the Construction and Analysis of Systems Cham : Springer Nature Switzerland, Imprint: Springer, 2025, 1st ed. 2025
|
|