Zobrazeno 1 - 10
of 118
pro vyhledávání: '"Gelles, Ran"'
Interactive coding allows two parties to conduct a distributed computation despite noise corrupting a certain fraction of their communication. Dani et al.\@ (Inf.\@ and Comp., 2018) suggested a novel setting in which the amount of noise is unbounded
Externí odkaz:
http://arxiv.org/abs/2407.09463
We examine sorting algorithms for $n$ elements whose basic operation is comparing $t$ elements simultaneously (a $t$-comparator). We focus on algorithms that use only a single round or two rounds -- comparisons performed in the second round depend on
Externí odkaz:
http://arxiv.org/abs/2405.12678
In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content of all messages across all channels. In a recent work, Censor-Hillel, C
Externí odkaz:
http://arxiv.org/abs/2405.03646
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
Constructing a shortest path between two network nodes is a fundamental task in distributed computing. This work develops schemes for the construction of shortest paths in randomized beeping networks between a predetermined source node and an arbitra
Externí odkaz:
http://arxiv.org/abs/2210.06882
We address fully-defective asynchronous networks, in which all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be completely corrupted. Despite the possible intuition that such a setting is
Externí odkaz:
http://arxiv.org/abs/2205.11148
Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic algorithms. T
Externí odkaz:
http://arxiv.org/abs/2105.11713
Autor:
Mukherjee, Manuj, Gelles, Ran
We consider computations over networks with multiple broadcast channels that intersect at a single party. Each broadcast link suffers from random bit-flip noise that affects the receivers independently. We design interactive coding schemes that succe
Externí odkaz:
http://arxiv.org/abs/2105.01506
We introduce noisy beeping networks, where nodes have limited communication capabilities, namely, they can only emit energy or sense the channel for energy. Furthermore, imperfections may cause devices to malfunction with some fixed probability when
Externí odkaz:
http://arxiv.org/abs/1909.06811
Publikováno v:
IEEE Transactions on Information Theory (Volume: 67, Issue: 6, June 2021); IEEE Transactions on Information Theory (Volume: 68, Issue: 7, July 2022)
In the field of interactive coding, two or more parties wish to carry out a distributed computation over a communication network that may be noisy. The ultimate goal is to develop efficient coding schemes that can tolerate a high level of noise while
Externí odkaz:
http://arxiv.org/abs/1901.09863