On the public citation graph

Deterministic sparse FFT for M-sparse vectors

https://doi.org/10.1007/s11075-017-0370-5
0 signed · 42 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s10208-009-9057-1openalex-snapshot
Combinatorial Sublinear-Time Fourier Algorithms
inferredcites →https://doi.org/10.1007/s11075-012-9621-7openalex-snapshot
Improved sparse fourier approximation results: faster implementations and stronger guarantees
inferredcites →https://doi.org/10.1007/s11075-015-0028-0openalex-snapshot
A deterministic sparse FFT algorithm for vectors with small support
inferredcites →https://doi.org/10.1016/0024-3795(89)90652-6openalex-snapshot
Fast QR factorization of Vandermonde matrices
inferredcites →https://doi.org/10.1016/j.acha.2012.03.007openalex-snapshot
Improved approximation guarantees for sublinear-time Fourier algorithms
inferredcites →https://doi.org/10.1016/j.cam.2017.03.019openalex-snapshot
A sparse fast Fourier algorithm for real non-negative vectors
inferredcites →https://doi.org/10.1016/j.jsc.2008.11.003openalex-snapshot
Symbolic–numeric sparse interpolation of multivariate polynomials
inferredcites →https://doi.org/10.1109/isit.2013.6620269openalex-snapshot
Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity
inferredcites →https://doi.org/10.1109/msp.2014.2329131openalex-snapshot
Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data
inferredcites →https://doi.org/10.1109/tit.2013.2290027openalex-snapshot
Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions
inferredcites →https://doi.org/10.1112/jlms/s2-8.1.73openalex-snapshot
Hilbert's Inequality
inferredcites →https://doi.org/10.1137/1.9781611973099.93openalex-snapshot
Simple and Practical Algorithm for Sparse Fourier Transform
inferredcites →https://doi.org/10.1142/s1793536913500039openalex-snapshot
ADAPTIVE SUB-LINEAR TIME FOURIER ALGORITHMS
inferredcites →https://doi.org/10.1145/1993886.1993909openalex-snapshot
Diversification improves interpolation
inferredcites →https://doi.org/10.1145/2348543.2348587openalex-snapshot
Faster GPS via the sparse fourier transform
inferredcites →https://doi.org/10.1145/2746539.2746561openalex-snapshot
Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices
inferredcites →https://doi.org/10.1186/s13104-016-2361-3openalex-snapshot
Using Intervention Mapping to develop the Parents as Agents of Change (PAC©) intervention for managing pediatric obesity
inferredcites →https://doi.org/10.13001/1081-3810.1190openalex-snapshot
On perfect conditioning of Vandermonde matrices on the unit circle
inferredcites →https://doi.org/10.3389/fams.2016.00001openalex-snapshot
Efficient Spectral Estimation by MUSIC and ESPRIT with Application to Sparse FFT
inferredcites →https://doi.org/10.48550/arxiv.1704.07852openalex-snapshot
Sub-string/Pattern Matching in Sub-linear Time Using a Sparse Fourier Transform Approach

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.3997557openalex-extracted
Spectrum Recovery for Noise-Corrupted Sparse Signal: A Sparse Fourier Transform Approach
inferred← citeshttps://doi.org/10.1002/pamm.202000134openalex-snapshot
Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling
inferred← citeshttps://doi.org/10.1007/978-3-030-04306-3_10openalex-snapshot
Prony Method for Reconstruction of Structured Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-04306-3_5openalex-snapshot
Fast Fourier Transforms
inferred← citeshttps://doi.org/10.1007/978-3-031-35005-4_10openalex-snapshot
Prony Method for Reconstruction of Structured Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-35005-4_5openalex-snapshot
Fast Fourier Transforms
inferred← citeshttps://doi.org/10.1007/s00025-020-01330-0openalex-snapshot
Deterministic Sparse Sublinear FFT with Improved Numerical Stability
inferred← citeshttps://doi.org/10.1007/s00034-022-01989-6openalex-snapshot
Performance of the Multiscale Sparse Fast Fourier Transform Algorithm
inferred← citeshttps://doi.org/10.1007/s10444-018-9626-4openalex-snapshot
A deterministic sparse FFT for functions with structured Fourier sparsity
inferred← citeshttps://doi.org/10.1007/s11075-018-0620-1openalex-snapshot
Sparse fast DCT for vectors with one-block support
inferred← citeshttps://doi.org/10.1007/s11075-020-00962-1openalex-snapshot
High-dimensional sparse Fourier algorithms
inferred← citeshttps://doi.org/10.1007/s11075-023-01564-3openalex-snapshot
Multiscale matrix pencils for separable reconstruction problems
inferred← citeshttps://doi.org/10.1007/s43670-021-00018-yopenalex-snapshot
Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
inferred← citeshttps://doi.org/10.1016/j.dsp.2022.103403openalex-snapshot
A structured review of sparse fast Fourier transform algorithms
inferred← citeshttps://doi.org/10.1016/j.laa.2019.08.006openalex-snapshot
Real sparse fast DCT for vectors with short support
inferred← citeshttps://doi.org/10.1109/sampta64769.2025.11133571openalex-snapshot
Selecting Optimal Sampling Rate for Stable Super-Resolution
inferred← citeshttps://doi.org/10.1137/22m1540442openalex-snapshot
Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
inferred← citeshttps://doi.org/10.1145/3666000.3669717openalex-snapshot
Fast interpolation and multiplication of unbalanced polynomials
inferred← citeshttps://doi.org/10.23919/jsee.2024.000015openalex-snapshot
Design and Implementation of Code Acquisition Using Sparse Fourier Transform
inferred← citeshttps://doi.org/10.3390/electronics10091117openalex-snapshot
On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter
inferred← citeshttps://doi.org/10.3390/electronics11152291openalex-snapshot
Two Efficient Sparse Fourier Algorithms Using the Matrix Pencil Method
inferred← citeshttps://doi.org/10.53846/goediss-7572openalex-snapshot
Sparse Fast Trigonometric Transforms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.