Sciweavers

    12 search results - page 3 / 3
    » An O(n log n) Algorithm for the Maximum Agreement Subtree Pr...
    Sort
    View
    SPAA
    2005
    ACM
    93views Distributed And Parallel Com...» more  SPAA 2005»
    Fast construction of overlay networks
    13 years 11 months ago
    Fast construction of overlay networks
    Download  www.cs.yale.edu
    An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
    Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
    claim paper
    Read More »
    ESA
    2009
    Springer
    107views Algorithms» more  ESA 2009»
    Disproof of the Neighborhood Conjecture with Implications to SAT
    13 years 12 months ago
    Disproof of the Neighborhood Conjecture with Implications to SAT
    Download  www.tcs.fudan.edu.cn
    We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
    Heidi Gebauer
    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.