scientific article; zbMATH DE number 177819

MaRDI QIDQ4038697zbMATH OpenFDO

Authors Evangelos Kranakis, D. Krizanc, Jacob van den Berg

Publication date 18 May 1993

zbMATH Keywords

distributed computingdistributed networks of processorsbit- complexitydistance regular unlabeled networksunlabeled networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Computing Boolean functions on anonymous networks
• scientific article; zbMATH DE number 17531
• Distributed Computing on Anonymous Hypercube Networks
• Better computing on the anonymous ring
• Computing functions on asynchronous anonymous networks

Cited in

(7)

• Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots
• Computing Boolean functions on anonymous networks
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Distributed Computing on Anonymous Hypercube Networks
• Distributed computing on transitive networks: the torus
• Computing functions on asynchronous anonymous networks
• Symmetries and sense of direction in labeled graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038697)