2006
Smoothed Analysis of Algorithms and Heuristics
Spielman D, Teng S. Smoothed Analysis of Algorithms and Heuristics. 2006, 274-342. DOI: 10.1017/cbo9780511721571.010.Peer-Reviewed Original ResearchSmoothed analysisAnalysis of algorithmsNumber of iterationsMathematical programmingCombinatorial optimizationComputational geometryApproximation algorithmIterative algorithmApproximation ratioRandomized algorithmDiscrete inputsPerturbation modelRandom bitsScientific computingError probabilityTime complexityCompetitive ratioNumber of callsAlgorithmOnline algorithmNumber of bitsOpen questionHeuristicsIterationComputation
2001
Introduction to the Special Issue on Codes on Graphs and Iterative Algorithms
Frey B, Koetter R, Forney G, Kschischang F, Mceliece R, Spielman D. Introduction to the Special Issue on Codes on Graphs and Iterative Algorithms. IEEE Transactions On Information Theory 2001, 47: 493. DOI: 10.1109/tit.2001.910571.Peer-Reviewed Original Research