default search action
Stefan Steinerberger
Person information
- affiliation: University of Washington, Department of Mathematics, Seattle, WA, USA
- affiliation: Yale University, New Haven, CT, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j43]Karel Devriendt, Andrea Ottolini
, Stefan Steinerberger
Graph curvature via resistance distance. Discret. Appl. Math. 348: 68-78 (2024) - [j42]Stefan Steinerberger:
A note on approximate Hadamard matrices. Des. Codes Cryptogr. 92(10): 3125-3131 (2024) - [i41]Stefan Steinerberger
Conformally rigid graphs. CoRR abs/2402.11758 (2024) - [i40]Stefan Steinerberger
Randomly Pivoted Partial Cholesky: Random How? CoRR abs/2404.11487 (2024) - 2023
- [j41]Andrea Ottolini
Guessing cards with complete feedback. Adv. Appl. Math. 150: 102569 (2023) - [j40]Stefan Steinerberger
The boundary of a graph and its isoperimetric inequality. Discret. Appl. Math. 338: 125-134 (2023) - [j39]Stefan Steinerberger
The product of two high-frequency Graph Laplacian eigenfunctions is smooth. Discret. Math. 346(3): 113246 (2023) - [j38]Stefan Steinerberger
The first eigenvector of a distance matrix is nearly constant. Discret. Math. 346(4): 113291 (2023) - [j37]Stefan Steinerberger
Free Convolution Powers Via Roots of Polynomials. Exp. Math. 32(4): 567-572 (2023) - [j36]Ronald R. Coifman, Nicholas F. Marshall, Stefan Steinerberger
A Common Variable Minimax Theorem for Graphs. Found. Comput. Math. 23(2): 493-517 (2023) - [j35]Stefan Steinerberger
An elementary proof of a lower bound for the inverse of the star discrepancy. J. Complex. 75: 101713 (2023) - [j34]Stefan Steinerberger
Curvature on graphs via equilibrium measures. J. Graph Theory 103(3): 415-436 (2023) - [j33]Stefan Steinerberger
Max-Cut via Kuramoto-Type Oscillators. SIAM J. Appl. Dyn. Syst. 22(2): 730-743 (2023) - [j32]Stefan Steinerberger
Approximate Solutions of Linear Systems at a Universal Rate. SIAM J. Matrix Anal. Appl. 44(3): 1436-1446 (2023) - [i39]Catherine Babecki, Stefan Steinerberger, Rekha R. Thomas:
Spectrahedral Geometry of Graph Sparsifiers. CoRR abs/2306.06204 (2023) - 2022
- [j31]Jianfeng Lu
Fast Localization of Eigenfunctions via Smoothed Potentials. J. Sci. Comput. 90(1): 38 (2022) - [j30]Carlos Beltrán
How well-conditioned can the eigenvector problem be? Math. Comput. 91(335): 1237-1245 (2022) - [j29]George C. Linderman
Dimensionality Reduction via Dynamical Systems: The Case of t-SNE. SIAM Rev. 64(1): 153-178 (2022) - [j28]Ofir Lindenbaum
Refined least squares for support recovery. Signal Process. 195: 108493 (2022) - [c3]Yulan Zhang, Anna C. Gilbert, Stefan Steinerberger
May the force be with you. Allerton 2022: 1-8 - [i38]Stefan Steinerberger
Sums of Distances on Graphs and Embeddings into Euclidean Space. CoRR abs/2204.13278 (2022) - [i37]Stefan Steinerberger
Random Walks, Equidistribution and Graphical Designs. CoRR abs/2206.05346 (2022) - [i36]Stefan Steinerberger
Approximate Solutions of Linear Systems at a Universal Rate. CoRR abs/2207.03388 (2022) - [i35]Yulan Zhang, Anna C. Gilbert, Stefan Steinerberger
May the force be with you. CoRR abs/2208.06676 (2022) - [i34]Jeremy G. Hoskins, Hadrian Quan, Stefan Steinerberger
Magnetic Schrödinger operators and landscape functions. CoRR abs/2210.02646 (2022) - 2021
- [j27]Alexander Cloninger, Stefan Steinerberger
On the Dual Geometry of Laplacian Eigenfunctions. Exp. Math. 30(2): 283-293 (2021) - [j26]Stefan Steinerberger
A weighted randomized Kaczmarz method for solving linear systems. Math. Comput. 90(332): 2815-2826 (2021) - [j25]Stefan Steinerberger
Randomized Kaczmarz Converges Along Small Singular Vectors. SIAM J. Matrix Anal. Appl. 42(2): 608-615 (2021) - [j24]Ofir Lindenbaum
Randomly aggregated least squares for support recovery. Signal Process. 180: 107858 (2021) - [i33]Stefan Steinerberger:
Max-Cut via Kuramoto-type Oscillators. CoRR abs/2102.04931 (2021) - [i32]Yulan Zhang, Stefan Steinerberger:
t-SNE, Forceful Colorings and Mean Field Limits. CoRR abs/2102.13009 (2021) - [i31]Stefan Steinerberger:
A 0.502·MaxCut Approximation using Quadratic Programming. CoRR abs/2104.14404 (2021) - [i30]Carlos Beltrán, Laurent Bétermin, Peter Grabner, Stefan Steinerberger:
How well-conditioned can the eigenvalue problem be? CoRR abs/2105.07922 (2021) - [i29]Stefan Steinerberger:
Quantile-Based Random Kaczmarz for corrupted linear systems of equations. CoRR abs/2107.05554 (2021) - [i28]Ronald R. Coifman, Nicholas F. Marshall, Stefan Steinerberger:
A common variable minimax theorem for graphs. CoRR abs/2107.14747 (2021) - [i27]Stefan Steinerberger, Hau-Tieng Wu:
Fundamental component enhancement via adaptive nonlinear activation functions. CoRR abs/2112.01668 (2021) - 2020
- [j23]Ariel Jaffe, Yuval Kluger
The Spectral Underpinning of word2vec. Frontiers Appl. Math. Stat. 6: 593406 (2020) - [j22]Ariel Jaffe, Yuval Kluger
Randomized near-neighbor graphs, giant components and applications in data science. J. Appl. Probab. 57(2): 458-476 (2020) - [j21]Louis Brown, Stefan Steinerberger
Positive-Definite Functions, Exponential Sums and the Greedy Algorithm: a Curious Phenomenon. J. Complex. 61: 101485 (2020) - [j20]Stefan Steinerberger
Generalized designs on graphs: Sampling, spectra, symmetries. J. Graph Theory 93(2): 253-267 (2020) - [j19]George C. Linderman, Stefan Steinerberger
Numerical integration on graphs: Where to sample and how to weigh. Math. Comput. 89(324): 1933-1952 (2020) - [j18]Amir Sagiv
Transport and Interface: An Uncertainty Principle for the Wasserstein Distance. SIAM J. Math. Anal. 52(3): 3039-3051 (2020) - [j17]Stefan Steinerberger
The Best Way to Reconcile Your Past Is Exponentially. Am. Math. Mon. 127(1): 64-69 (2020) - [i26]Shahar Z. Kovalsky, Noam Aigerman, Ingrid Daubechies, Michael Kazhdan, Jianfeng Lu, Stefan Steinerberger:
Non-Convex Planar Harmonic Maps. CoRR abs/2001.01322 (2020) - [i25]Ariel Jaffe, Yuval Kluger, Ofir Lindenbaum, Jonathan Patsenker, Erez Peterfreund, Stefan Steinerberger:
The Spectral Underpinning of word2vec. CoRR abs/2002.12317 (2020) - [i24]Stefan Steinerberger:
Regularized Potentials of Schrödinger Operators and a Local Landscape Function. CoRR abs/2003.01091 (2020) - [i23]Ofir Lindenbaum, Stefan Steinerberger:
Randomly Aggregated Least Squares for Support Recovery. CoRR abs/2003.07331 (2020) - [i22]Adela DePavia, Stefan Steinerberger:
Spectral Clustering Revisited: Information Hidden in the Fiedler Vector. CoRR abs/2003.09969 (2020) - [i21]Stefan Steinerberger:
A Spectral Approach to the Shortest Path Problem. CoRR abs/2004.01163 (2020) - [i20]Stefan Steinerberger:
Randomized Kaczmarz converges along small singular vectors. CoRR abs/2006.16978 (2020) - [i19]Stefan Steinerberger:
A Weighted Randomized Kaczmarz Method for Solving Linear Systems. CoRR abs/2007.02910 (2020) - [i18]Stefan Steinerberger:
Stochastic Gradient Descent applied to Least Squares regularizes in Sobolev spaces. CoRR abs/2007.13288 (2020) - [i17]Stefan Steinerberger:
Surrounding the solution of a Linear System of Equations from all sides. CoRR abs/2009.01757 (2020) - [i16]Jianfeng Lu, Cody Murphey, Stefan Steinerberger:
Fast localization of eigenfunctions via smoothed potentials. CoRR abs/2010.15062 (2020) - [i15]Jianfeng Lu, Stefan Steinerberger:
Neural Collapse with Cross-Entropy Loss. CoRR abs/2012.08465 (2020)
2010 – 2019
- 2019
- [j16]Katherine Cordwell, Alyssa Epstein, Anand Hemmandy, Steven J. Miller, Eyvindur A. Palsson, Aaditya Sharma, Stefan Steinerberger, Yen Nhi Truong Vu:
On Algorithms to Calculate Integer Complexity. Integers 19: A12 (2019) - [j15]Stefan Steinerberger
A nonlocal functional promoting low-discrepancy point sets. J. Complex. 54 (2019) - [j14]George C. Linderman
Clustering with t-SNE, Provably. SIAM J. Math. Data Sci. 1(2): 313-332 (2019) - [j13]Eric C. Chi
Recovering Trees with Convex Clustering. SIAM J. Math. Data Sci. 1(3): 383-407 (2019) - [c2]Dmitry Kobak, George C. Linderman, Stefan Steinerberger
Heavy-Tailed Kernels Reveal a Finer Cluster Structure in t-SNE Visualisations. ECML/PKDD (1) 2019: 124-139 - [i14]Dmitry Kobak, George C. Linderman
Heavy-tailed kernels reveal a finer cluster structure in t-SNE visualisations. CoRR abs/1902.05804 (2019) - [i13]Louis Brown, Stefan Steinerberger:
On the Wasserstein Distance between Classical Sequences and the Lebesgue Measure. CoRR abs/1909.09046 (2019) - [i12]Roy R. Lederman, Stefan Steinerberger:
Extreme Values of the Fiedler Vector on Trees. CoRR abs/1912.08327 (2019) - 2018
- [j12]Stefan Steinerberger
Well-Distributed Great Circles on S2. Discret. Comput. Geom. 60(1): 40-56 (2018) - [j11]Noah Kravitz, Stefan Steinerberger:
Ulam Sequences and Ulam Sets. Integers 18: A80 (2018) - [c1]Samuel Johnson, Stefan Steinerberger:
The Aesthetics of Mathematical Explanations. CogSci 2018 - [i11]George C. Linderman, Stefan Steinerberger:
Numerical Integration on Graphs: where to sample and how to weigh. CoRR abs/1803.06989 (2018) - [i10]Alexander Cloninger, Stefan Steinerberger:
On the Dual Geometry of Laplacian Eigenfunctions. CoRR abs/1804.09816 (2018) - [i9]Eric C. Chi, Stefan Steinerberger:
Recovering Trees with Convex Clustering. CoRR abs/1806.11096 (2018) - 2017
- [j10]Stefan Steinerberger
A Hidden Signal in the Ulam Sequence. Exp. Math. 26(4): 460-467 (2017) - [j9]Ronald R. Coifman, Stefan Steinerberger
Carrier Frequencies, Holomorphy, and Unwinding. SIAM J. Math. Anal. 49(6): 4838-4864 (2017) - [i8]Noah Kravitz, Stefan Steinerberger:
Ulam Sequences and Ulam Sets. CoRR abs/1705.01883 (2017) - [i7]George C. Linderman, Stefan Steinerberger:
Clustering with t-SNE, provably. CoRR abs/1706.02582 (2017) - [i6]Jakob Kapeller, Stefan Steinerberger:
Stability, Fairness and Random Walks in the Bargaining Problem. CoRR abs/1707.02418 (2017) - [i5]George C. Linderman, Gal Mishne, Yuval Kluger, Stefan Steinerberger:
Randomized Near Neighbor Graphs, Giant Components, and Applications in Data Science. CoRR abs/1711.04712 (2017) - [i4]George C. Linderman, Manas Rachh, Jeremy G. Hoskins, Stefan Steinerberger, Yuval Kluger:
Efficient Algorithms for t-distributed Stochastic Neighborhood Embedding. CoRR abs/1712.09005 (2017) - 2016
- [j8]Florian Pausinger
On the discrepancy of jittered sampling. J. Complex. 33: 199-216 (2016) - 2015
- [j7]Stefan Steinerberger
On the number of positions in chess without promotion. Int. J. Game Theory 44(3): 761-767 (2015) - [j6]Stefan Steinerberger
A remark on the numerical integration of harmonic functions in the plane. J. Complex. 31(3): 486-493 (2015) - [i3]Stefan Steinerberger:
A Hidden Signal in the Ulam sequence. CoRR abs/1507.00267 (2015) - 2014
- [j5]Stefan Steinerberger:
A short note on integer complexity. Contributions Discret. Math. 9(1) (2014) - [i2]Stefan Steinerberger:
A Remark on Disk Packings and Numerical Integration of Harmonic Functions. CoRR abs/1403.8002 (2014) - [i1]Stefan Steinerberger:
A filtering technique for Markov chains with applications to spectral embedding. CoRR abs/1411.1638 (2014) - 2012
- [j4]Stefan Steinerberger
Random restricted matching and lower bounds for combinatorial optimization. J. Comb. Optim. 24(3): 280-298 (2012) - 2010
- [j3]Stefan Steinerberger:
The Asymptotic Behavior of the Average Lp-Discrepancies and a Randomized Discrepancy. Electron. J. Comb. 17(1) (2010) - [j2]Stefan Steinerberger
A note on the number of different inner products generated by a finite set of vectors. Discret. Math. 310(5): 1112-1117 (2010) - [j1]Stefan Steinerberger
A new lower bound for the geometric traveling salesman problem in terms of discrepancy. Oper. Res. Lett. 38(4): 318-319 (2010)
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-10-02 20:44 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: