Pith. sign in

REVIEW 6 minor 35 references

Computing in Anonymous Dynamic Networks with One-Bit Communications

T0 review · 0 major / 6 minor · reviewed 2026-07-14 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read One-bit broadcasts still let anonymous dynamic networks compute any input multiset function, matching congested O(n^3) up to logs.

desk verdict Near-matching cubic one-bit algorithms and lower bound for multiset computation in anonymous dynamic networks; the cut-test linear system and adaptive flooding are the real contributions. read the letter →

arxiv 2607.08358 v2 pith:DQLCLMGI submitted 2026-07-09 cs.DC

Thibaut Blanc , Giuseppe Antonio Di Luna , Giovanni Viglietta This is my paper · ORCID
classification cs.DC
keywords anonymousdynamicnetworksone-bitcommunicationbroadcast-countingmodelinputmultisetadaptivefloodinglinearconstraints1-intervalconnectivitycongested
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks how much communication bandwidth anonymous dynamic networks actually need for global computation. Agents have no IDs, the topology can change every round (only remaining connected), and each agent may broadcast only a single bit; it learns only how many neighbors sent 0 and how many sent 1. Despite that triple restriction, the authors show that any computable function of the agents' input multiset can still be computed. With a unique leader and a known size bound U, a terminating algorithm finishes in O(n^3 log^2 n + U) rounds for large input universes; without any size knowledge the same task stabilizes in O(n^3 log^2 n) rounds. Companion results cover leaderless frequency computation and multi-leader multiset recovery. An information-theoretic lower bound of Omega(n^2 log(N/n)/log n) rounds, which reaches Omega(n^3) for huge N, shows the upper bounds are nearly tight even on a changing ring. The practical message is that compressing every message to one bit does not destroy the computational power of the congested model; only logarithmic factors are lost.

What carries the argument

One-bit cut tests that produce homogeneous linear conservation constraints on the sizes of refined indistinguishability classes; collecting enough independent equations recovers relative frequencies (and absolute multiplicities once leaders supply a known scale). For unknown size, a self-correcting adaptive flooding layer that doubles a speculative estimate and restarts on certificate failure.

What would settle it

Exhibit a family of 1-interval-connected executions with a unique leader and known n for which every deterministic one-bit algorithm fails to stabilize on the input set within o(n^2 log(N/n)/log n) rounds, or show that the linear-constraint collection cannot produce m-1 independent equations before the class partition stabilizes.

Watch

Extended reading notes

Core claim

In anonymous 1-interval-connected dynamic networks under one-bit broadcast-counting, a unique leader plus a known upper bound U yields a terminating algorithm for any computable function of the input multiset in O(n^3 log^2 n + U) rounds (N = 2^{O(n log n)}); without prior knowledge of n the same task stabilizes in O(n^3 log^2 n) rounds. These bounds essentially match the O(n^3) congested state of the art, and an almost-matching Omega(n^2 log(N/n)/log n) lower bound holds even with a leader, known n and N, and a dynamic ring.

Load-bearing premise

Every round's communication graph must stay connected, and some known positive number of leaders (or a local degree oracle) must break anonymity so absolute scale can be recovered.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 6 minor

Summary. The paper initiates the study of deterministic computation in anonymous 1-interval-connected dynamic networks under one-bit broadcast-counting: each agent sends a single bit and learns only the counts of neighbors sending 0 and 1. With a unique leader and a known upper bound U on n, the authors give a terminating algorithm for any computable function of the input multiset in O(n^{3} log^{2} n + U) rounds (for input universes of size N = 2^{O(n log n)}); without knowledge of n they give a stabilizing algorithm in O(n^{3} log^{2} n) rounds. Companion results cover leaderless Input Frequency and multi-leader Input Multiset/Counting, including an exponential-time terminating procedure that uses a local degree oracle to compute a size bound. An almost-matching information-theoretic lower bound of Ω(n^{2} log(N/n)/log n) is proved even on a dynamic ring with a unique leader and known n, N. The upper-bound technique extracts homogeneous linear constraints on class sizes via one-bit cut tests, refines indistinguishability classes, and (for unknown n) uses a self-correcting adaptive flooding layer with a four-channel recovery service.

