( en | de | ru )

 

Disambiguation of "Spielman, Daniel A."

Author of the publication

copydeleteadd this publication to your clipboard
Spectral Sparsification of Graphs

, and . CoRR, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel Chalbaud A

Daniel A Ruppen

Daniel A Spitze

Daniel A Bruggisser

Florin Daniel Lip a

 

Other publications of authors with the same name

Spectral Sparsification of Graphs., and . SIAM J. Comput., 40 (4): 981-1025 (2011)Sparsified Cholesky Solvers for SDD linear systems., , and . CoRR, (2015)Smoothed Analysis (Motivation and Discrete Models)., and . WADS, volume 2748 of Lecture Notes in Computer Science, page 256-270. Springer, (2003)Exponential algorithmic speedup by a quantum walk., , , , , and . STOC, page 59-68. ACM, (2003)Min-Max-Boundary Domain Decomposition., , and . COCOON, volume 1449 of Lecture Notes in Computer Science, page 137-146. Springer, (1998)Sparsified Cholesky and multigrid solvers for connection laplacians., , , , and . STOC, page 842-850. ACM, (2016)PP Is Closed under Intersection., , and . J. Comput. Syst. Sci., 50 (2): 191-202 (1995)A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version), and . Electron. Colloquium Comput. Complex., (2005)Twice-Ramanujan Sparsifiers, , and . SIAM Journal on Computing, 41 (6): 1704-1721 (January 2012)Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time, and . J. ACM, 51 (3): 385--463 (May 2004)