Related papers: The partial gossip problem revisited

This paper is a continuation of our earlier work "[T. Jin, Y.Y. Li and J. Xiong, On a fractional Nirenberg problem, part I: blow up analysis and compactness of solutions, to appear in J. Eur. Math. Soc.]", where compactness results were…

Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other secrets. Recently a number of authors studied distributed epistemic gossip protocols. These…

Gossip monoids form an algebraic model of networks with exclusive, transient connections in which nodes, when they form a connection, exchange all known information. They also arise naturally in pure mathematics, as the monoids generated by…

We prove that the quiver problem is NP complete.

In this note, we fill a gap in the proof of the heuristic GCD in the multivariate case made by Char, Geddes and Gonnet (JSC 1989) and give some additionnal information on this method.

We find it absurd that Walliser [1] essentially used the same analysis and obtained identical results as reported in [3], yet arrived at different conclusions. Namely, based on an incomplete theory and using erroneous arguments, he not only…

In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].

We give a new proof of Chen-Lin result with Li-Zhang method.

In this notice, we revisit the recent work [1] of Jung Yoog Kang and Tai Sup about special polynomials with exponential distribution in order to state some improvements and get new proofs for results therein.

We investigate self-correcting gossip protocols with errors. In distributed computing, protocols with errors have been widely investigated in temporal epistemic logics. Instead, we propose a dynamic epistemic logic. We show how to correct…

We give a short proof of a theorem of J.-E. Pin (theorem 1.1 below), which can be found in his thesis. The part of the proof which is my own (not Pin's) is a complete replacement of the same part in an earlier version of this paper.

Consider a network of agents connected by communication links, where each agent holds a real value. The gossip problem consists in estimating the average of the values diffused in the network in a distributed manner. We develop a method…

We prove some symmetric $q$-congruences.

Distributed gossip algorithm has been studied in literature for practical implementation of the distributed consensus algorithm as a fundamental algorithm for the purpose of in-network collaborative processing. This paper focuses on…

The said paper [2] entitled "Proof Of Two Dimensional Jacobian Conjecture" is with gaps.

We give a new and short proof of a theorem on k-hypertournament losing scores due to Zhou et al. [G. Zhou, T. Yao, K. Zhang, On score sequences of k-tournaments, European J. Comb., 21, 8 (2000) 993-1000.]

In this short note the authors give answers to the three open problems formulated by Wu and Srivastava [{\it Appl. Math. Lett. 25 (2012), 1347--1353}]. We disprove the Problem 1, by showing that there exists a triangle which does not…

Gossip protocols are widely used to disseminate information in massive peer-to-peer networks. These protocols are often claimed to guarantee privacy because of the uncertainty they introduce on the node that started the dissemination. But…

We claim to resolve the P=?NP problem via a formal argument for P=NP.

Results are well-known