We give the first linear-time counting algorithm for processes in anonymous 1-interval-connected dynamic networks with a leader. As a byproduct, we are able to compute in $3n$ rounds every function that is deterministically computable in such networks. If explicit termination is not required, the running time improves to $2n$ rounds, which we show to be optimal up to a small additive constant (this is also the first non-trivial lower bound for counting). As our main tool of investigation, we introduce a combinatorial structure called "history tree", which is of independent interest. This makes our paper completely self-contained, our proofs elegant and transparent, and our algorithms straightforward to implement. In recent years, considerable effort has been devoted to the design and analysis of counting algorithms for anonymous 1-interval-connected networks with a leader. A series of increasingly sophisticated works, mostly based on classical mass-distribution techniques, have recently led to a celebrated counting algorithm in $O({n^{4+ \epsilon}} \log^{3} (n))$ rounds (for $\epsilon>0$), which was the state of the art prior to this paper. Our contribution not only opens a promising line of research on applications of history trees, but also demonstrates that computation in anonymous dynamic networks is practically feasible, and far less demanding than previously conjectured.

翻译：我们首次提出了在具有领导者的匿名1-区间连通动态网络中的线性时间计数算法。作为副产品，我们能够在$3n$轮内计算此类网络中可确定性计算的任意函数。若不需要显式终止，运行时间可优化至$2n$轮，我们证明这在加减一个小的常数后是最优的（这也是计数问题的首个非平凡下界）。作为主要研究工具，我们引入了一种称为"历史树"的组合结构，该结构具有独立的研究价值。这使得我们的论文完全自包含，证明过程优雅透明，算法实现简单直接。近年来，大量研究致力于设计和分析具有领导者的匿名1-区间连通网络中的计数算法。一系列日益精妙的成果（主要基于经典的质量分布技术）最近提出了一个在$O({n^{4+ \epsilon}} \log^{3} (n))$轮内（其中$\epsilon>0$）的著名计数算法——这曾是本文之前的最新进展。我们的贡献不仅开辟了历史树应用研究的前景方向，更证明了匿名动态网络中的计算具有实际可行性，且其计算开销远低于之前的推测。