2004
Time complexity of practical parallel steiner point insertion algorithms
Spielman D, Teng S, Üngör A. Time complexity of practical parallel steiner point insertion algorithms. 2004, 267-268. DOI: 10.1145/1007912.1007953.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 ResearchHighly fault-tolerant parallel computation
Spielman D. Highly fault-tolerant parallel computation. 2011 IEEE 52nd Annual Symposium On Foundations Of Computer Science 1996, 154-163. DOI: 10.1109/sfcs.1996.548474.Peer-Reviewed Original ResearchParallel computationComputational devicesReed-Solomon codesFault-tolerant computationError-correcting codesSmall overheadWrong outputValid inputsW processorsProcessorsMachineComputationSequential timeFaulty machineConstant factorCodeConstant probabilityFault-tolerant machineOverheadTime stepInputDevicesFailure probabilityOutputModel
1994
Expander codes
Sipser M, Spielman D. Expander codes. 1994, 566-576. DOI: 10.1109/sfcs.1994.365734.Peer-Reviewed Original Research