Sciweavers

    STOC
    2006
    ACM
    117views Algorithms» more  STOC 2006»

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

    13 years 11 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
    claim paper
    Added 14 Jun 2010
    Updated 14 Jun 2010
    Type Conference
    Year 2006
    Where STOC
    Authors Omer Reingold, Luca Trevisan, Salil P. Vadhan
    Comments (0)
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.