155
Voted
FOCS
15 years 4 months ago
2004 IEEE 
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
121
Voted
FOCS
15 years 4 months ago
2004 IEEE 
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
103
Voted
FOCS
15 years 4 months ago
2004 IEEE 
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
144
Voted
FOCS
15 years 4 months ago
2004 IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
101
click to vote
FOCS
15 years 4 months ago
2004 IEEE 
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
|
Theoretical Computer Science