8 search results - page 2 / 2 » A Universal Proof Technique for Deadlock-Free Routing in Int... |
WSC
1997
13 years 6 months ago
1997
Components of modern parallel systems are becoming quite complex with many features and variations. An integrated modeling of these components (interconnection network, messaging ...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...