One of the main promises of aspect-oriented programming (AOP) is to promote improved
modularization of crosscutting concerns, thereby enhancing the software stability in the …

In this paper we present deterministic parallel algorithms for the coarse-grained
multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following …

We present a randomized parallel algorithm for constructing the 3D convex hull on a generic
p-processor coarse grained multicomputer with arbitrary interconnection network and n/p …

In this paper, we present deterministic parallel algorithms for the coarse grained
multicomputer (CGM) and bulk-synchronous parallel computer (BSP) models which solve …

External memory (EM) algorithms are designed for computational problems in which the size
of the internal memory of the computer is only a small fraction of the problem size. For …

We study randomized techniques for designing e cient algorithms on a p-processor bulk-
synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for …

Consider the selection problem of determining the k th smallest element of a set of n
elements. Under the CGM (coarse-grained multicomputer) model with p processors and O …

Block-wise access to data is a central theme in the design of efficient external memory (EM)
algorithms. A second important issue, when more than one disk is present, is fully parallel …

Partitioningunstructuredgraphsis central to the parallel solution of computational science
and engineering problems, Spectral partitioners, such recursive spectral bisection (RSB) …

In this paper we describe scalable parallel algorithms for building the Convex Hull and a
Triangulation of a given point set in R/sup 2/. These algorithms are designed for the coarse …