246
Voted
STOC
15 years 11 months ago
1991 ACM 
d Abstract) James Aspnes Maurice Herlihyy Nir Shavitz Digital Equipment Corporation Cambridge Research Lab CRL 90/11 September 18, 1991 Many fundamental multi-processor coordinati...
189
click to vote
STOC
15 years 11 months ago
1991 ACM
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...
186
click to vote
STOC
15 years 11 months ago
1991 ACM
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...
185
click to vote
STOC
15 years 11 months ago
1991 ACM
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...
178
click to vote
STOC
15 years 11 months ago
1991 ACM
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...
|
Algorithms