Computing Boolean functions on anonymous networks

DOI10.1006/inco.1994.1086zbMath0823.68008OpenAlexW2115747965MaRDI QIDQ1341773

Evangelos Kranakis, Danny Krizanc

Publication date: 11 January 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1459

zbMATH Keywords

Boolean functionssymmetric functionsanonymous networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (17)

Graph endpoint coloring and distributed processing ⋮ Distributed tree comparison with nodes of limited memory ⋮ Almost universal anonymous rendezvous in the plane ⋮ Comparing Universal Covers in Polynomial Time ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Computing on anonymous networks with sense of direction ⋮ Activating anonymous ad hoc radio networks ⋮ Assigning labels in an unknown anonymous network with a leader ⋮ How much memory is needed for leader election ⋮ Knowledge, level of symmetry, and time of leader election ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Comparing universal covers in polynomial time ⋮ Topology recognition and leader election in colored networks ⋮ Perfect broadcasting in unlabeled networks ⋮ Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations ⋮ Broadcasting in unlabeled hypercubes with a linear number of messages. ⋮ Topology recognition with advice

This page was built for publication: Computing Boolean functions on anonymous networks