Sciweavers

    99
    Voted
    FODO
    1989
    Springer
    268views Algorithms» more  FODO 1989»
    The Path Length of Binary Trees
    15 years 4 months ago
    The Path Length of Binary Trees
    Download  www.cs.uwaterloo.ca
    We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the d...
    Rolf Klein, Derick Wood
    claim paper
    Read More »
    OA
    1989
    237views Algorithms» more  OA 1989»
    Which Triangulations Approximate the Complete Graph?
    15 years 4 months ago
    Which Triangulations Approximate the Complete Graph?
    Download  ranger.uta.edu
    nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
    Gautam Das, Deborah Joseph
    claim paper
    Read More »
    FODO
    1989
    Springer
    164views Algorithms» more  FODO 1989»
    ITOSS: An Integrated Toolkit For Operating System Security
    15 years 4 months ago
    ITOSS: An Integrated Toolkit For Operating System Security
    Download  people.ischool.berkeley.edu
    d Abstract) Michael Rabin Aiken Computation Laboratory Harvard University Cambridge, MA 02138 J. D. Tygar School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213...
    Michael O. Rabin, J. D. Tygar
    claim paper
    Read More »
    STOC
    1989
    ACM
    117views Algorithms» more  STOC 1989»
    On the Theory of Average Case Complexity
    15 years 4 months ago
    On the Theory of Average Case Complexity
    Download  www.cs.technion.ac.il
    This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
    Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
    claim paper
    Read More »
    64
    Voted
    COCO
    1989
    Springer
    113views Algorithms» more  COCO 1989»
    Boolean Functions, Invariance Groups and Parallel Complexity
    15 years 4 months ago
    Boolean Functions, Invariance Groups and Parallel Complexity
    Download  clavius.bc.edu
    Peter Clote
    claim paper
    Read More »
    All Subjects
    Algorithms
    Applied Computing
    Artificial Intelligence
    Automated Reasoning
    Communications
    Computational Linguistics
    Computer Architecture
    Computer Graphics
    Computer Networks
    Control Systems
    Cryptology
    Database
    Discrete Geometry
    Distributed And Parallel Computing
    Education
    Formal Methods
    Hardware
    Information Technology
    Internet Technology
    Logical Reasoning
    Machine Learning
    Mathematics
    Modeling And Simulation
    Natural Language Processing
    Operating System
    Programming Languages
    Robotics
    Security Privacy
    Software Engineering
    Theoretical Computer Science
    Algorithms
    Top of PageReset Settings
    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-2025, USA.