Daniel A. Spielman

Daniel A. Spielman is a person.

• See: Simplex Algorithm.

---

---

References

• Google Scholar Author Page: http://scholar.google.com/citations?user=L82mYv8AAAAJ

2009

• (Daitch et al., 2009) ⇒ Samuel Daitch, Jonathan Kelner and Daniel Spielman. (2009). “Fitting a Graph to Vector Data.” In: Proceedings of ICML 2009.

2006

• (Kelner & Spielman, 2006) ⇒ Jonathan A. Kelner, and Daniel A. Spielman. (2006). “A Randomized Polynomial-time Simplex Algorithm for Linear Programming.” In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing. doi:10.1145/1132516.1132524

2004

• (Spielman & Teng, 2004a) ⇒ Daniel A. Spielman, and Shang-Hua Teng. (2004). “Smoothed Analysis of Algorithms: Why the simplex algorithm usually takes polynomial time.” In: Journal of the ACM (JACM) 51, no. 3.
• (Spielman & Teng, 2004b) ⇒ Daniel A. Spielman, and Shang-Hua Teng. (2004). “Nearly-linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems.” In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing. doi:10.1145/1007352.1007372

2001

• (Luby et al., 2001) ⇒ Michael G. Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, and Daniel A. Spielman. (2001). “Efficient erasure correcting codes.” In: IEEE Transactions on Information Theory, 47(2).

---