Pages that link to "Item:Q4176960"

The following pages link to An improved algorithm for decentralized extrema-finding in circular configurations of processes (Q4176960):

Displaying 30 items.

• A knowledge-based analysis of global function computation (Q660991) (← links)
• A simple, efficient algorithm for maximum finding on rings (Q671266) (← links)
• Anonymous wireless rings (Q673090) (← links)
• On the complexity of computation in the presence of link failures: The case of a ring (Q808251) (← links)
• New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701) (← links)
• Sound verification procedures for temporal properties of infinite-state systems (Q832273) (← links)
• Cost distribution of the Chang-Roberts leader election algorithm and related problems (Q861286) (← links)
• Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms (Q911262) (← links)
• The communication complexity for decentralized evaluation of functions (Q915467) (← links)
• Bit-optimal election in synchronous rings (Q916342) (← links)
• Symmetry breaking in distributed networks (Q918187) (← links)
• Electing a leader in a ring with link failures (Q1075046) (← links)
• Distributed algorithm for extrema-finding in circular configuration of processors (Q1083214) (← links)
• A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315) (← links)
• Communication and time complexity of a distributed election protocol (Q1176439) (← links)
• Pardinus: a temporal relational model finder (Q2102939) (← links)
• Drags: a compositional algebraic framework for graph rewriting (Q2422028) (← links)
• Some lower bound results for decentralized extrema-finding in rings of processors (Q2640343) (← links)
• Leader election in well-connected graphs (Q2696279) (← links)
• On the Expressive Power of Polyadic Synchronisation in π-calculus (Q2842599) (← links)
• An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP (Q3303889) (← links)
• Bounded Quantifier Instantiation for Checking Inductive Invariants (Q3303891) (← links)
• Distributed election in a circle without a global sense of orientation (Q3339287) (← links)
• On the message complexity of distributed problems (Q3345763) (← links)
• Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS (Q3510806) (← links)
• An improved election algorithm in chordal ring networks (Q3991122) (← links)
• RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES (Q4902882) (← links)
• Design and analysis of dynamic leader election protocols in broadcast networks (Q5137017) (← links)
• Snap-stabilizing tasks in anonymous networks (Q5920223) (← links)
• Sense of direction in processor networks (Q6573924) (← links)