Sciweavers

FOSAD
2000
Springer
15 years 7 months ago
Notes on Nominal Calculi for Security and Mobility
Abstract. There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verify...
Andrew D. Gordon
149
Voted
FOCS
2000
IEEE
15 years 7 months ago
Succinct quantum proofs for properties of finite groups
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
John Watrous
129
Voted
FOCS
2000
IEEE
15 years 7 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
148
Voted
FOCS
2000
IEEE
15 years 7 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
103
Voted
FOCS
2000
IEEE
15 years 7 months ago
Cost-Distance: Two Metric Network Design
Adam Meyerson, Kamesh Munagala, Serge A. Plotkin