Zobrazeno 1 - 10
of 139
pro vyhledávání: '"Newport, Calvin"'
The best known solutions for $k$-message broadcast in dynamic networks of size $n$ require $\Omega(nk)$ rounds. In this paper, we see if these bounds can be improved by smoothed analysis. We study perhaps the most natural randomized algorithm for dis
Externí odkaz:
http://arxiv.org/abs/2208.05998
Publikováno v:
Journal of Medical Internet Research, Vol 16, Iss 4, p e107 (2014)
BackgroundTwitter is becoming an important tool in medicine, but there is little information on Twitter metrics. In order to recommend best practices for information dissemination and diffusion, it is important to first study and analyze the networks
Externí odkaz:
https://doaj.org/article/635161b160b3498c80a24bb286271506
Publikováno v:
Journal of the ACM; Jun2024, Vol. 71 Issue 3, p1-24, 24p
Autor:
Kalyanasundaram, Bala, Newport, Calvin
In standard number-in-hand multi-party communication complexity, performance is measured as the total number of bits transmitted globally in the network. In this paper, we study a variation called local communication complexity in which performance i
Externí odkaz:
http://arxiv.org/abs/2111.11460
In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is provided a distribution defined over the possible network sizes that p
Externí odkaz:
http://arxiv.org/abs/2105.12706
In this paper, we study gossip algorithms in communication models that describe the peer-to-peer networking functionality included in most standard smartphone operating systems. We begin by describing and analyzing a new synchronous gossip algorithm
Externí odkaz:
http://arxiv.org/abs/2102.06804
We study three capacity problems in the mobile telephone model, a network abstraction that models the peer-to-peer communication capabilities implemented in most commodity smartphone operating systems. The capacity of a network expresses how much sus
Externí odkaz:
http://arxiv.org/abs/1908.01894
Autor:
Newport, Calvin, Weaver, Alex
In this paper, we study random gossip processes in communication models that describe the peer-to-peer networking functionality included in standard smartphone operating systems. Random gossip processes spread information through the basic mechanism
Externí odkaz:
http://arxiv.org/abs/1902.02763
Autor:
Newport, Calvin, Zheng, Chaodong
For many distributed algorithms, neighborhood size is an important parameter. In radio networks, however, obtaining this information can be difficult due to ad hoc deployments and communication that occurs on a collision-prone shared channel. This pa
Externí odkaz:
http://arxiv.org/abs/1811.03278
Autor:
Newport, Calvin, Robinson, Peter
In this paper, we study fault-tolerant distributed consensus in wireless systems. In more detail, we produce two new randomized algorithms that solve this problem in the abstract MAC layer model, which captures the basic interface and communication g
Externí odkaz:
http://arxiv.org/abs/1810.02848