Sciweavers

    STOC
    1991
    ACM
    93views Algorithms» more  STOC 1991»
    Rounds in Communication Complexity Revisited
    13 years 11 months ago
    Rounds in Communication Complexity Revisited
    Download  www.math.ias.edu
    The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
    Noam Nisan, Avi Wigderson
    claim paper
    Read More »
    STOC
    1991
    ACM
    85views Algorithms» more  STOC 1991»
    On Deterministic Approximation of DNF
    13 years 11 months ago
    On Deterministic Approximation of DNF
    Download  www.ti.inf.ethz.ch
    Michael Luby, Boban Velickovic
    claim paper
    Read More »
    STOC
    1991
    ACM
    95views Algorithms» more  STOC 1991»
    Fast Approximation Algorithms for Multicommodity Flow Problems
    13 years 11 months ago
    Fast Approximation Algorithms for Multicommodity Flow Problems
    Download  historical.ncstrl.org
    Frank Thomson Leighton, Fillia Makedon, Serge A. P...
    claim paper
    Read More »
    STOC
    1991
    ACM
    75views Algorithms» more  STOC 1991»
    Probabilistic Recurrence Relations
    13 years 11 months ago
    Probabilistic Recurrence Relations
    Download  www.cs.ust.hk
    Richard M. Karp
    claim paper
    Read More »
    STOC
    1991
    ACM
    127views Algorithms» more  STOC 1991»
    Lower Bounds for Randomized k-Server and Motion Planning Algorithms
    13 years 11 months ago
    Lower Bounds for Randomized k-Server and Motion Planning Algorithms
    Download  www.cs.technion.ac.il
    In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
    Howard J. Karloff, Yuval Rabani, Yiftach Ravid
    claim paper
    Read More »
    STOC
    1991
    ACM
    84views Algorithms» more  STOC 1991»
    Self-Testing/Correcting for Polynomials and for Approximate Functions
    13 years 11 months ago
    Self-Testing/Correcting for Polynomials and for Approximate Functions
    Download  www.math.ias.edu
    The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
    Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
    claim paper
    Read More »
    STOC
    1991
    ACM
    163views Algorithms» more  STOC 1991»
    Clique Partitions, Graph Compression, and Speeding-Up Algorithms
    13 years 11 months ago
    Clique Partitions, Graph Compression, and Speeding-Up Algorithms
    Download  www.combinatorics.net
    Tomás Feder, Rajeev Motwani
    claim paper
    Read More »
    STOC
    1991
    ACM
    105views Algorithms» more  STOC 1991»
    An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs
    13 years 11 months ago
    An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs
    Download  www.cs.duke.edu
    act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...
    Hristo Djidjev, John H. Reif
    claim paper
    Read More »
    STOC
    1991
    ACM
    87views Algorithms» more  STOC 1991»
    Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis
    13 years 11 months ago
    Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis
    Download  www.cdc.informatik.tu-darmstadt.de
    We describe a new deterministic algorithm for the problem of constructing k-th
    Johannes Buchmann, Victor Shoup
    claim paper
    Read More »
    STOC
    1991
    ACM
    109views Algorithms» more  STOC 1991»
    Checking Computations in Polylogarithmic Time
    13 years 11 months ago
    Checking Computations in Polylogarithmic Time
    Download  people.cs.uchicago.edu
    László Babai, Lance Fortnow, Leonid ...
    claim paper
    Read More »
    12next ›last »
    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.