Sciweavers

549 search results - page 67 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
CORR
2011
Springer
149views Education» more  CORR 2011»
14 years 4 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
ACNS
2010
Springer
161views Cryptology» more  ACNS 2010»
15 years 1 months ago
Multi-trail Statistical Saturation Attacks
Abstract. Statistical Saturation Attacks have been introduced and applied to the block cipher PRESENT at CT-RSA 2009. In this paper, we consider their natural extensions. First, we...
Baudoin Collard, François-Xavier Standaert
MIDDLEWARE
2004
Springer
15 years 3 months ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
WISEC
2009
ACM
15 years 4 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
PODC
2009
ACM
15 years 10 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer