AbstractI borrow themes from statistics—epsecially the Bayesian ideas underlying average-case analysis and ideas of sequential design of experiments—to discuss when parallel computation is likely to be an attractive technique
This session explores, through the use of formal methods, the “intuition” used in creating a paralle...
Abstract. We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “p...
This thesis reviews selected topics from the theory of parallel computa-tion. The research begins wi...
AbstractI borrow themes from statistics—epsecially the Bayesian ideas underlying average-case analys...
Four paradigms that can be useful in developing parallel algorithms are discussed. These include com...
The present state of electronic technology is such that factors affecting computation speed have alm...
As technology progresses, the processors used for statistical computation are not getting faster: th...
Computational complexity theory studies which computational problems can be solved with limited acce...
AbstractThis paper outlines a theory of parallel algorithms that emphasizes two crucial aspects of p...
In the realm of sequential computing the random access machine has successufully provided an underly...
Emerging many-core computer architectures provide an incentive for computational methods to exhibit ...
Parallel computing has always fascinated me since I became aware of it. I think it is the only path ...
The emerging discipline of algorithm engineering has primarily focussed on transforming pencil-and...
Parallel algorithms have been a subject of intensive algorithmic research in the 1980s. This researc...
We present QuickStep, a novel system for parallelizing sequential programs. Unlike standard parallel...
This session explores, through the use of formal methods, the “intuition” used in creating a paralle...
Abstract. We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “p...
This thesis reviews selected topics from the theory of parallel computa-tion. The research begins wi...
AbstractI borrow themes from statistics—epsecially the Bayesian ideas underlying average-case analys...
Four paradigms that can be useful in developing parallel algorithms are discussed. These include com...
The present state of electronic technology is such that factors affecting computation speed have alm...
As technology progresses, the processors used for statistical computation are not getting faster: th...
Computational complexity theory studies which computational problems can be solved with limited acce...
AbstractThis paper outlines a theory of parallel algorithms that emphasizes two crucial aspects of p...
In the realm of sequential computing the random access machine has successufully provided an underly...
Emerging many-core computer architectures provide an incentive for computational methods to exhibit ...
Parallel computing has always fascinated me since I became aware of it. I think it is the only path ...
The emerging discipline of algorithm engineering has primarily focussed on transforming pencil-and...
Parallel algorithms have been a subject of intensive algorithmic research in the 1980s. This researc...
We present QuickStep, a novel system for parallelizing sequential programs. Unlike standard parallel...
This session explores, through the use of formal methods, the “intuition” used in creating a paralle...
Abstract. We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “p...
This thesis reviews selected topics from the theory of parallel computa-tion. The research begins wi...
DOI
Add to ORKG