ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1509.02140
  4. Cited By
A Faster Counting Protocol for Anonymous Dynamic Networks

A Faster Counting Protocol for Anonymous Dynamic Networks

7 September 2015
A. Milani
Miguel A. Mosteiro
ArXiv (abs)PDFHTML

Papers citing "A Faster Counting Protocol for Anonymous Dynamic Networks"

4 / 4 papers shown
Title
Efficient Distributed Computations in Anonymous Dynamic Congested
  Systems with Opportunistic Connectivity
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity
Dariusz R. Kowalski
Miguel A. Mosteiro
35
4
0
15 Feb 2022
Polynomial Anonymous Dynamic Distributed Computing without a Unique
  Leader
Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader
Dariusz R. Kowalski
Miguel A. Mosteiro
21
13
0
07 Apr 2021
Polynomial Counting in Anonymous Dynamic Networks with Applications to
  Anonymous Dynamic Algebraic Computations
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
Dariusz R. Kowalski
Miguel A. Mosteiro
38
22
0
13 Jul 2017
Counting in Practical Anonymous Dynamic Networks is Polynomial
Counting in Practical Anonymous Dynamic Networks is Polynomial
Maitri Chakraborty
A. Milani
Miguel A. Mosteiro
23
10
0
17 Mar 2016
1