Join Our Newsletter

FOCS

2000

IEEE

12 years 3 months ago
2000

IEEE

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...

FOCS

2000

IEEE

12 years 3 months ago
2000

IEEE

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 ...

FOCS

2000

IEEE

12 years 3 months ago
2000

IEEE

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 ...

FOCS

2000

IEEE

12 years 3 months ago
2000

IEEE

FOCS

2000

IEEE

12 years 3 months ago
2000

IEEE

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'...

FOCS

2000

IEEE

12 years 3 months ago
2000

IEEE

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 ...

FOCS

2000

IEEE

12 years 4 months ago
2000

IEEE

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...

FOCS

2000

IEEE

12 years 4 months ago
2000

IEEE

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...

FOCS

2000

IEEE

12 years 4 months ago
2000

IEEE

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...

FOCS

2000

IEEE

12 years 4 months ago
2000

IEEE

Extractors (deﬁned 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...