The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel A. Spielman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel A. Spielman, Shang-Hua Teng
    Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. [Citation Graph (1, 0)][DBLP]
    FOCS, 1996, pp:96-105 [Conf]
  2. Richard Beigel, Nick Reingold, Daniel A. Spielman
    The Perceptron Strikes Back. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:286-291 [Conf]
  3. Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman
    The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:338-346 [Conf]
  4. Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram
    Alternation in Interaction. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:294-303 [Conf]
  5. Daniel A. Spielman
    Models of Computation in Coding Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:120-0 [Conf]
  6. Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng
    Min-Max-Boundary Domain Decomposition. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:137-146 [Conf]
  7. Daniel A. Spielman, Shang-Hua Teng
    Disk Packings and Planar Separators. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:349-358 [Conf]
  8. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Parallel Delaunay Refinement with Off-Centers. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:812-819 [Conf]
  9. Daniel A. Spielman
    The Smoothed Analysis of Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:17-18 [Conf]
  10. Daniel A. Spielman
    The Complexity of Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:67-84 [Conf]
  11. Amit Deshpande, Daniel A. Spielman
    Improved Smoothed Analysis of the Shadow Vertex Simplex Method. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:349-356 [Conf]
  12. Michael Sipser, Daniel A. Spielman
    Expander Codes [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:566-576 [Conf]
  13. Daniel A. Spielman
    Highly Fault-Tolerant Parallel Computation (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:154-163 [Conf]
  14. Daniel A. Spielman, Shang-Hua Teng
    Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:416-427 [Conf]
  15. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Parallel Delaunay Refinement: Algorithms And Analyses. [Citation Graph (0, 0)][DBLP]
    IMR, 2002, pp:205-217 [Conf]
  16. Richard Beigel, Grigorii Margulis, Daniel A. Spielman
    Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:21-29 [Conf]
  17. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Time complexity of practical parallel steiner point insertion algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:267-268 [Conf]
  18. Richard Beigel, Nick Reingold, Daniel A. Spielman
    PP Is Closed Under Intersection (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:1-9 [Conf]
  19. Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman
    Exponential algorithmic speedup by a quantum walk. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:59-68 [Conf]
  20. Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng
    Lower-stretch spanning trees. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:494-503 [Conf]
  21. Jonathan A. Kelner, Daniel A. Spielman
    A randomized polynomial-time simplex algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:51-60 [Conf]
  22. Adam Klivans, Daniel A. Spielman
    Randomness efficient identity testing of multivariate polynomials. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:216-223 [Conf]
  23. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
    Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:249-258 [Conf]
  24. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann
    Practical Loss-Resilient Codes. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:150-159 [Conf]
  25. Alexander Polishchuk, Daniel A. Spielman
    Nearly-linear size holographic proofs. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:194-203 [Conf]
  26. Daniel A. Spielman
    Linear-time encodable and decodable error-correcting codes. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:388-397 [Conf]
  27. Daniel A. Spielman
    Faster Isomorphism Testing of Strongly Regular Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:576-584 [Conf]
  28. Daniel A. Spielman, Shang-Hua Teng
    Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:296-305 [Conf]
  29. Daniel A. Spielman, Shang-Hua Teng
    Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:81-90 [Conf]
  30. Daniel A. Spielman, Shang-Hua Teng
    Smoothed Analysis (Motivation and Discrete Models). [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:256-270 [Conf]
  31. Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman
    The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:158-174 [Journal]
  32. Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram
    Alternation in interaction. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:3-4, pp:202-246 [Journal]
  33. Daniel A. Spielman, Miklós Bóna
    An Infinite Antichain of Permutations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  34. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Parallel Delaunay Refinement: Algorithms and Analyses [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  35. Daniel A. Spielman, Shang-Hua Teng
    Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  36. Daniel A. Spielman, Shang-Hua Teng
    Smoothed Analysis of Interior-Point Algorithms: Termination [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  37. John Dunagan, Daniel A. Spielman, Shang-Hua Teng
    Smoothed Analysis of Interior-Point Algorithms: Condition Number [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  38. Daniel A. Spielman, Shang-Hua Teng
    Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  39. Daniel A. Spielman, Shang-Hua Teng
    Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  40. Michael Elkin, Daniel A. Spielman, Shang-Hua Teng
    Lower-Stretch Spanning Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  41. Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng
    Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  42. Jonathan A. Kelner, Daniel A. Spielman
    A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:156, pp:- [Journal]
  43. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Parallel Delaunay Refinement: Algorithms and Analyses. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2007, v:17, n:1, pp:1-30 [Journal]
  44. Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann
    A Remark on Matrix Rigidity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:6, pp:283-285 [Journal]
  45. Daniel A. Spielman, Shang-Hua Teng
    Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:3, pp:385-463 [Journal]
  46. Richard Beigel, Nick Reingold, Daniel A. Spielman
    PP Is Closed under Intersection. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:2, pp:191-202 [Journal]
  47. Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng
    Min-max-boundary domain decomposition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:2, pp:253-266 [Journal]
  48. Brendan J. Frey, Ralf Koetter, G. David Forney Jr., Frank R. Kschischang, Robert J. McEliece, Daniel A. Spielman
    Introduction to the special issue on codes on graphs and iterative algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:493-497 [Journal]
  49. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
    Efficient erasure correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:569-584 [Journal]
  50. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
    Improved low-density parity-check codes using irregular graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:585-598 [Journal]
  51. Michael Sipser, Daniel A. Spielman
    Expander codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1710-1722 [Journal]
  52. Daniel A. Spielman
    Linear-time encodable and decodable error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1723-1731 [Journal]
  53. Samuel I. Daitch, Daniel A. Spielman
    Support-Graph Preconditioners for 2-Dimensional Trusses [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  54. Daniel A. Spielman, Shang-Hua Teng
    Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  55. Spectral Graph Theory and its Applications. [Citation Graph (, )][DBLP]


  56. Fitting a graph to vector data. [Citation Graph (, )][DBLP]


  57. Graph sparsification by effective resistances. [Citation Graph (, )][DBLP]


  58. Faster approximate lossy generalized flow via interior point algorithms. [Citation Graph (, )][DBLP]


  59. Twice-ramanujan sparsifiers. [Citation Graph (, )][DBLP]


  60. Technical perspective - The beauty of error-correcting codes. [Citation Graph (, )][DBLP]


  61. Smoothed analysis: an attempt to explain the behavior of algorithms in practice. [Citation Graph (, )][DBLP]


  62. Graph Sparsification by Effective Resistances [Citation Graph (, )][DBLP]


  63. Faster Approximate Lossy Generalized Flow via Interior Point Algorithms [Citation Graph (, )][DBLP]


  64. Twice-Ramanujan Sparsifiers [Citation Graph (, )][DBLP]


  65. Spectral Sparsification of Graphs [Citation Graph (, )][DBLP]


  66. A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning [Citation Graph (, )][DBLP]


  67. A Note on Preconditioning by Low-Stretch Spanning Trees [Citation Graph (, )][DBLP]


Search in 2.827secs, Finished in 2.830secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002