Sciweavers

19 search results - page 4 / 4
» ipl 1998
Sort
View
IPL
1998
89views more  IPL 1998»
13 years 5 months ago
A Limitation of Vector Timestamps for Reconstructing Distributed Computations
Vector timestamps provide a way of recording the causal relationships between events in a distributed computation. We draw attention to a limitation of such timestamps when used t...
Colin J. Fidge
IPL
1998
80views more  IPL 1998»
13 years 5 months ago
The Economics of Large-Memory Computations
We propose, and justify, an economic theory to guide memory system design, operation, and analysis. Our theory treats memory random-access latency, and its cost per installed mega...
Clark D. Thomborson
IPL
1998
119views more  IPL 1998»
13 years 5 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
IPL
1998
95views more  IPL 1998»
13 years 5 months ago
Coloring Random Graphs
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
Michael Krivelevich, Benny Sudakov