Sciweavers

Share
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
8 years 8 months ago
A Layered Analysis of Consensus
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
SIAMCOMP
2002
98views more  SIAMCOMP 2002»
8 years 8 months ago
Self-Stabilizing Symmetry Breaking in Constant Space
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...
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
8 years 8 months ago
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
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
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
8 years 8 months ago
On Binary Searching with Nonuniform Costs
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...
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
8 years 8 months ago
Lower Bounds for Lucas Chains
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
SIAMCOMP
2002
90views more  SIAMCOMP 2002»
8 years 8 months ago
A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
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
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
8 years 8 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
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
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
8 years 8 months ago
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
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...
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
8 years 8 months ago
Approximating the Domatic Number
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, ...
books