Sciweavers

65 search results - page 5 / 13
» Lower Bounds for Lucas Chains
Sort
View
JACM
2008
90views more  JACM 2008»
13 years 7 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
MASCOTS
2007
13 years 8 months ago
Stochastic Bounds Applied to the End to End QoS in Communication Systems
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
Hind Castel, Lynda Mokdad, Nihal Pekergin
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
13 years 11 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
CORR
2002
Springer
104views Education» more  CORR 2002»
13 years 7 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
CSFW
2009
IEEE
14 years 2 months ago
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...