|
581 |
More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More
Ghentiyala, Surendra. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
582 |
Move-r: Optimizing the r-index
Bertram, Nico. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
583 |
Multicoloured Hardcore Model: Fast Mixing and Its Applications as a Scheduling Algorithm
Olesker-Taylor, Sam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
584 |
Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
Anapolska, Mariia. - Augsburg : Universität Augsburg, 2024
|
|
|
|
585 |
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms
Anapolska, Mariia. - Aachen : Universitätsbibliothek der RWTH Aachen, 2024
|
|
|
|
586 |
Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain
Katz, Matthew J.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
587 |
Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions
Mahankali, Arvind V.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
588 |
Near-Linear Time Samplers for Matroid Independent Sets with Applications
Chen, Xiaoyu. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
589 |
Near Optimal Dual Fault Tolerant Distance Oracle
Dey, Dipan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
590 |
Nearly Optimal Bounds for Sample-Based Testing and Learning of k-Monotone Functions
Black, Hadley. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
