2924 search results - page 202 / 585 » Lower Bounds in Distributed Computing |
226
click to vote
CONCUR
2011
Springer
14 years 3 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
115
click to vote
ICCAD
2003
IEEE
16 years 5 days ago
2003
IEEE
Under modern VLSI technology, process variations greatly affect circuit performance, especially clock skew which is very timing sensitive. Unwanted skew due to process variation f...
131
click to vote
WDAG
2005
Springer
15 years 8 months ago
2005
Springer
In a distributed system with N processes, time stamps of size N (such as vector clocks) are necessary to accurately track potential causality between events. Plausible clocks are a...
139
click to vote
IPL
2011
14 years 6 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
161
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...