144
Voted
STOC
15 years 4 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...
104
Voted
STOC
15 years 4 months ago
1991 ACM 101
Voted
STOC
15 years 4 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...
STOC
15 years 4 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...
95
Voted
STOC
15 years 4 months ago
1991 ACM |
Algorithms