Travelled to:1 × Greece
1 × United Kingdom
12 × USA
3 × Canada
Collaborated with:∅ S.Teng J.A.Kelner S.I.Daitch N.Srivastava R.Peng A.Klivans A.Polishchuk M.Luby M.Mitzenmacher M.A.Shokrollahi J.D.Batson R.Beigel N.Reingold M.Elkin Y.Emek P.Christiano A.Madry V.Stemann A.M.Childs R.Cleve E.Deotto E.Farhi S.Gutmann
Talks about:graph (8) algorithm (7) linear (7) time (4) polynomi (3) system (3) faster (3) flow (3) code (3) laplacian (2)
Person: Daniel A. Spielman
DBLP: Spielman:Daniel_A=
Contributed to:
2014
20122011
20092009200820062005200420032001199819971996199519941991Wrote 19 papers:
- STOC-2014-PengS #linear #parallel #performance
- An efficient parallel solver for SDD linear systems (RP, DAS), pp. 333–342.
- ICALP-v2-2012-Spielman #algorithm #equation #graph #linear
- Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations (DAS), pp. 24–26.
- STOC-2011-ChristianoKMST #approximate #graph #performance
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (PC, JAK, AM, DAS, SHT), pp. 273–282.
- ICML-2009-DaitchKS #graph
- Fitting a graph to vector data (SID, JAK, DAS), pp. 201–208.
- STOC-2009-BatsonSS
- Twice-ramanujan sparsifiers (JDB, DAS, NS), pp. 255–262.
- STOC-2008-DaitchS #algorithm #approximate #performance
- Faster approximate lossy generalized flow via interior point algorithms (SID, DAS), pp. 451–460.
- STOC-2008-SpielmanS #effectiveness #graph
- Graph sparsification by effective resistances (DAS, NS), pp. 563–568.
- STOC-2006-KelnerS #algorithm #linear #polynomial #programming #random
- A randomized polynomial-time simplex algorithm for linear programming (JAK, DAS), pp. 51–60.
- STOC-2005-ElkinEST
- Lower-stretch spanning trees (ME, YE, DAS, SHT), pp. 494–503.
- STOC-2004-SpielmanT #algorithm #clustering #graph #linear
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (DAS, SHT), pp. 81–90.
- STOC-2003-ChildsCDFGS #algorithm #exponential #quantum
- Exponential algorithmic speedup by a quantum walk (AMC, RC, ED, EF, SG, DAS), pp. 59–68.
- STOC-2001-KlivansS #multi #performance #testing
- Randomness efficient identity testing of multivariate polynomials (AK, DAS), pp. 216–223.
- STOC-2001-SpielmanT #algorithm #analysis #polynomial #why
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (DAS, SHT), pp. 296–305.
- STOC-1998-LubyMSS #analysis #design #graph #using
- Analysis of Low Density Codes and Improved Designs Using Irregular Graphs (ML, MM, MAS, DAS), pp. 249–258.
- STOC-1997-LubyMSSS
- Practical Loss-Resilient Codes (ML, MM, MAS, DAS, VS), pp. 150–159.
- STOC-1996-Spielman #graph #morphism #performance #testing
- Faster Isomorphism Testing of Strongly Regular Graphs (DAS), pp. 576–584.
- STOC-1995-Spielman #linear
- Linear-time encodable and decodable error-correcting codes (DAS), pp. 388–397.
- STOC-1994-PolishchukS #artificial reality #proving
- Nearly-linear size holographic proofs (AP, DAS), pp. 194–203.
- STOC-1991-BeigelRS
- PP Is Closed Under Intersection (RB, NR, DAS), pp. 1–9.