|
1 |
A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
Basiak, Mateusz. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
2 |
A Benchmark Framework for Byzantine Fault Tolerance Testing Algorithms (Tool Paper)
Louro Neto, João Miguel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
3 |
A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
van der Hoog, Ivor. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
4 |
A Comparative Study of Compressed, Learned, and Traditional Indexing Methods for Integer Data
Bellomo, Lorenzo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
5 |
A comparative study of multi-objective and neuroevolutionary-based reinforcement learning algorithms for optimizing electric vehicle charging and load management
Kemper, Neele. - Augsburg : Universität Augsburg, 2025
|
|
|
|
6 |
A Deterministic Partition Tree and Applications
Wang, Haitao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
7 |
A DSL for Swarm Intelligence Algorithms
Martins, Kevin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
8 |
A Dynamic Piecewise-Linear Geometric Index with Worst-Case Guarantees
Gæde, Emil Toftegaard. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
9 |
A Fast and Simple Algorithm for the Resource Constrained Shortest Path Problem
Ahmadi, Saman. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
10 |
A Fast Coloring Oracle for Average Case Hypergraphs
Marcussen, Cassandra. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