Significance. If correct, the work shows that the computational power of congested anonymous dynamic networks is essentially preserved when every message is compressed to one bit, matching the O(n^{3}) congested state of the art up to logarithmic factors. The lower bound is strong (dynamic ring, unique leader, known n and N) and nearly tight for large input universes. The algorithmic route—turning aggregate one-bit observations into a solvable global linear system, plus the self-correcting adaptive flooding primitive—is of independent interest and cleanly separates the approach from history-tree and mass-distribution methods. The results are carefully scoped to the necessary connectivity and symmetry-breaking assumptions of the model. Overall this is a substantial contribution to the theory of anonymous dynamic networks.

minor comments (6)
  1. Section 6 (adaptive flooding and four-channel recovery) is dense. A short high-level roadmap at the start of §6—stating the three recovery phases (invalidation, silent control window, calendar reset) and what each guarantees before diving into Algorithms 8–10—would help readers track the amortization arguments in Lemmas 6.7–6.9.
  2. In §5.1.3 / Corollary 5.6, progress-set selection enumerates nonempty proper subsets and solves an LP for each. Unlimited local computation is standard for round-complexity results, but a one-sentence remark that local work may be exponential in the current number of classes would avoid any ambiguity about the computational model.
  3. Table 1 is very useful; adding a brief note in the caption that B_max = O(log N) (or O(n log n) for the large-universe regime) would make the reduction from the general bounds to the O(n^{3} log^{2} n) claims fully self-contained.
  4. Lemma 4.3 and Theorem 5.7: the DistinctValues cost is stated as O(U q (1+B_max)); a parenthetical that q ≤ min(n, N) is already implicit but would tighten the comparison with the lower bound in the paragraph after Lemma 4.3.
  5. Related work (§8): the comparison with counting full-duplex beeping models is clear; a single sentence noting that the degree-oracle result of §5.3 is the only place where degree information is assumed would further clarify the model boundary.
  6. Minor typographical consistency: the abstract and introduction alternate between O(n^{3} log^{2} n) and O(n 3 log2 n)-style spacing; unify the LaTeX for exponents and log factors throughout.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: one-bit upper/lower bounds are self-contained combinatorial and information-theoretic arguments, not forced by definition or by load-bearing self-citation.

full rationale

This is algorithmic distributed-computing theory. The central claims (terminating/stabilizing Input Multiset and Counting under one-bit broadcast-counting, and the Ω(n² log(N/n)/log n) Input-Set lower bound) are derived from the 1-interval-connectivity model, leader/scale assumptions, and explicit constructions: Flood/DistinctValues, cut-test linear constraints a·c′=0 from double-counting crossing edges (Lemma 5.1), progress-set existence in L⊥ (Lemma 5.4), and the four-channel adaptive-flooding recovery amortization (Lemmas 6.1–6.9, Theorem 7.4). The lower bound is a self-contained quiet-history pigeonhole argument on rings (Theorem 3.1). Self-citations to the authors’ history-tree and congested results [20–23] appear only as baselines and motivation (“essentially matches … O(n³)”); the paper explicitly does not simulate history trees or import a uniqueness theorem that forces the one-bit algorithms. There is no fitted parameter renamed as prediction, no self-definitional identity, and no ansatz smuggled in as an external fact. Residual risk is ordinary hand-proof detail, not circularity.

Assumptions & free parameters 0 free parameters · 5 assumptions · 2 invented entities

The central claims rest on standard distributed-computing model assumptions (synchronous rounds, 1-interval connectivity, anonymity, deterministic identical code) plus the paper’s one-bit observation model and optional leader/oracle knowledge. No free parameters are fitted to data. Invented entities are algorithmic primitives (progress sets, adaptive flooding layer), not physical postulates; they are defined operationally and analyzed inside the paper.

assumptions (5)
  • domain assumption Communication graphs G_t are connected in every round (1-interval connectivity).
    Stated in §2; used for Flood correctness (Lemma 4.1), cut connectivity, invalidation/reset propagation, and the lower-bound ring adversary.
  • domain assumption Agents are anonymous, execute the same deterministic algorithm, and start identical except for inputs and optional leader flags.
    Core anonymity model (§2); drives class refinement and the need for leaders/known k for absolute scale.
  • domain assumption Each round each agent broadcasts one bit and receives only the counts of neighbors that sent 0 and 1 (one-bit broadcast-counting).
    Defines the model under study (§2); all algorithms and the lower bound are relative to this observation interface.
  • domain assumption Either a unique leader, a known number k ≥ 1 of leaders, a known U ≥ n, or a local degree oracle is available depending on the theorem.
    Explicit assumption table and theorems (§§5–7); without some scale reference, absolute Counting/Multiset is impossible in anonymous networks as cited.
  • standard math Standard linear algebra over R: independent homogeneous constraints of rank m−1 determine the positive size vector up to scale; LP can test span(C) ∩ K_S = {0}.
    Used in progress-set existence/selection and frequency recovery (§5.1).
invented entities (2)
  • Progress set for constraint list C
    purpose: Guarantees that a one-bit cut test adds an independent linear constraint after class refinement.
    Defined as nonempty proper S with span(C) ∩ K_S = {0}; existence proved via L⊥ geometry (Lemma 5.4).
  • Self-correcting adaptive flooding / four-channel recovery layer
    purpose: Simulate known-bound Flood without prior U by speculative estimates, dual certificates, invalidation, silent control windows, and calendar resets.
    Introduced in §6 as a reusable primitive converting known-bound algorithms into stabilizing ones; analyzed via amortization lemmas.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Computing in Anonymous Dynamic Networks with One-Bit Communications." pith.science (2026). https://pith.science/paper/DQLCLMGI

@misc{pith2026260708358,
  author       = {Pith},
  title        = {Pith review of: Computing in Anonymous Dynamic Networks with One-Bit Communications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DQLCLMGI}},
  note         = {Machine review of arXiv:2607.08358}
}
abstract

We initiate the study of deterministic computation in anonymous dynamic networks where each agent broadcasts one bit per round and receives only the number of neighbors broadcasting each bit value. Despite this severe restriction, surprisingly rich global computation is possible. With a unique leader and a known upper bound $U$ on the network size $n$, we give a terminating algorithm for any computable function of the input multiset in $O(n^3\log^2 n+U)$ rounds, for inputs from a universe of size $N=2^{O(n\log n)}$. Without prior knowledge of $n$, we design a stabilizing algorithm for the same task running in $O(n^3\log^2 n)$ rounds. This essentially matches the state of the art for the congested model, where messages carry $O(\log n)$ bits and general computation takes $O(n^3)$ rounds. We also obtain comparable results for leaderless and multi-leader networks. We complement the upper bounds with an almost-matching lower bound of $$\Omega\left(\frac{n^2\log(N/n)}{\log n}\right)$$ rounds, which becomes $\Omega(n^3)$ for $N=2^{\Omega(n\log n)}$. The proof is information-theoretic, based on local histories, and holds even with a unique leader, known $n$ and $N$, and a communication graph restricted to a dynamically changing ring. Our algorithms extract global linear equations from local one-bit aggregate observations. A one-bit cut test yields conservation constraints on the sizes of indistinguishable agent classes; by refining these classes and collecting independent constraints, agents recover the required multiplicities. For unknown size, we introduce a self-correcting adaptive flooding primitive of independent interest. Thus, the computational power of congested anonymous dynamic networks is essentially preserved even when every message is compressed to one bit.

Figures

Figures reproduced from arXiv: 2607.08358 by the authors.

Figure 1
Figure 1. The four channels are interleaved in the fixed order: simulation (S), invalidation propagation (I), control (C), reset (R). The reset calendar advances only on the reset-channel subsequence. Thus the window labeled 2 consists of two reset-channel rounds, shown as reset rounds 3 and 4 [PITH_FULL_IMAGE:figures/full_fig_p030_1.png] view at source ↗

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

35 extracted references · 6 linked inside Pith

  1. [1]

    Energy-Efficient Naming in Beeping Networks, 2021

    Ny Aina Andriambolamalala and Vlady Ravelomanana. Energy-Efficient Naming in Beeping Networks, 2021. URL:https://arxiv.org/abs/2106.03753,arXiv:2106.03753

    arXiv 2021

  2. [2]

    Local and Global Properties in Networks of Processors (Extended Abstract)

    Dana Angluin. Local and Global Properties in Networks of Processors (Extended Abstract). In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC 1980), pages 82–93. ACM, 1980.doi:10.1145/800141.804655

    doi:10.1145/800141.804655 1980

  3. [3]

    Optimal Multi-broadcast with Beeps Using Group Testing

    Joffroy Beauquier, Janna Burman, Peter Davies, and Fabien Dufoulon. Optimal Multi-broadcast with Beeps Using Group Testing. InStructural Information and Communication Complexity (SIROCCO 2019), volume 11639 ofLecture Notes in Computer Science, pages 66–80. Springer, 2019.doi:10.1007/978-3-030-24922-9_5

    doi:10.1007/978-3-030-24922-9_5 2019

  4. [4]

    An Effective Characterization of Computability in Anony- mous Networks

    Paolo Boldi and Sebastiano Vigna. An Effective Characterization of Computability in Anony- mous Networks. InDistributed Computing, volume 2180 ofLecture Notes in Computer Science, pages 33–47. Springer, 2001.doi:10.1007/3-540-45414-4_3

    doi:10.1007/3-540-45414-4_3 2001

  5. [5]

    Fast Size Approximation of a Radio Network in Beeping Model.Theoretical Computer Science, 810:15–25, 2020.doi:10.1016/j.tcs.2017.05.022

    Philipp Brandes, Marcin Kardas, Marek Klonowski, Dominik Pajak, and Roger Wattenhofer. Fast Size Approximation of a Radio Network in Beeping Model.Theoretical Computer Science, 810:15–25, 2020.doi:10.1016/j.tcs.2017.05.022

    doi:10.1016/j.tcs.2017.05.022 2020

  6. [6]

    Counting in One-Hop Beeping Networks.Theoretical Computer Science, 780:20–28, 2019

    Arnaud Casteigts, Yves M´ etivier, John Michael Robson, and Akka Zemmari. Counting in One-Hop Beeping Networks.Theoretical Computer Science, 780:20–28, 2019. doi:10.1016/j. tcs.2019.02.009

    doi:10.1016/j 2019

  7. [7]

    Distributed Computations in Fully-Defective Networks.Distributed Computing, 36(4):501–528, 2023

    Keren Censor-Hillel, Shir Cohen, Ran Gelles, and Gal Sela. Distributed Computations in Fully-Defective Networks.Distributed Computing, 36(4):501–528, 2023. doi:10.1007/ s00446-023-00452-2. 43

    2023

  8. [8]

    Di Luna, and Haoran Zhou

    J´ er´ emie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou. Content-Oblivious Leader Election in 2-Edge-Connected Networks, 2025. URL: https://arxiv. org/abs/2507.08348,arXiv:2507.08348

    arXiv 2025

