Sciweavers

    SODA
    1998
    ACM
    71views Algorithms» more  SODA 1998»

    On the Distributed Complexity of Computing Maximal Matchings

    14 years 25 days ago
    On the Distributed Complexity of Computing Maximal Matchings
    Download  www.brics.dk
    Michal Hanckowiak, Michal Karonski, Alessandro Pan
    claim paper
    Added 01 Nov 2010
    Updated 01 Nov 2010
    Type Conference
    Year 1998
    Where SODA
    Authors Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
    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.