Daniel A. Spielman
Impact in
- Computer Networks and Communications top 0.2%
- Error Correcting Code Techniques
- Cooperative Communication and Network Coding
- Computational Theory and Mathematics top 0.1%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 30
- Advanced Graph Theory Research 17
- Matrix Theory and Algorithms 13
-
- Limits and Structures in Graph Theory 8
- Co-authors
- Shang‐Hua TengMichael LubyMichael MitzenmacherMohammad Amin ShokrollahiNikhil SrivastavaM. SipserVolker StemannJoshua Batson
- Journals
- SIAM Journal on Computing (6 papers)IEEE Transactions on Information Theory (6 papers)SIAM Journal on Matrix Analysis and Applications (3 papers)Communications of the ACM (3 papers)Israel Journal of Mathematics (2 papers)
- Partner nations
- United StatesIndiaRussia
In The Last Decade
Daniel A. Spielman
86 papers receiving 6.1k citations
Hit Papers
Peers
Comparison fields: 5 of 121
- Computer Networks and Communications 3.3k
- Computational Theory and Mathematics 2.0k
- Computational Mathematics 56
- Artificial Intelligence 2.2k
- Discrete Mathematics and Combinatorics 213
Countries citing papers authored by Daniel A. Spielman
This map shows the geographic impact of Daniel A. Spielman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel A. Spielman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel A. Spielman more than expected).
Fields of papers citing papers by Daniel A. Spielman
This network shows the impact of papers produced by Daniel A. Spielman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel A. Spielman. The network helps show where Daniel A. Spielman may publish in the future.
Co-authors
The 25 scholars most cited alongside Daniel A. Spielman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2023 | 7 | |
| 2 | Balancing covariates in randomized experiments using the Gram-Schmidt walk. | 2019 | 8 |
| 3 | 2016 | 34 | |
| 4 | Algorithms for Lipschitz Learning on Graphs | 2015 | 7 |
| 5 | 2015 | 10 | |
| 6 | Exact Recovery of Sparsely-Used Dictionaries | 2012 | 31 |
| 7 | 2011 | 51 | |
| 8 | 2009 | 10 | |
| 9 | 2009 | 1 | |
| 10 | 2007 | 6 | |
| 11 | Accelerated Gossip Algorithms for Distributed Computation | 2006 | 45 |
| 12 | 2006 | 118 | |
| 13 | A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version) | 2005 | 2 |
| 14 | 2005 | 8 | |
| 15 | Smoothed Analysis (Motivation and Discrete Models). | 2003 | 17 |
| 16 | Smoothed Analysis of Renegar’s Condition Number for Linear Programming | 2002 | 19 |
| 17 | 2001 | 8 | |
| 18 | 2001 | 493 | |
| 19 | 2001 | 74 | |
| 20 | Highly Fault-Tolerant Parallel Computation (Extended Abstract) | 1996 | 1 |
About Daniel A. Spielman
Daniel A. Spielman is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Computational Mathematics, having authored 87 papers that have together received 6.7k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (30 papers), Graph theory and applications (17 papers), Advanced Graph Theory Research (17 papers), Matrix Theory and Algorithms (13 papers), Error Correcting Code Techniques (9 papers), Coding theory and cryptography (9 papers), Machine Learning and Algorithms (8 papers) and Limits and Structures in Graph Theory (8 papers). The work is most often cited by research in Computer Networks and Communications (3.3k citations), Computational Theory and Mathematics (2.0k citations), Computational Mathematics (56 citations), Artificial Intelligence (2.2k citations) and Discrete Mathematics and Combinatorics (213 citations). Daniel A. Spielman has collaborated with scholars based in United States, India and Russia. Frequent co-authors include Shang‐Hua Teng, Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Nikhil Srivastava, M. Sipser, Volker Stemann, Joshua Batson, Adam W. Marcus and Richard Beigel. Their work appears in journals such as SIAM Journal on Computing, IEEE Transactions on Information Theory, SIAM Journal on Matrix Analysis and Applications, Communications of the ACM and Israel Journal of Mathematics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.