Add to ORKGThe Block Distributed Memory (BDM) model is a parallel computation model that captures the performance of parallel algorithms on modern day distributed memory parallel computers. This thesis is an investigation into some theoretical and implementation issues in the design of practical parallel algorithms for a set of basic problems that normally arise in tree structured computation, in biconnectivity problems for graphs and for some fundamental problems in interval graphs for the BDM model. The mos
The mapping of Branch and Bound (BB) algorithms on Distributed Memory Multiprocessors (DMMs) is cons...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
This article focuses on principles for the design of efficient parallel algorithms for distributed m...
Abstract. In this paper we propose a new algorithm for finding the blocks (biconnected components) o...
In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM...
In this report, we propose new concurrent data structures and load balancing strategies for Branch-a...
AbstractFour parallel algorithms for the solution of block bidiagonal linear systems on distributed ...
In this paper, we present deterministic parallel algorithms for the coarse grained multicomputer (CG...
Parallel algorithms are given for finding a maximum weighted clique, a maximum weighted independent ...
AbstractParallel algorithms are given for finding a maximum weighted clique, a maximum weighted inde...
Using an exclusive-read and exclusive-write (EREW) parallel random-access memory (PRAM) model with a...
(eng) This paper describes efficient coarse-grained parallel algorithms and implementations for a su...
Parallel computation presents problems which are either nonexistent or trivial in the context of seq...
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation...
[[abstract]]ABSTRACT The Designs and Analyses of Parallel Algorithms for Some Problems on Permutatio...
The mapping of Branch and Bound (BB) algorithms on Distributed Memory Multiprocessors (DMMs) is cons...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
This article focuses on principles for the design of efficient parallel algorithms for distributed m...
Abstract. In this paper we propose a new algorithm for finding the blocks (biconnected components) o...
In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM...
In this report, we propose new concurrent data structures and load balancing strategies for Branch-a...
AbstractFour parallel algorithms for the solution of block bidiagonal linear systems on distributed ...
In this paper, we present deterministic parallel algorithms for the coarse grained multicomputer (CG...
Parallel algorithms are given for finding a maximum weighted clique, a maximum weighted independent ...
AbstractParallel algorithms are given for finding a maximum weighted clique, a maximum weighted inde...
Using an exclusive-read and exclusive-write (EREW) parallel random-access memory (PRAM) model with a...
(eng) This paper describes efficient coarse-grained parallel algorithms and implementations for a su...
Parallel computation presents problems which are either nonexistent or trivial in the context of seq...
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation...
[[abstract]]ABSTRACT The Designs and Analyses of Parallel Algorithms for Some Problems on Permutatio...
The mapping of Branch and Bound (BB) algorithms on Distributed Memory Multiprocessors (DMMs) is cons...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
This article focuses on principles for the design of efficient parallel algorithms for distributed m...