Sciweavers

    16 search results - page 4 / 4
    » Burstiness Bounds for Some Burst Reducing Servers
    Sort
    View
    PODC
    2005
    ACM
    95views Distributed And Parallel Com...» more  PODC 2005»
    Routing complexity of faulty networks
    14 years 4 months ago
    Routing complexity of faulty networks
    Download  research.microsoft.com
    One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
    Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
    claim paper
    Read More »
    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.