32 search results - page 3 / 7 » spaa 2003 |
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...