Sciweavers

FOCS
2000
IEEE
13 years 11 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
FOCS
2000
IEEE
13 years 11 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
FOCS
2000
IEEE
13 years 11 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
FOCS
2000
IEEE
13 years 11 months ago
Cost-Distance: Two Metric Network Design
Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
FOCS
2000
IEEE
13 years 11 months ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala
FOCS
2000
IEEE
13 years 11 months ago
Topological Persistence and Simplification
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
Herbert Edelsbrunner, David Letscher, Afra Zomorod...
FOCS
2000
IEEE
13 years 12 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
FOCS
2000
IEEE
13 years 12 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
FOCS
2000
IEEE
13 years 12 months ago
On the Hardness of Graph Isomorphism
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
Jacobo Torán
FOCS
2000
IEEE
13 years 12 months ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson