Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Paz, Ami"'
Consensus is arguably the most studied problem in distributed computing as a whole, and particularly in the distributed message-passing setting. In this latter framework, research on consensus has considered various hypotheses regarding the failure t
Externí odkaz:
http://arxiv.org/abs/2410.21538
Autor:
Biabani, Leyla, Paz, Ami
The $k$-center problem is a central optimization problem with numerous applications for machine learning, data mining, and communication networks. Despite extensive study in various scenarios, it surprisingly has not been thoroughly explored in the t
Externí odkaz:
http://arxiv.org/abs/2407.18031
The paper compares two generic techniques for deriving lower bounds and impossibility results in distributed computing. First, we prove a speedup theorem (a-la Brandt, 2019), for wait-free colorless algorithms, aiming at capturing the essence of the
Externí odkaz:
http://arxiv.org/abs/2308.04213
Consensus is one of the most fundamental problems in distributed computing. This paper studies the consensus problem in a synchronous dynamic directed network, in which communication is controlled by an oblivious message adversary. The question when
Externí odkaz:
http://arxiv.org/abs/2304.02316
Emerging software-defined networking technologies enable more adaptive communication infrastructures, allowing for quick reactions to changes in networking requirements by exploiting the workload's temporal structure. However, operating networks adap
Externí odkaz:
http://arxiv.org/abs/2211.03716
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions. Prior work has shown strong conditional lower bounds for general dyna
Externí odkaz:
http://arxiv.org/abs/2208.07572
We study two fundamental problems of distributed computing, consensus and approximate agreement, through a novel approach for proving lower bounds and impossibility results, that we call the asynchronous speedup theorem. For a given $n$-process task
Externí odkaz:
http://arxiv.org/abs/2206.05356
Autor:
Paz, Ami, Peterfreund, Liat
Publikováno v:
In Theoretical Computer Science 12 November 2024 1016
Consensus is a most fundamental task in distributed computing. This paper studies the consensus problem for a set of processes connected by a dynamic directed network, in which computation and communication is lock-step synchronous but controlled by
Externí odkaz:
http://arxiv.org/abs/2202.12397
Autor:
Balliu, Alkida, Korhonen, Janne H., Kuhn, Fabian, Lievonen, Henrik, Olivetti, Dennis, Pai, Shreyas, Paz, Ami, Rybicki, Joel, Schmid, Stefan, Studený, Jan, Suomela, Jukka, Uitto, Jara
The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of sinkless orient
Externí odkaz:
http://arxiv.org/abs/2108.02655