Skip to content

Author

Mats Bierwirth

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

Tight Bounds for Distance-Unbiased Sorting

We study elitist randomized local search for sorting permutations. In this model, each iteration considers a possible exchange of two positions. The entries are exchanged if and only if they are in the wrong order. We introduce \emph{distance-unbiased} selection rules, which may choose an arbitrary distribution over ex...

Mats Bierwirth, C. Doerr, J. Lengler · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.