Jonas Lill

collaborators

2 papers

cs.DS2025

A Levelset Algorithm for 3D-Tarski

Sebastian Haslebacher, Jonas Lill

We present a simple new algorithm for finding a Tarski fixed point of a monotone function $F : [N]^{3} \to [N]^{3}$ . Our algorithm runs in $O (lo g^{2} N)$ time and makes $O(\log^…

cs.CC2025

Query-Efficient Fixpoints of $ℓ_{p}$ -Contractions

Sebastian Haslebacher, Jonas Lill, Patrick Schnider +1

We prove that an $I^µ$ -approximate fixpoint of a map $f : [0, 1]^{d} \to [0, 1]^{d}$ can be found with $O (d^{2} (lo g \frac{1}{I ^} µ + lo g \frac{1}{1 - I ^ »}))$ queries to $f$ if $f$ i…

A Levelset Algorithm for 3D-Tarski

Query-Efficient Fixpoints of ℓp​-Contractions

Query-Efficient Fixpoints of $ℓ_{p}$ -Contractions