default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel A. Spielman
Person information
- affiliation: Yale University, New Haven, Connecticut, USA
- award (2010): Nevanlinna Prize
- award (2008): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i29]Dmitriy Kunisky, Daniel A. Spielman, Xifan Yu:
Inference of rankings planted in random tournaments. CoRR abs/2407.16597 (2024)- 2023
- [i28]Yuan Gao, Rasmus Kyng, Daniel A. Spielman:
Robust and Practical Solution of Laplacian Equations by Approximate Elimination. CoRR abs/2303.00709 (2023) - 2022
- [c46]Daniel A. Spielman, Peng Zhang:
Hardness Results for Weaver's Discrepancy Problem. APPROX/RANDOM 2022: 40:1-40:14 - [i27]Daniel A. Spielman, Peng Zhang:
Hardness Results for Weaver's Discrepancy Problem. CoRR abs/2205.01482 (2022)
2010 – 2019
- 2019
- [i26]Christopher Harshaw, Fredrik Sävje, Daniel A. Spielman
, Peng Zhang:
Balancing covariates in randomized experiments using the Gram-Schmidt walk. CoRR abs/1911.03071 (2019) - 2018
- [j30]Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava:
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. SIAM J. Comput. 47(6): 2488-2509 (2018) - 2016
- [c45]Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman:
Sparsified Cholesky and multigrid solvers for connection laplacians. STOC 2016: 842-850 - 2015
- [c44]Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman:
Algorithms for Lipschitz Learning on Graphs. COLT 2015: 1190-1223 - [c43]Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava:
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. FOCS 2015: 1358-1377 - [i25]Huan Wang, John Wright, Daniel A. Spielman:
A Batchwise Monotone Algorithm for Dictionary Learning. CoRR abs/1502.00064 (2015) - [i24]Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman:
Algorithms for Lipschitz Learning on Graphs. CoRR abs/1505.00290 (2015) - [i23]Yin Tat Lee, Richard Peng, Daniel A. Spielman:
Sparsified Cholesky Solvers for SDD linear systems. CoRR abs/1506.08204 (2015) - [i22]Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman:
Sparsified Cholesky and Multigrid Solvers for Connection Laplacians. CoRR abs/1512.01892 (2015) - 2014
- [j29]Daniel A. Spielman, Shang-Hua Teng:
Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. SIAM J. Matrix Anal. Appl. 35(3): 835-885 (2014) - [j28]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-Ramanujan Sparsifiers. SIAM Rev. 56(2): 315-334 (2014) - [c42]Richard Peng, Daniel A. Spielman:
An efficient parallel solver for SDD linear systems. STOC 2014: 333-342 - 2013
- [j27]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng:
Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56(8): 87-94 (2013) - [j26]Daniel A. Spielman, Shang-Hua Teng:
A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning. SIAM J. Comput. 42(1): 1-26 (2013) - [j25]Maria-Florina Balcan, Mark Braverman, Daniel A. Spielman:
Special Section on the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009). SIAM J. Comput. 42(6): 2286 (2013) - [j24]Afonso S. Bandeira, Amit Singer, Daniel A. Spielman:
A Cheeger Inequality for the Graph Connection Laplacian. SIAM J. Matrix Anal. Appl. 34(4): 1611-1630 (2013) - [c41]Adam Marcus, Daniel A. Spielman, Nikhil Srivastava:
Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees. FOCS 2013: 529-537 - [c40]Huan Wang, Daniel A. Spielman, John Wright:
Exact Recovery of Sparse-Used Dictionaries. IJCAI 2013: 3087-3090 - [i21]Richard Peng, Daniel A. Spielman:
An Efficient Parallel Solver for SDD Linear Systems. CoRR abs/1311.3286 (2013) - 2012
- [j23]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-Ramanujan Sparsifiers. SIAM J. Comput. 41(6): 1704-1721 (2012) - [c39]Daniel A. Spielman:
Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations. ICALP (2) 2012: 24-26 - [c38]Daniel A. Spielman, Huan Wang, John Wright:
Exact Recovery of Sparsely-Used Dictionaries. COLT 2012: 37.1-37.18 - [i20]Afonso S. Bandeira, Amit Singer, Daniel A. Spielman:
A Cheeger Inequality for the Graph Connection Laplacian. CoRR abs/1204.3873 (2012) - [i19]Daniel A. Spielman, Huan Wang, John Wright:
Exact Recovery of Sparsely-Used Dictionaries. CoRR abs/1206.5882 (2012) - 2011
- [j22]John Dunagan, Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of condition numbers and complexity implications for linear programming. Math. Program. 126(2): 315-350 (2011) - [j21]Daniel A. Spielman, Shang-Hua Teng:
Spectral Sparsification of Graphs. SIAM J. Comput. 40(4): 981-1025 (2011) - [j20]Daniel A. Spielman, Nikhil Srivastava:
Graph Sparsification by Effective Resistances. SIAM J. Comput. 40(6): 1913-1926 (2011) - [c37]Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng:
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. STOC 2011: 273-282 - 2010
- [i18]Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng:
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs. CoRR abs/1010.2921 (2010)
2000 – 2009
- 2009
- [j19]Daniel A. Spielman:
Technical perspective - The beauty of error-correcting codes. Commun. ACM 52(3): 86 (2009) - [j18]Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Commun. ACM 52(10): 76-84 (2009) - [j17]Louay Bazzi, Mohammad Mahdian, Daniel A. Spielman:
The Minimum Distance of Turbo-Like Codes. IEEE Trans. Inf. Theory 55(1): 6-15 (2009) - [c36]Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Spielman:
Fitting a graph to vector data. ICML 2009: 201-208 - [c35]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-ramanujan sparsifiers. STOC 2009: 255-262 - [i17]Samuel I. Daitch, Daniel A. Spielman:
A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix. Combinatorial Scientific Computing 2009 - [i16]Daniel A. Spielman, Jaeoh Woo:
A Note on Preconditioning by Low-Stretch Spanning Trees. CoRR abs/0903.2816 (2009) - 2008
- [j16]Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng:
Lower-Stretch Spanning Trees. SIAM J. Comput. 38(2): 608-628 (2008) - [c34]Samuel I. Daitch, Daniel A. Spielman:
Faster approximate lossy generalized flow via interior point algorithms. STOC 2008: 451-460 - [c33]Daniel A. Spielman, Nikhil Srivastava:
Graph sparsification by effective resistances. STOC 2008: 563-568 - [i15]Daniel A. Spielman, Nikhil Srivastava:
Graph Sparsification by Effective Resistances. CoRR abs/0803.0929 (2008) - [i14]Samuel I. Daitch, Daniel A. Spielman:
Faster Approximate Lossy Generalized Flow via Interior Point Algorithms. CoRR abs/0803.0988 (2008) - [i13]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-Ramanujan Sparsifiers. CoRR abs/0808.0163 (2008) - [i12]Daniel A. Spielman, Shang-Hua Teng:
Spectral Sparsification of Graphs. CoRR abs/0808.4134 (2008) - [i11]Daniel A. Spielman, Shang-Hua Teng:
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning. CoRR abs/0809.3232 (2008) - 2007
- [j15]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses. Int. J. Comput. Geom. Appl. 17(1): 1-30 (2007) - [c32]Daniel A. Spielman:
Spectral Graph Theory and its Applications. FOCS 2007: 29-38 - [i10]Samuel I. Daitch, Daniel A. Spielman:
Support-Graph Preconditioners for 2-Dimensional Trusses. CoRR abs/cs/0703119 (2007) - 2006
- [j14]Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. SIAM J. Matrix Anal. Appl. 28(2): 446-476 (2006) - [c31]Jonathan A. Kelner, Daniel A. Spielman:
A randomized polynomial-time simplex algorithm for linear programming. STOC 2006: 51-60 - [i9]Daniel A. Spielman, Shang-Hua Teng:
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. CoRR abs/cs/0607105 (2006) - 2005
- [c30]Ming Cao, Daniel A. Spielman, A. Stephen Morse:
A Lower Bound on Convergence of a Distributed Network Consensus Algorithm. CDC/ECC 2005: 2356-2361 - [c29]Daniel A. Spielman:
The Smoothed Analysis of Algorithms. FCT 2005: 17-18 - [c28]Amit Deshpande, Daniel A. Spielman:
Improved Smoothed Analysis of the Shadow Vertex Simplex Method. FOCS 2005: 349-356 - [c27]Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng:
Lower-stretch spanning trees. STOC 2005: 494-503 - [i8]Jonathan A. Kelner, Daniel A. Spielman:
A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version). Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j13]Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3): 385-463 (2004) - [c26]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement with Off-Centers. Euro-Par 2004: 812-819 - [c25]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Time complexity of practical parallel steiner point insertion algorithms. SPAA 2004: 267-268 - [c24]Daniel A. Spielman, Shang-Hua Teng:
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. STOC 2004: 81-90 - [i7]Michael Elkin, Daniel A. Spielman, Shang-Hua Teng:
Lower-Stretch Spanning Trees. CoRR cs.DS/0411064 (2004) - 2003
- [j12]Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of termination of linear programming algorithms. Math. Program. 97(1-2): 375-404 (2003) - [c23]Daniel A. Spielman, Shang-Hua Teng:
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). FOCS 2003: 416-427 - [c22]Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman:
Exponential algorithmic speedup by a quantum walk. STOC 2003: 59-68 - [c21]Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis (Motivation and Discrete Models). WADS 2003: 256-270 - [i6]Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of Interior-Point Algorithms: Termination. CoRR cs.DS/0301019 (2003) - [i5]John Dunagan, Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of Interior-Point Algorithms: Condition Number. CoRR cs.DS/0302011 (2003) - [i4]Daniel A. Spielman, Shang-Hua Teng:
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31). CoRR cs.DS/0310036 (2003) - [i3]Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. CoRR cs.NA/0310022 (2003) - 2002
- [c20]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement: Algorithms And Analyses. IMR 2002: 205-217 - [i2]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses. CoRR cs.CG/0207063 (2002) - 2001
- [j11]Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng:
Min-max-boundary domain decomposition. Theor. Comput. Sci. 261(2): 253-266 (2001) - [j10]Brendan J. Frey, Ralf Koetter, G. David Forney Jr., Frank R. Kschischang, Robert J. McEliece, Daniel A. Spielman:
Introduction to the special issue on codes on graphs and iterative algorithms. IEEE Trans. Inf. Theory 47(2): 493-497 (2001) - [j9]Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman:
Efficient erasure correcting codes. IEEE Trans. Inf. Theory 47(2): 569-584 (2001) - [j8]Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman:
Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inf. Theory 47(2): 585-598 (2001) - [c19]Adam R. Klivans, Daniel A. Spielman:
Randomness efficient identity testing of multivariate polynomials. STOC 2001: 216-223 - [c18]Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. STOC 2001: 296-305 - [i1]Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time. CoRR cs.DS/0111050 (2001) - 2000
- [j7]Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram:
Alternation in interaction. Comput. Complex. 9(3-4): 202-246 (2000) - [j6]Daniel A. Spielman, Miklós Bóna:
An Infinite Antichain of Permutations. Electron. J. Comb. 7 (2000)
1990 – 1999
- 1998
- [c17]Daniel A. Spielman:
Models of Computation in Coding Theory. CCC 1998: 120- - [c16]Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng:
Min-Max-Boundary Domain Decomposition. COCOON 1998: 137-146 - [c15]Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman:
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. STOC 1998: 249-258 - 1997
- [j5]Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann:
A Remark on Matrix Rigidity. Inf. Process. Lett. 64(6): 283-285 (1997) - [c14]Daniel A. Spielman:
The Complexity of Error-Correcting Codes. FCT 1997: 67-84 - [c13]Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann:
Practical Loss-Resilient Codes. STOC 1997: 150-159 - 1996
- [j4]Michael Sipser, Daniel A. Spielman:
Expander codes. IEEE Trans. Inf. Theory 42(6): 1710-1722 (1996) - [j3]Daniel A. Spielman:
Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory 42(6): 1723-1731 (1996) - [c12]Daniel A. Spielman, Shang-Hua Teng:
Disk Packings and Planar Separators. SCG 1996: 349-358 - [c11]Daniel A. Spielman, Shang-Hua Teng:
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. FOCS 1996: 96-105 - [c10]Daniel A. Spielman:
Highly Fault-Tolerant Parallel Computation (extended abstract). FOCS 1996: 154-163 - [c9]Daniel A. Spielman:
Faster Isomorphism Testing of Strongly Regular Graphs. STOC 1996: 576-584 - 1995
- [j2]Richard Beigel, Nick Reingold, Daniel A. Spielman:
PP Is Closed under Intersection. J. Comput. Syst. Sci. 50(2): 191-202 (1995) - [c8]Daniel A. Spielman:
Linear-time encodable and decodable error-correcting codes. STOC 1995: 388-397 - 1994
- [j1]Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman:
The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. Comput. Complex. 4: 158-174 (1994) - [c7]Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram:
Alternation in Interaction. SCT 1994: 294-303 - [c6]Michael Sipser, Daniel A. Spielman:
Expander Codes. FOCS 1994: 566-576 - [c5]Alexander Polishchuk, Daniel A. Spielman:
Nearly-linear size holographic proofs. STOC 1994: 194-203 - 1993
- [c4]Richard Beigel, Grigorii Margulis, Daniel A. Spielman:
Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds. SPAA 1993: 21-29 - 1992
- [c3]Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman:
The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. SCT 1992: 338-346 - 1991
- [c2]Richard Beigel, Nick Reingold, Daniel A. Spielman:
The Perceptron Strikes Back. SCT 1991: 286-291 - [c1]Richard Beigel, Nick Reingold, Daniel A. Spielman:
PP Is Closed Under Intersection (Extended Abstract). STOC 1991: 1-9
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-08-25 19:12 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:
