scientific article; zbMATH DE number 6785015

DOI10.4230/LIPICS.OPODIS.2015.28zbMath1380.68027arXiv1509.02140MaRDI QIDQ5363819

Miguel A. Mosteiro, Alessia Milani

Publication date: 29 September 2017

Full work available at URL: https://arxiv.org/abs/1509.02140

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

countingtime-varying graphsanonymous dynamic networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (4)

Polynomial anonymous dynamic distributed computing without a unique leader ⋮ A faster exact-counting protocol for anonymous dynamic networks ⋮ Polynomial anonymous dynamic distributed computing without a unique leader ⋮ Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations

This page was built for publication: