Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025
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
Topological Data Analysis on Noisy Quantum Computers
Ismail Akhalwaya, Shashanka Ubaru, et al.
ICLR 2024
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010
Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst