On restricted averages of Dedekind sums
P. Minelli, A. Sourmelidis, M. Technau, Int. Math. Res. Not. IMRN 2024 (2024) 8485–8502.

Remark on the Farey fraction spin chain
M. Technau, Proc. Amer. Math. Soc. 152 (2024) 63–69.

Galois groups of (f)+(f)X++(f)
B. Klahn, M. Technau, Int. J. Number Theory 19 (2023) 2443–2450.

Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums
P. Minelli, A. Sourmelidis, M. Technau, Math. Ann. 387 (2023) 291–320.

On polynomials with roots modulo almost all primes
Ch. Elsholtz, B. Klahn, M. Technau, Acta Arith. 205:3 (2022) 251–263.

On the distribution of ;1p modulo one in quadratic number fields
St. Baier, D. Mazumder, M. Technau, Unif. Distrib. Theory 16 (2021) 1–48.

Metric results on summatory arithmetic functions on Beatty sets
M. Technau, A. Zafeiropoulos, Acta Arith. 197 (2021) 93–104.

On the distribution of ;1p modulo one in imaginary quadratic number fields with class number one
St. Baier, M. Technau, J. Théor. Nombres Bordx. 32 (2020) 719–760.

Modular hyperbolas and Beatty sequences
M. Technau, J. Number Theory 208 (2020) 148–167.

Kloosterman sums with twice-differentiable functions
I.E. Shparlinski, M. Technau, Funct. Approximatio, Comment. Math. 63 (2020) 113–124.

Emptiness problems for integer circuits
D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, M. Technau, Theoretical Computer Science 824–825 (2020) 11–35.

The maximal order of iterated multiplicative functions
Ch. Elsholtz, M. Technau, N. Technau, Mathematika 64 (2019) 990–1009.

Generalised Beatty sets
M. Technau, Notes Number Theory Discrete Math. 25 (2019) 127–135.

On Beatty sets and some generalisations thereof
M. Technau, On Beatty Sets and Some Generalisations Thereof, University of Würzburg, Würzburg, 2018.

Emptiness problems for integer circuits
D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, M. Technau, Emptiness Problems for Integer Circuits, https://eccc.weizmann.ac.il/report/2017/012, 2017.

Emptiness problems for integer circuits
D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, M. Technau, in: K.G. Larsen, H.L. Bodlaender, J.-F. Raskin (Eds.), 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017, p. 33:1–33:14.

A Loewner equation for infinitely many slits
M. Technau, N. Technau, Comput. Methods Funct. Theory 17 (2017) 255–272.

The least prime number in a Beatty sequence
J. Steuding, M. Technau, J. Number Theory 169 (2016) 144–159.