Janina Reuter

activity

20232026

most citedFaster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

cs.DS2026

Computing the Determinant via the Generalized Euclidean Algorithm

Janina Reuter

We present an algorithm with a natural geometric interpretation for computing the determinant of a matrix $B \in Z^{d \times d}$ . It improves upon the current fastest determi…

cs.DS2025

On Integer Programs That Look Like Paths

Marcin Briański, Alexandra Lassota, Kristýna Pekárková +2

Solving integer programs of the form $min {x ∣ A x = b, l \leq x \leq u, x \in Z^{n}}$ is, in general, $…

cs.DS2024★ 1 cited

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm

Kim-Manuel Klein, Janina Reuter

The Euclidean algorithm is the oldest algorithms known to mankind. Given two integral numbers $a_{1}$ and $a_{2}$ , it computes the greatest common divisor (gcd) of $a_{1}$ and $a_{2}$ in a…

cs.DS2023

Simple Lattice Basis Computation -- The Generalization of the Euclidean Algorithm

Kim-Manuel Klein, Janina Reuter

The Euclidean algorithm is one of the oldest algorithms known to mankind. Given two integral numbers $a_{1}$ and $a_{2}$ , it computes the greatest common divisor (gcd) of $a_{1}$ and $a_…