1672 search results - page 214 / 335 » Tightness problems in the plane |
WDAG
1999
Springer
15 years 3 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
ICALP
1992
Springer
15 years 3 months ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
ICDCN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
ATVA
2004
Springer
15 years 2 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
ECOOP
2006
Springer
15 years 2 months ago
2006
Springer
AspectJ-like languages are currently ineffective at modularizing heterogeneous concerns that are tightly coupled to the source code of the base program, such as logging, invariant...