Sciweavers

50 search results - page 4 / 10

» focs 2000

17

FOCS
2000
IEEE

76views Theoretical Computer Science» more FOCS 2000»

The Cover Time, the Blanket Time, and the Matthews Bound

14 years 2 months ago

The Cover Time, the Blanket Time, and the Matthews Bound

Download research.microsoft.com

Jeff Kahn, Jeong Han Kim, László Lov...

claim paper

Read More »

15

FOCS
2000
IEEE

68views Theoretical Computer Science» more FOCS 2000»

Testing that distributions are close

14 years 2 months ago

Testing that distributions are close

Download www.maths.lse.ac.uk

Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warr...

claim paper

Read More »

12

FOCS
2000
IEEE

62views Theoretical Computer Science» more FOCS 2000»

Random graph models for the web graph

14 years 2 months ago

Random graph models for the web graph

Download www.mscs.dal.ca

Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala...

claim paper

Read More »

16

FOCS
2000
IEEE

69views Theoretical Computer Science» more FOCS 2000»

Universality and Tolerance

14 years 2 months ago

Universality and Tolerance

Download www.math.tau.ac.il

Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakaw...

claim paper

Read More »

43

FOCS
2000
IEEE

143views Theoretical Computer Science» more FOCS 2000»

A polylogarithmic approximation of the minimum bisection

14 years 2 months ago

A polylogarithmic approximation of the minimum bisection

Download www.wisdom.weizmann.ac.il

A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...

Uriel Feige, Robert Krauthgamer

claim paper

Read More »

« Prev « First page 4 / 10 Last » Next »