Fast algorithms for discrete polynomial transforms. - Daniel Potts; Gabriele Steidl; Manfred Tasche (Math. Comput., 1998)

Preconditioners for non-Hermitian Toeplitz systems. - Raymond H. Chan; Daniel Potts; Gabriele Steidl (Numer. Linear Algebra Appl., 2001)

Preconditioners for Nondefinite Hermitian Toeplitz Systems. - Raymond H. Chan; Daniel Potts; Gabriele Steidl (SIAM J. Matrix Anal. Appl., 2001)

Preconditioners for Ill-Conditioned Toeplitz Systems Constructed from Positive Kernels. - Daniel Potts; Gabriele Steidl (SIAM J. Sci. Comput., 2001)

Fast Iterative Methods for Sinc Systems. - Michael K. Ng 001; Daniel Potts (SIAM J. Matrix Anal. Appl., 2002)

Fast Summation at Nonequispaced Knots by NFFT. - Daniel Potts; Gabriele Steidl (SIAM J. Sci. Comput., 2003)

Fast Computation of Mutual Information in a Variational Image Registration Approach. - Stefan Heldmann; Oliver Mahnke; Daniel Potts; Jan Modersitzki; Bernd Fischer 001 (Bildverarbeitung für die Medizin, 2004)

Approximation of Scattered Data by Trigonometric Polynomials on the Torus and the 2-sphere. - Daniel Potts (Adv. Comput. Math., 2004)

Fast convolution with radial kernels at nonequispaced knots. - Daniel Potts; Gabriele Steidl; Arthur Nieslony (Numerische Mathematik, 2004)

User-Level Device Drivers: Achieved Performance. - Ben Leslie; Peter Chubb; Nicholas Fitzroy-Dale; Stefan Götz 004; Charles Gray; Luke Macpherson; Daniel Potts; Yue-Ting Shen; Kevin Elphinstone; Gernot Heiser (J. Comput. Sci. Technol., 2005)

Fast summation based on fast trigonometric transforms at non-equispaced nodes. - Markus Fenn; Daniel Potts (Numer. Linear Algebra Appl., 2005)

Adapting Distributed Shared Memory Applications in Diverse Environments. - Daniel Potts; Ihor Kuz (CCGRID, 2006)

Fast Summation of Radial Functions on the Sphere. - Jens Keiner; Stefan Kunis; Daniel Potts (Computing, 2006)

Fast Gauss transforms with complex parameters using NFFTs. - Stefan Kunis; Daniel Potts; Gabriele Steidl (J. Num. Math., 2006)

Fast evaluation of trigonometric polynomials from hyperbolic crosses. - Markus Fenn; Stefan Kunis; Daniel Potts (Numer. Algorithms, 2006)

A Note on the Iterative MRI Reconstruction from Nonuniform k-Space Data. - Tobias Knopp 001; Stefan Kunis; Daniel Potts (Int. J. Biomed. Imaging, 2007)

Stability Results for Scattered Data Interpolation by Trigonometric Polynomials. - Stefan Kunis; Daniel Potts (SIAM J. Sci. Comput., 2007)

Field Inhomogeneity Correction Based on Gridding Reconstruction for Magnetic Resonance Imaging. - Holger Eggers; Tobias Knopp 001; Daniel Potts (IEEE Trans. Medical Imaging, 2007)

Fast evaluation of quadrature formulae on the sphere. - Jens Keiner; Daniel Potts (Math. Comput., 2008)

Eidolon: adapting distributed applications to their environment. - Daniel Potts (2008)

Probabilistic spherical Marcinkiewicz-Zygmund inequalities. - Albrecht Böttcher; Stefan Kunis; Daniel Potts (J. Approx. Theory, 2009)

A fast algorithm for nonequispaced Fourier transforms on the rotation group. - Daniel Potts; Jürgen Prestin; Antje Vollrath (Numer. Algorithms, 2009)

Using NFFT 3 - A Software Library for Various Nonequispaced Fast Fourier Transforms. - Jens Keiner; Stefan Kunis; Daniel Potts (ACM Trans. Math. Softw., 2009)

Nonequispaced Hyperbolic Cross Fast Fourier Transform. - Michael Döhler; Stefan Kunis; Daniel Potts (SIAM J. Numer. Anal., 2010)

Parameter estimation for exponential sums by approximate Prony method. - Daniel Potts; Manfred Tasche (Signal Process., 2010)

Quadrature Nodes Meet Stippling Dots. - Manuel Gräf; Daniel Potts; Gabriele Steidl (SSVM, 2011)

A Continuous Approach to Discrete Ordering on S2. - Rainer Backofen; Manuel Gräf; Daniel Potts; Simon Praetorius; Axel Voigt; Thomas Witkowski (Multiscale Model. Simul., 2011)

On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms. - Manuel Gräf; Daniel Potts (Numerische Mathematik, 2011)

