115
Voted
FOCS
2000
IEEE
15 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...
119
Voted
FOCS
2000
IEEE
15 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...
100
Voted
FOCS
2000
IEEE
15 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...
114
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
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...
74
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
63
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
77
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
60
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
58
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
66
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE