STOC
1993
ACM
14 years 9 months ago
1993
ACM
STOC
1993
ACM
14 years 9 months ago
1993
ACM
STOC
1993
ACM
14 years 9 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
STOC
1993
ACM
14 years 9 months ago
1993
ACM
d Abstract) Arthur W. Chou1 and Ker-I Ko2 March 9, 1993
STOC
1993
ACM
14 years 9 months ago
1993
ACM
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
STOC
1993
ACM
14 years 9 months ago
1993
ACM
STOC
1993
ACM
14 years 9 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
STOC
1993
ACM
14 years 9 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
STOC
1993
ACM
14 years 9 months ago
1993
ACM
STOC
1993
ACM
14 years 9 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...