Zobrazeno 1 - 10
of 2 262
pro vyhledávání: '"P.-A. Raynal"'
Autor:
Baldovin, Marco, Yedder, Ines Ben, Plata, Carlos A., Raynal, Damien, Rondin, Loïc, Trizac, Emmanuel, Prados, Antonio
Optimal control of levitated particles subject to thermal fluctuations is a challenging problem, both from the theoretical and the experimental perspective. In this paper we compute the time-dependent harmonic confining potential that steers a Browni
Externí odkaz:
http://arxiv.org/abs/2408.00043
Autor:
Albouy, Timothé, Anceaume, Emmanuelle, Frey, Davide, Gestin, Mathieu, Rauch, Arthur, Raynal, Michel, Taïani, François
This article introduces a new asynchronous Byzantine-tolerant asset transfer system (cryptocurrency) with three noteworthy properties: quasi-anonymity, lightness, and consensus-freedom. Quasi-anonymity means no information is leaked regarding the rec
Externí odkaz:
http://arxiv.org/abs/2405.18072
Autor:
Albouy, Timothé, Frey, Davide, Gelles, Ran, Hazay, Carmit, Raynal, Michel, Schiller, Elad Michael, Taïani, François, Zikas, Vassilis
We address the problem of Reliable Broadcast in asynchronous message-passing systems with $n$ nodes, of which up to $t$ are malicious (faulty), in addition to a message adversary that can drop some of the messages sent by correct (non-faulty) nodes.
Externí odkaz:
http://arxiv.org/abs/2312.16253
This paper explores the territory that lies between best-effort Byzantine-Fault-Tolerant Conflict-free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers, such as those implemented by Blockchains. It formally characterizes a no
Externí odkaz:
http://arxiv.org/abs/2311.13936
As shown by Reliable Broadcast and Consensus, cooperation among a set of independent computing entities (sequential processes) is a central issue in distributed computing. Considering $n$-process asynchronous message-passing systems where some proces
Externí odkaz:
http://arxiv.org/abs/2311.08776
Consensus, abstracting a myriad of problems in which processes have to agree on a single value, is one of the most celebrated problems of fault-tolerant distributed computing. Consensus applications include fundamental services for the environments o
Externí odkaz:
http://arxiv.org/abs/2311.09075
This article unifies and generalizes fundamental results related to $n$-process asynchronous crash-prone distributed computing. More precisely, it proves that for every $0\leq k \leq n$, assuming that process failures occur only before the number of
Externí odkaz:
http://arxiv.org/abs/2309.11350
Numerous distributed applications, such as cloud computing and distributed ledgers, necessitate the system to invoke asynchronous consensus objects an unbounded number of times, where the completion of one consensus instance is followed by the invoca
Externí odkaz:
http://arxiv.org/abs/2307.14801
This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct. This time plays a crucial role in the performance of practical distri
Externí odkaz:
http://arxiv.org/abs/2303.05152
In this work we continue to investigate well-posedness for stable driven McKean-Vlasov SDEs with distributional interaction kernel following the approach introduced in [8]. We specifically focus on the impact of the Besov smoothness of the initial co
Externí odkaz:
http://arxiv.org/abs/2302.09900