Sciweavers

    SIAMCOMP
    2002
    113views more  SIAMCOMP 2002»
    A Layered Analysis of Consensus
    13 years 11 months ago
    A Layered Analysis of Consensus
    Download  courses.csail.mit.edu
    This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
    Yoram Moses, Sergio Rajsbaum
    claim paper
    Read More »
    SIAMCOMP
    2002
    98views more  SIAMCOMP 2002»
    Self-Stabilizing Symmetry Breaking in Constant Space
    13 years 11 months ago
    Self-Stabilizing Symmetry Breaking in Constant Space
    Download  www.cs.ucla.edu
    abstract Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring...
    Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti...
    claim paper
    Read More »
    SIAMCOMP
    2002
    95views more  SIAMCOMP 2002»
    A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
    13 years 11 months ago
    A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
    Download  www.dsi.uniroma1.it
    Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...
    Francesco M. Malvestuto, Mauro Mezzini
    claim paper
    Read More »
    SIAMCOMP
    2002
    142views more  SIAMCOMP 2002»
    On Binary Searching with Nonuniform Costs
    13 years 11 months ago
    On Binary Searching with Nonuniform Costs
    Download  www.cs.ust.hk
    Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
    Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
    claim paper
    Read More »
    SIAMCOMP
    2002
    95views more  SIAMCOMP 2002»
    Lower Bounds for Lucas Chains
    13 years 11 months ago
    Lower Bounds for Lucas Chains
    Download  cr.yp.to
    Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
    Martin Kutz
    claim paper
    Read More »
    SIAMCOMP
    2002
    90views more  SIAMCOMP 2002»
    A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
    13 years 11 months ago
    A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
    Download  people.csail.mit.edu
    This paper presents a formal design for a novel group communication service targeted for WANs. The service provides Virtual Synchrony semantics. Such semantics facilitate the desi...
    Idit Keidar, Roger Khazan
    claim paper
    Read More »
    SIAMCOMP
    2002
    138views more  SIAMCOMP 2002»
    Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
    13 years 11 months ago
    Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
    Download  www.math.uni-frankfurt.de
    We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
    Hsien-Kuei Hwang, Ralph Neininger
    claim paper
    Read More »
    SIAMCOMP
    2002
    113views more  SIAMCOMP 2002»
    Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
    13 years 11 months ago
    Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
    Download  www.gudmundsson.biz
    Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
    Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
    claim paper
    Read More »
    SIAMCOMP
    2002
    139views more  SIAMCOMP 2002»
    Approximating the Domatic Number
    13 years 11 months ago
    Approximating the Domatic Number
    Download  www.cse.buffalo.edu
    A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
    Uriel Feige, Magnús M. Halldórsson, ...
    claim paper
    Read More »
    SIAMCOMP
    2002
    73views more  SIAMCOMP 2002»
    Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
    13 years 11 months ago
    Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
    Download  www.cis.upenn.edu
    Guy Even, Sudipto Guha, Baruch Schieber
    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.