Anurag Ajay, Seungwook Han, et al.
NeurIPS 2023
Paper
Lower Bounds for Distributed Maximum-Finding Algorithms
Abstract
Tills paper establishes several lower bounds of the form Ω(nlogn) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller. © 1984, ACM. All rights reserved.
Related
Conference paper
Hybrid reinforcement learning with expert state sequences
Xiaoxiao Guo, Shiyu Chang, et al.
AAAI 2019
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022