@techreport{oai:ipsj.ixsq.nii.ac.jp:00217356,
 author = {Gregory, Schwartzman and Gregory, Schwartzman},
 issue = {8},
 month = {Mar},
 note = {Smoothed analysis is a framework for mediating gaps between worst-case and average-case complexities. Despite its increasing popularity for the analysis of classical (sequential) algorithms, there is little known about its applicability for distributed systems. In this talk, I will present motivation for smoothed analysis of distributed systems, survey recent results, and discuss directions for future work., Smoothed analysis is a framework for mediating gaps between worst-case and average-case complexities. Despite its increasing popularity for the analysis of classical (sequential) algorithms, there is little known about its applicability for distributed systems. In this talk, I will present motivation for smoothed analysis of distributed systems, survey recent results, and discuss directions for future work.},
 title = {Smoothed analysis for distributed systems},
 year = {2022}
}