Sciweavers

Share
SIAMCOMP
2000
88views more  SIAMCOMP 2000»
9 years 7 months ago
Gadgets, Approximation, and Linear Programming
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, Dav...
SIAMCOMP
2000
88views more  SIAMCOMP 2000»
9 years 7 months ago
On a Conjecture by Coffman, Flatto, and Wright on Stochastic Machine Minimization
We investigate a conjecture stated by Coffman, Flatto, and Wright within the context of a stochastic machine minimization problem with a hard deadline. We prove that the conjecture...
Nah-Oak Song, Demosthenis Teneketzis
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
9 years 7 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
9 years 7 months ago
Constructive, Deterministic Implementation of Shared Memory on Meshes
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
9 years 7 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
9 years 7 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
9 years 7 months ago
Computationally Sound Proofs
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Silvio Micali
SIAMCOMP
2000
90views more  SIAMCOMP 2000»
9 years 7 months ago
From Gene Trees to Species Trees
This paper studies various algorithmic issues in reconstructing a species tree from gene trees under the duplication and the mutation cost model. This is a fundamental problem in c...
Bin Ma, Ming Li, Louxin Zhang
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
9 years 7 months ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg
SIAMCOMP
2000
66views more  SIAMCOMP 2000»
9 years 7 months ago
Reducibility and Completeness in Private Computations
Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafai...
books