Pages that link to "Item:Q918187"

The following pages link to Symmetry breaking in distributed networks (Q918187):

Displaying 28 items.

• Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
• Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
• Message terminating algorithms for anonymous rings of unknown size (Q673475) (← links)
• CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
• A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
• Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
• Cost distribution of the Chang-Roberts leader election algorithm and related problems (Q861286) (← links)
• Randomized function evaluation on a ring (Q916384) (← links)
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
• On the cost of uniform protocols whose memory consumption is adaptive to interval contention (Q1004317) (← links)
• Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
• Fast leader election in anonymous rings with bounded expected delay (Q1944153) (← links)
• Verification of multiplayer stochastic games via abstract dependency graphs (Q2119119) (← links)
• Synthesizing optimal bias in randomized self-stabilization (Q2121058) (← links)
• Fast protocols for leader election and spanning tree construction in a distributed network (Q2285076) (← links)
• Analysis of fully distributed splitting and naming probabilistic procedures and applications (Q2345463) (← links)
• Distributed communication complexity of spanning tree construction (Q2355664) (← links)
• Counting in one-hop beeping networks (Q2420611) (← links)
• Asymptotic analysis of a leader election algorithm (Q2503299) (← links)
• Value iteration for simple stochastic games: stopping criterion and learning algorithm (Q2672267) (← links)
• An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols (Q2810974) (← links)
• Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications (Q2868641) (← links)
• Model Checking Probabilistic Systems (Q3176386) (← links)
• On the Microscopic View of Time and Messages (Q4686647) (← links)
• (Q5090892) (← links)
• The Synergy of Finite State Machines (Q5091099) (← links)
• Naming symmetric processes using shared variables (Q5136976) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)