Toni Volkmer - RankMe

21 papers A 1C 1Journal 17Unranked 2

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions. Numer. Algorithms Lutz Kämmerer, Felix Krahmer, Toni Volkmer
2021	J	`jnl`	A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size. Adv. Comput. Math. Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer
2021	J	`jnl`	Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products. SIAM J. Math. Data Sci. Kai Bergermann, Martin Stoll, Toni Volkmer
2021	J	`jnl`	Sparse harmonic transforms II: best s-term approximation guarantees for bounded orthonormal product bases in sublinear-time. Numerische Mathematik Bosu Choi, Mark A. Iwen, Toni Volkmer
2020	J	`jnl`	A Deterministic Algorithm for Constructing Multiple Rank-1 Lattices of Near-Optimal Size. CoRR Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer
2020	J	`jnl`	A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions. CoRR Lutz Kämmerer, Felix Krahmer, Toni Volkmer
2020	J	`jnl`	Semi-supervised Learning for Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix Vector Products. CoRR Kai Bergermann, Martin Stoll, Toni Volkmer
2020	J	`jnl`	Sparse Fourier Transforms on Rank-1 Lattices for the Rapid and Low-Memory Approximation of Functions of Many Variables. CoRR Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer
2019	J	`jnl`	Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices. J. Approx. Theory Lutz Kämmerer, Toni Volkmer
2019	J	`jnl`	Sparse Harmonic Transforms II: Best s-Term Approximation Guarantees for Bounded Orthonormal Product Bases in Sublinear-Time. CoRR Bosu Choi, Mark A. Iwen, Toni Volkmer
2019	J	`jnl`	Worst case recovery guarantees for least squares approximation using random samples. CoRR Lutz Kämmerer, Tino Ullrich, Toni Volkmer
2018	J	`jnl`	NFFT Meets Krylov Methods: Fast Matrix-Vector Products for the Graph Laplacian of Fully Connected Networks. Frontiers Appl. Math. Stat. Dominik Alfke, Daniel Potts, Martin Stoll, Toni Volkmer
2018	J	`jnl`	NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks. CoRR Dominik Alfke, Daniel Potts, Martin Stoll, Toni Volkmer
2017	J	`jnl`	Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness. Numerische Mathematik Glenn Byrenheid, Lutz Kämmerer, Tino Ullrich, Toni Volkmer
2016	J	`jnl`	Efficient Spectral Estimation by MUSIC and ESPRIT with Application to Sparse FFT. Frontiers Appl. Math. Stat. Daniel Potts, Manfred Tasche, Toni Volkmer
2015	J	`jnl`	Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling. J. Complex. Lutz Kämmerer, Daniel Potts, Toni Volkmer
2015	J	`jnl`	Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form. J. Complex. Lutz Kämmerer, Daniel Potts, Toni Volkmer
2009	—	`conf`	ACCFS - Virtual File System Support for Host Coupled Run-Time Reconfigurable FPGAs. PARCO Jochen Strunk, Andreas Heinig, Toni Volkmer, Wolfgang Rehm, Heiko Schick
2009	C	`conf`	An on Chip Network inside a FPGA for Run-Time Reconfigurable Low Latency Grid Communication. DSD Jochen Strunk, Toni Volkmer, Wolfgang Rehm, Heiko Schick
2009	—	`conf`	Design and Performance of a Grid of Asynchronously Clocked Run-Time Reconfigurable Modules on a FPGA. ReConFig Jochen Strunk, Toni Volkmer, Wolfgang Rehm, Heiko Schick
2009	A	`conf`	Impact of run-time reconfiguration on design and speed - A case study based on a grid of run-time reconfigurable modules inside a FPGA. IPDPS Jochen Strunk, Toni Volkmer, Klaus Stephan, Wolfgang Rehm, Heiko Schick