2012
Twice-Ramanujan Sparsifiers
Batson J, Spielman D, Srivastava N. Twice-Ramanujan Sparsifiers. SIAM Journal On Computing 2012, 41: 1704-1721. DOI: 10.1137/090772873.Peer-Reviewed Original Research
2008
Graph sparsification by effective resistances
Spielman D, Srivastava N. Graph sparsification by effective resistances. 2008, 563-568. DOI: 10.1145/1374376.1374456.Peer-Reviewed Original Research
1999
Constructing Error-Correcting Codes from Expander Graphs
Spielman D. Constructing Error-Correcting Codes from Expander Graphs. The IMA Volumes In Mathematics And Its Applications 1999, 109: 591-600. DOI: 10.1007/978-1-4612-1544-8_25.Peer-Reviewed Original Research
1996
Expander codes
Sipser M, Spielman D. Expander codes. IEEE Transactions On Information Theory 1996, 42: 1710-1722. DOI: 10.1109/18.556667.Peer-Reviewed Original Research
1994
Expander codes
Sipser M, Spielman D. Expander codes. 1994, 566-576. DOI: 10.1109/sfcs.1994.365734.Peer-Reviewed Original Research