Leo Wennmann

According to our database, Leo Wennmann authored at least 4 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Solving Polynomial Equations Over Finite Fields.

Holger Dell, Anselm Haak, Melvin Kallmayer, Leo Wennmann

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Cost Preserving Dependent Rounding for Allocation Problems.

Lars Rohwedder, Arman Rouhani, Leo Wennmann

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

A Simple Algorithm for Trimmed Multipoint Evaluation.

Nick Fischer, Melvin Kallmayer, Leo Wennmann

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time.

Nick Fischer, Leo Wennmann

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024