default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Kunis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Ivan Kovalyov, Stefan Kunis:
Two-dimensional moment problem and Schur algorithm. CoRR abs/2404.03342 (2024)- 2023
- [j20]Mathias Hockmann, Stefan Kunis
:
Short Communication: Weak Sparse Superresolution is Well-Conditioned. SIAM J. Imaging Sci. 16(1): 1- (2023) - [i6]Tarek Emmrich, Martina Juhnke-Kubitzke, Stefan Kunis:
Two subspace methods for frequency sparse graph signals. CoRR abs/2310.11292 (2023) - 2022
- [i5]Paul Catala, Mathias Hockmann, Stefan Kunis, Markus Wageringel:
Approximation and Interpolation of Singular Measures by Trigonometric Polynomials. CoRR abs/2203.10531 (2022) - 2021
- [j19]Stefan Kunis, Dominik Nagel:
On the condition number of Vandermonde matrices with pairs of nearly-colliding nodes. Numer. Algorithms 87(1): 473-496 (2021) - [j18]Stefan Kunis, Dominik Nagel:
Correction to: On the condition number of Vandermonde matrices with pairs of nearly-colliding nodes. Numer. Algorithms 87(1): 497 (2021) - [i4]Stefan Kunis, Dominik Nagel, Anna Strotmann:
Multivariate Vandermonde matrices with separated nodes on the unit circle are stable. CoRR abs/2103.08167 (2021) - [i3]Mathias Hockmann, Stefan Kunis:
Sparse super resolution is Lipschitz continuous. CoRR abs/2108.11925 (2021) - 2020
- [j17]Stefan Kunis, Tim Römer, Ulrich von der Ohe:
Learning algebraic decompositions using Prony structures. Adv. Appl. Math. 118: 102044 (2020)
2010 – 2019
- 2019
- [i2]Stefan Kunis, Tim Römer, Ulrich von der Ohe:
Learning algebraic decompositions using Prony structures. CoRR abs/1907.01547 (2019) - [i1]Stefan Kunis, Dominik Nagel:
On the smallest singular value of multivariate Vandermonde matrices with clustered nodes. CoRR abs/1907.07119 (2019) - 2018
- [j16]Stefan Kunis, Benjamin Reichenwallner, Matthias Reitzner:
Random Approximation of Convex Bodies: Monotonicity of the Volumes of Random Tetrahedra. Discret. Comput. Geom. 59(1): 165-174 (2018) - 2015
- [j15]Yiqiu Dong, Torsten Görner, Stefan Kunis:
An algorithm for total variation regularized photoacoustic imaging. Adv. Comput. Math. 41(2): 423-438 (2015) - 2014
- [j14]Frank Filbir, Stefan Kunis, Ruben Seyfried:
Effective Discretization of Direct Reconstruction Schemes For Photoacoustic Imaging In Spherical Geometries. SIAM J. Numer. Anal. 52(6): 2722-2742 (2014) - 2012
- [j13]Lutz Kämmerer, Stefan Kunis, Daniel Potts:
Interpolation lattices for hyperbolic cross trigonometric polynomials. J. Complex. 28(1): 76-92 (2012) - [j12]Stefan Kunis, Ines Melzer:
A Stable and Accurate Butterfly Sparse Fourier Transform. SIAM J. Numer. Anal. 50(3): 1777-1800 (2012) - 2011
- [j11]Lutz Kämmerer, Stefan Kunis:
On the stability of the hyperbolic cross discrete Fourier transform. Numerische Mathematik 117(3): 581-600 (2011) - 2010
- [j10]Michael Döhler, Stefan Kunis, Daniel Potts:
Nonequispaced Hyperbolic Cross Fast Fourier Transform. SIAM J. Numer. Anal. 47(6): 4415-4428 (2010)
2000 – 2009
- 2009
- [j9]Stefan Kunis:
A note on stability results for scattered data interpolation on Euclidean spheres. Adv. Comput. Math. 30(4): 303-314 (2009) - [j8]Albrecht Böttcher, Stefan Kunis, Daniel Potts:
Probabilistic spherical Marcinkiewicz-Zygmund inequalities. J. Approx. Theory 157(2): 113-126 (2009) - [j7]Jens Keiner, Stefan Kunis, Daniel Potts:
Using NFFT 3 - A Software Library for Various Nonequispaced Fast Fourier Transforms. ACM Trans. Math. Softw. 36(4): 19:1-19:30 (2009) - 2008
- [j6]Stefan Kunis, Holger Rauhut:
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit. Found. Comput. Math. 8(6): 737-763 (2008) - 2007
- [j5]Tobias Knopp, Stefan Kunis, Daniel Potts:
A Note on the Iterative MRI Reconstruction from Nonuniform k-Space Data. Int. J. Biomed. Imaging 2007: 24727:1-24727:9 (2007) - [j4]Stefan Kunis, Daniel Potts:
Stability Results for Scattered Data Interpolation by Trigonometric Polynomials. SIAM J. Sci. Comput. 29(4): 1403-1419 (2007) - 2006
- [j3]Jens Keiner, Stefan Kunis, Daniel Potts:
Fast Summation of Radial Functions on the Sphere. Computing 78(1): 1-15 (2006) - [j2]Stefan Kunis, Daniel Potts, Gabriele Steidl:
Fast Gauss transforms with complex parameters using NFFTs. J. Num. Math. 14(4): 295-303 (2006) - [j1]Markus Fenn, Stefan Kunis, Daniel Potts:
Fast evaluation of trigonometric polynomials from hyperbolic crosses. Numer. Algorithms 41(4): 339-352 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-31 02:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
