2252 search results - page 321 / 451 » Lower Bounds for Dynamic Algorithms |
143
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—A fundamental challenge of managing mutable data replication in a Peer-to-Peer (P2P) system is how to efficiently maintain consistency under various sharing patterns with heter...
146
Voted
JPDC
2010
15 years 1 months ago
2010
Non-uniform memory architectures with cache coherence (ccNUMA) are becoming increasingly common, not just for large-scale high performance platforms but also in the context of mul...
117
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
150
click to vote
ISCA
2003
IEEE
15 years 8 months ago
2003
IEEE
Meeting deadlines is a key requirement in safe realtime systems. Worst-case execution times (WCET) of tasks are needed for safe planning. Contemporary worst-case timing analysis t...
140
click to vote
FUN
2010
Springer
15 years 8 months ago
2010
Springer
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this a...