Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

STOC
2006
ACM

favoriteEmaildiscussreport

117views Algorithms» more STOC 2006»

Pseudorandom walks on regular digraphs and the RL vs. L problem

14 years 6 months ago

Pseudorandom walks on regular digraphs and the RL vs. L problem

Download people.seas.harvard.edu

We revisit the general RL vs. L question, obtaining the following results.

Omer Reingold, Luca Trevisan, Salil P. Vadhan

Real-time Traffic

Algorithms | General Rl | STOC 2006 |

claim paper

Post Info
More Details (n/a)

Added	14 Jun 2010
Updated	14 Jun 2010
Type	Conference
Year	2006
Where	STOC
Authors	Omer Reingold, Luca Trevisan, Salil P. Vadhan

Comments (0)