STOC
1991
ACM
14 years 1 months ago
1991
ACM
STOC
1991
ACM
14 years 1 months ago
1991
ACM
STOC
1991
ACM
14 years 1 months ago
1991
ACM
STOC
1991
ACM
14 years 1 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...
STOC
1991
ACM
14 years 1 months ago
1991
ACM
SPDP
1991
IEEE
14 years 1 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
COMPGEOM
1991
ACM
14 years 1 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
COCO
1991
Springer
14 years 1 months ago
1991
Springer
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
COCO
1991
Springer
14 years 1 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
COCO
1991
Springer
14 years 1 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...