2026-04-10T16:46:53Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00217356 2025-01-19T15:31:41Z 1164:2592:10824:10900

Smoothed analysis for distributed systems Smoothed analysis for distributed systems Gregory, Schwartzman Gregory, Schwartzman 招待講演 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. technical report 情報処理学会 2022-03-07 application/pdf 研究報告アルゴリズム（AL） 8 2022-AL-187 1 1 2188-8566 AN1009593X https://ipsj.ixsq.nii.ac.jp/record/217356/files/IPSJ-AL22187008.pdf eng