Sciweavers

224 search results - page 13 / 45
» A parallel repetition theorem
Sort
View
SPAA
2003
ACM
14 years 27 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
ICDCS
2010
IEEE
13 years 11 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
COMBINATORICA
2008
88views more  COMBINATORICA 2008»
13 years 7 months ago
Geometric graphs with no two parallel edges
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
Rom Pinchasi
CSL
2006
Springer
13 years 11 months ago
Jump from Parallel to Sequential Proofs: Multiplicatives
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel's multiplicative L-nets. In J-proof nets, we can character...
Paolo Di Giamberardino, Claudia Faggian
FS
2010
162views more  FS 2010»
13 years 6 months ago
Can the implied volatility surface move by parallel shifts?
This note explores the analogy between the dynamics of the interest rate term structure and the implied volatility surface of a stock. In particular, we prove an impossibility theo...
L. C. G. Rogers, Michael Tehranchi