Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations

DOI10.1145/3385075zbMath1473.68121OpenAlexW3021721201MaRDI QIDQ5133967

Dariusz R. Kowalski, Miguel A. Mosteiro

Publication date: 11 November 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9160/

zbMATH Keywords

Boolean functionsdeterministic algorithmscountingdistributed algorithmsanonymous dynamic networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Polynomial anonymous dynamic distributed computing without a unique leader

This page was built for publication: Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations