Daniel A. Spielman
Computational Theory and Mathematics · 2001–2013
A researcher in the Science corpus: 15 papers; trusts 82 researchers and is trusted by 107 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 47 citations into it; #193 of 12,489 by trust here, #210 by citations
- Artificial Intelligence — 29 citations into it; #6,650 of 36,961 by trust here, #10,737 by citations
- Geometry and Topology — 16 citations into it; #816 of 7,435 by trust here, #776 by citations
- Applied Mathematics — 14 citations into it
- Computational Mechanics — 13 citations into it; #1,342 of 10,021 by trust here, #3,203 by citations
- Statistics and Probability — 12 citations into it
- Computer Vision and Pattern Recognition — 11 citations into it; #11,306 of 21,973 by trust here, #17,168 by citations
- Discrete Mathematics and Combinatorics — 11 citations into it; #388 of 2,084 by trust here, #257 by citations
Whom Daniel A. Spielman trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dimitris Achlioptas
- Shang-Hua Teng
- Joshua D. Batson
- L. Lov'asz
- Fan Chung
- Bruce Hendrickson
- Sanjeev Arora
- Nikhil Srivastava
- R. Kannan
- Jianbo Shi
Who trusts Daniel A. Spielman overall
- Jalaj Upadhyay
- Yu-Xiang Wang
- Nikhil Srivastava
- David P. Woodruff
- Yin Tat Lee
- Adam W. Marcus
- Jakub Konecný
- Joel A. Tropp
- Shang-Hua Teng
- Joshua D. Batson
Papers from Daniel A. Spielman's perspective
Ordered by how strongly the researchers Daniel A. Spielman trusts endorse each paper. Same corpus, a different order for every researcher.
- Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
- ImageNet classification with deep convolutional neural networks
- Adam: A Method for Stochastic Optimization (International Conference on Learning Representations)
- Gradient-based learning applied to document recognition
- ImageNet: A large-scale hierarchical image database
- Attention is All you Need (Neural Information Processing Systems)
- Very Deep Convolutional Networks for Large-Scale Image Recognition (International Conference on Learning Representations)
- Learning Multiple Layers of Features from Tiny Images
- Long Short-Term Memory
- Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift (International Conference on Machine Learning)
Their papers
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (2001) — 993 citations
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (2003) — 1,026 citations
- Exponential algorithmic speedup by a quantum walk (2002) — 948 citations
- Twice-ramanujan sparsifiers (2008) — 580 citations
- Graph sparsification by effective resistances (2008) — 1,061 citations
- Spectral Sparsification of Graphs (2008) — 592 citations
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (2010) — 372 citations
- Interlacing families II: Mixed characteristic polynomials and the Kadison{Singer problem (2013) — 545 citations
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning (2008) — 364 citations
- Spectral Graph Theory (2012) — 57 citations
- Efficient erasure correcting codes (2001) — 1,273 citations
- An elementary proof of the restricted invertibility theorem (2009) — 76 citations
- Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees (2013) — 459 citations
- Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems (2006) — 471 citations
- Graph Sparsification by Effective Resistances