Sciweavers

STOC
1991
ACM
93views Algorithms» more  STOC 1991»
14 years 2 months ago
Rounds in Communication Complexity Revisited
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...
Noam Nisan, Avi Wigderson
STOC
1991
ACM
85views Algorithms» more  STOC 1991»
14 years 2 months ago
On Deterministic Approximation of DNF
Michael Luby, Boban Velickovic
STOC
1991
ACM
95views Algorithms» more  STOC 1991»
14 years 2 months ago
Fast Approximation Algorithms for Multicommodity Flow Problems
Frank Thomson Leighton, Fillia Makedon, Serge A. P...
STOC
1991
ACM
75views Algorithms» more  STOC 1991»
14 years 2 months ago
Probabilistic Recurrence Relations
Richard M. Karp
STOC
1991
ACM
127views Algorithms» more  STOC 1991»
14 years 2 months ago
Lower Bounds for Randomized k-Server and Motion Planning Algorithms
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...
Howard J. Karloff, Yuval Rabani, Yiftach Ravid
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
14 years 2 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
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...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
STOC
1991
ACM
105views Algorithms» more  STOC 1991»
14 years 2 months ago
An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs
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...
Hristo Djidjev, John H. Reif
STOC
1991
ACM
87views Algorithms» more  STOC 1991»
14 years 2 months ago
Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis
We describe a new deterministic algorithm for the problem of constructing k-th
Johannes Buchmann, Victor Shoup
STOC
1991
ACM
109views Algorithms» more  STOC 1991»
14 years 2 months ago
Checking Computations in Polylogarithmic Time
László Babai, Lance Fortnow, Leonid ...