256 search results - page 5 / 52 » A New Synchronous Lower Bound for Set Agreement |
EOR
2006
13 years 7 months ago
2006
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
COMPGEOM
2010
ACM
14 years 25 days ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
PODC
1998
ACM
13 years 11 months ago
1998
ACM
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
ASIACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
d abstract) Bartosz Przydatek1 and Reto Strobl2 1 Department of Computer Science, ETH Z¨urich, Switzerland 2 IBM Research, Zurich Research Laboratory, Switzerland In this paper, w...
DC
2007
2007
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
13 years 7 months ago
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...