Skip to main content
Conference Proceedings

Brief announcement: Self-stabilizing silent disjunction in an anonymous network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7596 LNCS 46-48
DOI: 10.1007/978-3-642-33536-5_5
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a network of processes , where each process has a fixed input bit, Input(x), the disjunction problem is for each process to compute , the disjunction of all input bits in the network. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Datta, A. K., Devismes, S., & Larmore, L. L. (2012). Brief announcement: Self-stabilizing silent disjunction in an anonymous network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7596 LNCS, pp. 46–48). https://doi.org/10.1007/978-3-642-33536-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free