Sciweavers

    CPC
    2004
    82views more  CPC 2004»
    Boltzmann Samplers for the Random Generation of Combinatorial Structures
    13 years 4 months ago
    Boltzmann Samplers for the Random Generation of Combinatorial Structures
    Download  algo.inria.fr
    Philippe Duchon, Philippe Flajolet, Guy Louchard, ...
    claim paper
    Read More »
    CPC
    2004
    66views more  CPC 2004»
    Two Results on Real Zeros of Chromatic Polynomials
    13 years 4 months ago
    Two Results on Real Zeros of Chromatic Polynomials
    Download  math.nie.edu.sg
    This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...
    Feng Ming Dong, Khee Meng Koh
    claim paper
    Read More »
    CPC
    2004
    59views more  CPC 2004»
    Max Cut for Random Graphs with a Planted Partition
    13 years 4 months ago
    Max Cut for Random Graphs with a Planted Partition
    Download  people.maths.ox.ac.uk
    Béla Bollobás, Alex D. Scott
    claim paper
    Read More »
    CPC
    2004
    49views more  CPC 2004»
    Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm
    13 years 4 months ago
    Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm
    Download  www.csie.nuk.edu.tw
    Benoit Daireaux, Brigitte Vallée
    claim paper
    Read More »
    CPC
    2004
    65views more  CPC 2004»
    On the b-Independence Number of Sparse Random Graphs
    13 years 4 months ago
    On the b-Independence Number of Sparse Random Graphs
    Download  www.math.cmu.edu
    Geoffrey Atkinson, Alan M. Frieze
    claim paper
    Read More »
    CPC
    2004
    87views more  CPC 2004»
    Quicksort with Unreliable Comparisons: A Probabilistic Analysis
    13 years 4 months ago
    Quicksort with Unreliable Comparisons: A Probabilistic Analysis
    Download  www.iecn.u-nancy.fr
    We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
    Laurent Alonso, Philippe Chassaing, Florent Gillet...
    claim paper
    Read More »
    CPC
    2004
    69views more  CPC 2004»
    New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
    13 years 4 months ago
    New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
    Download  www.tau.ac.il
    Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
    Noga Alon, Uri Stav
    claim paper
    Read More »
    CPC
    2004
    98views more  CPC 2004»
    And/Or Trees Revisited
    13 years 4 months ago
    And/Or Trees Revisited
    Download  www.geometrie.tuwien.ac.at
    We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
    Brigitte Chauvin, Philippe Flajolet, Danièl...
    claim paper
    Read More »
    CPC
    2004
    68views more  CPC 2004»
    Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
    13 years 4 months ago
    Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
    Download  www.dur.ac.uk
    Magnus Bordewich
    claim paper
    Read More »
    « first‹ previous12
    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.