10156 search results - page 1830 / 2032 » Step by Step to Histories |
203
click to vote
PVM
1997
Springer
15 years 11 months ago
1997
Springer
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
208
click to vote
SPDP
1993
IEEE
15 years 11 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
230
click to vote
COMPGEOM
1992
ACM
15 years 11 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
198
click to vote
STOC
1993
ACM
15 years 11 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...
315
click to vote
STOC
1993
ACM
15 years 11 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 ...