An on Chip Network inside a FPGA for Run-Time Reconfigurable Low Latency Grid Communication. - Jochen Strunk; Toni Volkmer; Wolfgang Rehm; Heiko Schick (DSD, 2009)

Impact of run-time reconfiguration on design and speed - A case study based on a grid of run-time reconfigurable modules inside a FPGA. - Jochen Strunk; Toni Volkmer; Klaus Stephan; Wolfgang Rehm; Heiko Schick (IPDPS, 2009)

ACCFS - Virtual File System Support for Host Coupled Run-Time Reconfigurable FPGAs. - Jochen Strunk; Andreas Heinig; Toni Volkmer; Wolfgang Rehm; Heiko Schick (PARCO, 2009)

Design and Performance of a Grid of Asynchronously Clocked Run-Time Reconfigurable Modules on a FPGA. - Jochen Strunk; Toni Volkmer; Wolfgang Rehm; Heiko Schick (ReConFig, 2009)

Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form. - Lutz Kämmerer; Daniel Potts; Toni Volkmer (J. Complex., 2015)

Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling. - Lutz Kämmerer; Daniel Potts; Toni Volkmer (J. Complex., 2015)

Efficient Spectral Estimation by MUSIC and ESPRIT with Application to Sparse FFT. - Daniel Potts; Manfred Tasche; Toni Volkmer (Frontiers Appl. Math. Stat., 2016)

Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness. - Glenn Byrenheid; Lutz Kämmerer; Tino Ullrich; Toni Volkmer (Numerische Mathematik, 2017)

NFFT Meets Krylov Methods: Fast Matrix-Vector Products for the Graph Laplacian of Fully Connected Networks. - Dominik Alfke; Daniel Potts; Martin Stoll; Toni Volkmer (Frontiers Appl. Math. Stat., 2018)

Worst case recovery guarantees for least squares approximation using random samples. - Lutz Kämmerer; Tino Ullrich; Toni Volkmer (CoRR, 2019)

Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices. - Lutz Kämmerer; Toni Volkmer (J. Approx. Theory, 2019)

Semi-supervised Learning for Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix Vector Products. - Kai Bergermann; Martin Stoll; Toni Volkmer (CoRR, 2020)

Sparse Fourier Transforms on Rank-1 Lattices for the Rapid and Low-Memory Approximation of Functions of Many Variables. - Craig Gross; Mark A. Iwen; Lutz Kämmerer; Toni Volkmer (CoRR, 2020)

A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size. - Craig Gross; Mark A. Iwen; Lutz Kämmerer; Toni Volkmer (Adv. Comput. Math., 2021)

Sparse harmonic transforms II: best s-term approximation guarantees for bounded orthonormal product bases in sublinear-time. - Bosu Choi; Mark A. Iwen; Toni Volkmer (Numerische Mathematik, 2021)

Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products. - Kai Bergermann; Martin Stoll; Toni Volkmer (SIAM J. Math. Data Sci., 2021)

A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions. - Lutz Kämmerer; Felix Krahmer; Toni Volkmer (Numer. Algorithms, 2022)