On the average communication complexity of asynchronous distributed algorithms
暂无分享,去创建一个
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] Dimitri Bertsekas,et al. Distributed dynamic programming , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[3] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[4] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[5] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[6] J. Walrand,et al. Distributed Dynamic Programming , 2022 .