Daniel A. Spielman
Daniel A. Spielman publishes mostly in Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications, on topics such as Complexity and Algorithms in Graphs, Matrix Theory and Algorithms and Graph theory and applications.
- World rank
- #19,991 of 1,633,909 ranked researchers
- Rank in United States
- #9,490 of 358,040
- Works
- 43
- Citations
- 933
- Citations per work
- 21.7
What does Daniel A. Spielman research?
Shares of their own output, by the field each of their topics belongs to. The grey slice is everything not listed.
- 1Computational Theory and Mathematics27% of their works
- 2Artificial Intelligence14% of their works
- 3Computer Networks and Communications10% of their works
- 4Geometry and Topology8% of their works
- 5Computer Graphics and Computer-Aided Design6% of their works
- 6Computational Mechanics6% of their works
Research topics
Which keywords describe Daniel A. Spielman's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Combinatorial Optimization, Complexity Theory, Graph Spectra, Matrix Computations, Numerical Linear Algebra and Topological Indices.
- Stochastic Gradient Descent
- Error-Correcting Codes
- Parameterized Complexity
- Homomorphic Encryption
- Mesh Generation
- Topological Indices
- Matrix Computations
- Complexity Theory
- Algorithmic Applications
- Approximation Algorithms
- Combinatorial Optimization
- Graph Spectra
- Numerical Linear Algebra
- Delaunay Triangulations
- Graph Theory
- Identity-Based Encryption
- Cryptography
- Random Projections
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most.
All 18 words, with their numbers
- Approximation Algorithms164 topics
- Algorithmic Applications102 topics
- Combinatorial Optimization71 topic
- Complexity Theory71 topic
- Graph Spectra51 topic
- Matrix Computations51 topic
- Numerical Linear Algebra51 topic
- Topological Indices51 topic
- Delaunay Triangulations41 topic
- Mesh Generation41 topic
- Graph Theory31 topic
- Homomorphic Encryption31 topic
- Identity-Based Encryption31 topic
- Parameterized Complexity31 topic
- Cryptography21 topic
- Error-Correcting Codes21 topic
- Random Projections21 topic
- Stochastic Gradient Descent21 topic
Where does Daniel A. Spielman work?
Daniel A. Spielman's main affiliation in the publication record is Yale University, United States.
How many publications and citations does Daniel A. Spielman have?
Science Explorer counts 43 works and 933 citations for Daniel A. Spielman, ranking #19,991 of 1,633,909 researchers worldwide on the composite score.
Ranked on field-normalised excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics are in the interactive view on the map. Is this your page? Request a correction or removal.