|
621 |
Toward Self-Adjusting k-Ary Search Tree Networks
Feder, Evgeniy. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
622 |
Towards Communication-Efficient Peer-To-Peer Networks
Hourani, Khalid. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
623 |
Towards Simpler Sorting Networks and Monotone Circuits for Majority
Dobrokhotova-Maikova, Natalia. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
624 |
Trace Reconstruction from Local Statistical Queries
Chen, Xi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
625 |
Tree-based algorithms for weakly supervised anomaly detection
Finke, Thorben. - Aachen : Universitätsbibliothek der RWTH Aachen, 2024
|
|
|
|
626 |
Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set
Lima, Paloma T.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
627 |
Tree Walks and the Spectrum of Random Graphs
Hainzl, Eva-Maria. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
628 |
Two quantum algorithms for solving the one-dimensional advection-diffusion equation
Ingelmann, Julia. - Ilmenau : TU Ilmenau, 2024
|
|
|
|
629 |
Unbalanced penalization: a new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
Montañez-Barrera, J. A.. - Aachen : Universitätsbibliothek der RWTH Aachen, 2024
|
|
|
|
630 |
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard
Bilò, Davide. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