Show all 35 references
  1. [9]

    Di Luna, and Haoran Zhou

    J´ er´ emie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou. Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings, 2025. URL: https://arxiv.org/abs/2509.19187,arXiv:2509.19187

    2025

  2. [10]

    Di Luna, and Haoran Zhou

    J´ er´ emie Chalopin, Yi-Jun Chang, Giuseppe A. Di Luna, and Haoran Zhou. Efficient Counting and Simulation in Content-Oblivious Rings. To appear inProceedings of the 45th ACM Symposium on Principles of Distributed Computing (PODC 2026). ACM, 2026. URL: https: //arxiv.org/abs/...

    2026

  3. [11]

    Local Terminations and Distributed Computability in Anonymous Networks

    J´ er´ emie Chalopin, Emmanuel Godard, and Yves M´ etivier. Local Terminations and Distributed Computability in Anonymous Networks. InDistributed Computing, volume 5218 ofLecture Notes in Computer Science, pages 47–62. Springer, 2008. doi:10.1007/978-3-540-87779-0_4

    2008 doi

  4. [12]

    Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks.Fundamenta Informaticae, 120(1):1– 27, 2012.doi:10.3233/FI-2012-747

    J´ er´ emie Chalopin, Yves M´ etivier, and Thomas Morsellino. Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks.Fundamenta Informaticae, 120(1):1– 27, 2012.doi:10.3233/FI-2012-747

    2012 doi

  5. [13]

    Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election, 2025

    Yi-Jun Chang, Lyuting Chen, and Haoran Zhou. Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election, 2025. URL: https://arxiv.org/abs/ 2511.23297,arXiv:2511.23297

    2025

  6. [14]

    Chlebus, Gianluca De Marco, and Muhammed Talo

    Bogdan S. Chlebus, Gianluca De Marco, and Muhammed Talo. Naming a Channel with Beeps. Fundamenta Informaticae, 153(3):199–219, 2017.doi:10.3233/FI-2017-1537

    2017 doi

  7. [15]

    Deploying Wireless Networks with Beeps

    Alejandro Cornejo and Fabian Kuhn. Deploying Wireless Networks with Beeps. InDistributed Computing, volume 6343 ofLecture Notes in Computer Science, pages 148–162. Springer, 2010. URL:https://arxiv.org/abs/1005.2567

    2010 arXiv

  8. [16]

    Communicating with Beeps

    Artur Czumaj and Peter Davies. Communicating with Beeps. In19th International Conference on Principles of Distributed Systems (OPODIS 2015), volume 46 ofLIPIcs, pages 30:1–30:16. Schloss Dagstuhl – Leibniz-Zentrum f¨ ur Informatik, 2016.doi:10.4230/LIPIcs.OPODIS.2015. 30

    2015 doi

  9. [17]

    Communicating with Beeps.Journal of Parallel and Distributed Computing, 130:98–109, 2019.doi:10.1016/j.jpdc.2019.03.020

    Artur Czumaj and Peter Davies. Communicating with Beeps.Journal of Parallel and Distributed Computing, 130:98–109, 2019.doi:10.1016/j.jpdc.2019.03.020

    2019 doi

  10. [18]

    Optimal Message-Passing with Noisy Beeps.Distributed Computing, 38(3):247–260, 2025.doi:10.1007/s00446-025-00488-6

    Peter Davies-Peck. Optimal Message-Passing with Noisy Beeps.Distributed Computing, 38(3):247–260, 2025.doi:10.1007/s00446-025-00488-6

    2025 doi

  11. [19]

    Di Luna, Roberto Baldoni, Silvia Bonomi, and Ioannis Chatzigiannakis

    Giuseppe A. Di Luna, Roberto Baldoni, Silvia Bonomi, and Ioannis Chatzigiannakis. Counting in Anonymous Dynamic Networks under Worst-Case Adversary. In2014 IEEE 34th International Conference on Distributed Computing Systems (ICDCS 2014), pages 338–347. IEEE, 2014. doi:10.1109/...

    2014 doi

  12. [20]

    Di Luna and Giovanni Viglietta

    Giuseppe A. Di Luna and Giovanni Viglietta. Computing in Anonymous Dynamic Networks Is Linear. In2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS 2022), pages 1122–1133. IEEE, 2022.doi:10.1109/FOCS54457.2022.00108. 44

    2022 doi

  13. [21]

    Di Luna and Giovanni Viglietta

    Giuseppe A. Di Luna and Giovanni Viglietta. Optimal Computation in Leaderless and Multi- Leader Disconnected Anonymous Dynamic Networks. In37th International Symposium on Distributed Computing (DISC 2023), volume 281 ofLIPIcs, pages 18:1–18:20. Schloss Dagstuhl – Leibniz-Zentr...

    2023 doi

  14. [22]

    Di Luna and Giovanni Viglietta

    Giuseppe A. Di Luna and Giovanni Viglietta. Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks. In28th International Conference on Principles of Distributed Systems (OPODIS 2024), volume 324 ofLIPIcs, pages 10:1–10:17. Schloss Dagstuhl – Leib...

    2024 doi

  15. [23]

    Di Luna and Giovanni Viglietta

    Giuseppe A. Di Luna and Giovanni Viglietta. Efficient Computation in Congested Anonymous Dynamic Networks.Distributed Computing, 38(2):95–112, 2025. URL: https://arxiv.org/ abs/2301.07849

    2025 arXiv

  16. [24]

    Assigning Labels in Unknown Anonymous Networks (Extended Abstract)

    Pierre Fraigniaud, Andrzej Pelc, David Peleg, and St´ ephane P´ erennes. Assigning Labels in Unknown Anonymous Networks (Extended Abstract). InProceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC 2000), pages 101–111. ACM, 2000. doi:10.1145...

    doi

  17. [25]

    Content-Oblivious Leader Election on Rings

    Fabian Frei, Ran Gelles, Ahmed Ghazy, and Alexandre Nolin. Content-Oblivious Leader Election on Rings. In38th International Symposium on Distributed Computing (DISC 2024), volume 319 ofLIPIcs, pages 26:1–26:20. Schloss Dagstuhl – Leibniz-Zentrum f¨ ur Informatik, 2024.doi:10.4...

    2024 doi

  18. [26]

    Kowalski, Shay Kutten, and Miguel A

    Pawe l Garncarek, Dariusz R. Kowalski, Shay Kutten, and Miguel A. Mosteiro. Beeping Deterministic CONGEST Algorithms in Graphs. In33rd Annual European Symposium on Algorithms (ESA 2025), volume 351 ofLIPIcs, pages 20:1–20:17. Schloss Dagstuhl – Leibniz- Zentrum f¨ ur Informati...

    2025 doi

  19. [27]

    Kowalski and Miguel A

    Dariusz R. Kowalski and Miguel A. Mosteiro. Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. In45th In- ternational Colloquium on Automata, Languages, and Programming (ICALP 2018), volume 107 ofLIPIcs, pages 156:1...

    2018 doi

  20. [28]

    Kowalski and Miguel A

    Dariusz R. Kowalski and Miguel A. Mosteiro. Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader.Journal of Computer and System Sciences, 123:37–63, 2022.doi:10.1016/j.jcss.2021.07.002

    2022 doi

  21. [29]

    Lynch.Distributed Algorithms

    Nancy A. Lynch.Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco, CA, 1996

    1996

  22. [30]

    On Distributed Computing with Beeps, 2015

    Yves M´ etivier, John Michael Robson, and Akka Zemmari. On Distributed Computing with Beeps, 2015. URL:https://arxiv.org/abs/1507.02721,arXiv:1507.02721

    2015 arXiv

  23. [31]

    Spirakis

    Othon Michail, Ioannis Chatzigiannakis, and Paul G. Spirakis. Naming and Counting in Anonymous Unknown Dynamic Networks. InStabilization, Safety, and Security of Distributed Systems, volume 8255 ofLecture Notes in Computer Science, pages 281–295. Springer, 2013. doi:10.1007/97...

    2013 doi

  24. [32]

    Linear Time Average Consensus and Distributed Optimization on Fixed Graphs.SIAM Journal on Control and Optimization, 55(6):3990–4014, 2017

    Alex Olshevsky. Linear Time Average Consensus and Distributed Optimization on Fixed Graphs.SIAM Journal on Control and Optimization, 55(6):3990–4014, 2017

    2017

  25. [33]

    History Trees and Their Applications

    Giovanni Viglietta. History Trees and Their Applications. In31st International Colloquium on Structural Information and Communication Complexity (SIROCCO 2024), volume 14662 of LNCS, pages 3–23, 2024. URL:https://arxiv.org/abs/2404.02673,arXiv:2404.02673

    2024 arXiv

  26. [34]

    Computing on an Anonymous Network

    Masafumi Yamashita and Tsunehiko Kameda. Computing on an Anonymous Network. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (PODC 1988), pages 117–130. ACM, 1988

    1988

  27. [35]

    Computing on Anonymous Networks

    Masafumi Yamashita and Tsunehiko Kameda. Computing on Anonymous Networks. I. Charac- terizing the Solvable Cases.IEEE Transactions on Parallel and Distributed Systems, 7(1):69–89, 1996.doi:10.1109/71.481599. 46

    1996 doi

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.