Nonlinear Approximation by Sums of Exponentials and Translates. - Thomas Peter; Daniel Potts; Manfred Tasche (SIAM J. Sci. Comput., 2011)

Interpolation lattices for hyperbolic cross trigonometric polynomials. - Lutz Kämmerer; Stefan Kunis; Daniel Potts (J. Complex., 2012)

Quadrature Errors, Discrepancies, and Their Relations to Halftoning on the Torus and the Sphere. - Manuel Gräf; Daniel Potts; Gabriele Steidl (SIAM J. Sci. Comput., 2012)

Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation. - Michael Pippig; Daniel Potts (SIAM J. Sci. Comput., 2013)

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)

Fast Ewald summation based on NFFT with mixed periodicity. - Franziska Nestler; Michael Pippig; Daniel Potts (J. Comput. Phys., 2015)

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

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)

Learning high-dimensional additive models on the torus. - Daniel Potts; Michael Schmischke (CoRR, 2019)

Uniform error estimates for the NFFT. - Daniel Potts; Manfred Tasche (CoRR, 2019)

Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P2NFFT method. - Rudolf Weeber; Franziska Nestler; Florian Weik; Michael Pippig; Daniel Potts; Christian Holm (J. Comput. Phys., 2019)

A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals. - Robert Nasdala; Daniel Potts (MCQMC, 2020)

A sparse FFT approach for ODE with random coefficients. - Maximilian Bochmann; Lutz Kämmerer; Daniel Potts (Adv. Comput. Math., 2020)

Grouped Transformations in High-Dimensional Explainable ANOVA Approximation. - Felix Bartel; Daniel Potts; Michael Schmischke (CoRR, 2020)

Continuous window functions for NFFT. - Daniel Potts; Manfred Tasche (Adv. Comput. Math., 2021)

The uniform sparse FFT with application to PDEs with random coefficients. - Lutz Kämmerer; Daniel Potts; Fabian Taubert (CoRR, 2021)

Efficient multivariate approximation on the cube. - Robert Nasdala; Daniel Potts (Numerische Mathematik, 2021)

Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods. - Daniel Potts; Michael Schmischke (SIAM J. Numer. Anal., 2021)

Interpretable Approximation of High-Dimensional Data. - Daniel Potts; Michael Schmischke (SIAM J. Math. Data Sci., 2021)

On regularized Shannon sampling formulas with localized sampling. - Melanie Kircheis; Daniel Potts; Manfred Tasche (CoRR, 2022)

Nonlinear approximation in bounded orthonormal product bases. - Lutz Kämmerer; Daniel Potts; Fabian Taubert (CoRR, 2022)

Interpretable Transformed ANOVA Approximation on the Example of the Prevention of Forest Fires. - Daniel Potts; Michael Schmischke (Frontiers Appl. Math. Stat., 2022)

Learning multivariate functions with low-dimensional structures using polynomial bases. - Daniel Potts; Michael Schmischke (J. Comput. Appl. Math., 2022)

Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation. - Felix Bartel; Daniel Potts; Michael Schmischke (SIAM J. Sci. Comput., 2022)

Optimal density compensation factors for the reconstruction of the Fourier transform of bandlimited functions. - Melanie Kircheis; Daniel Potts (CoRR, 2023)

ANOVA approximation with mixed tensor product basis on scattered points. - Daniel Potts; Pascal Schröter (CoRR, 2023)

On numerical realizations of Shannon's sampling theorem. - Melanie Kircheis; Daniel Potts; Manfred Tasche (CoRR, 2023)

Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform. - Melanie Kircheis; Daniel Potts (Frontiers Appl. Math. Stat., 2023)

Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms. - Melanie Kircheis; Daniel Potts; Manfred Tasche (Numer. Algorithms, 2023)

On the reconstruction of functions from values at subsampled quadrature points. - Felix Bartel; Lutz Kämmerer; Daniel Potts; Tino Ullrich (Math. Comput., 2023)

Fast hyperbolic wavelet regression meets ANOVA. - Laura Lippert; Daniel Potts; Tino Ullrich (Numerische Mathematik, 2023)

Fast and interpretable Support Vector Classification based on the truncated ANOVA decomposition. - Kseniya Akhalaya; Franziska Nestler; Daniel Potts (CoRR, 2024)

ANOVA-boosting for Random Fourier Features. - Daniel Potts; Laura Weidensager (CoRR, 2024)

Operator learning based on sparse high-dimensional approximation. - Daniel Potts; Fabian Taubert (CoRR, 2024)

Optimal parameter choice for regularized Shannon sampling formulas. - Melanie Kircheis; Daniel Potts; Manfred Tasche (CoRR, 2024)

Variable transformations in combination with wavelets and ANOVA for high-dimensional approximation. - Daniel Potts; Laura Weidensager (Adv. Comput. Math., 2024)

Nonequispaced fast Fourier transforms for bandlimited functions. - Melanie Kircheis; Daniel Potts (CoRR, 2025)