Sciweavers

219 search results - page 27 / 44
» Symmetries of Symmetry Breaking Constraints
Sort
View
PODC
2011
ACM
14 years 9 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ICDCS
2009
IEEE
16 years 3 months ago
Fault-Tolerant Consensus in Unknown and Anonymous Networks
This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from cr...
Carole Delporte-Gallet, Hugues Fauconnier, Andreas...
FOCS
2006
IEEE
16 years 3 days ago
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
Christian Borgs, Jennifer T. Chayes, Elchanan Moss...
WDAG
2001
Springer
100views Algorithms» more  WDAG 2001»
15 years 10 months ago
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
Faith E. Fich, Colette Johnen
JSAT
2008
89views more  JSAT 2008»
15 years 6 months ago
Towards a Classification of Hamiltonian Cycles in the 6-Cube
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
Yury Chebiryak, Daniel Kroening